Python and combinatory

Problem Find all the combination of two in a team Solution from itertools import combinations team = ["john", "joe", "bob", "al", "tony", "mark"] comb = combinations(team, 2) for i in list(comb): print(i) Result: ('john', 'joe') ('john', 'bob') ('john', 'al') ('john', 'tony') ('john', 'mark') ('joe', 'bob') ('joe', 'al') ('joe', 'tony') ('joe', 'mark') ('bob', 'al') ('bob', 'tony') ('bob', 'mark') ('al', 'tony') ('al', 'mark') ('tony', 'mark') Let’s up the game now we want to arrange the combinations results in a way that none of these guys are on call twice in a row...

August 22, 2021 · 2 min · YS

Git good practices

Do you git it? Learn Git Interactively GitHub resources Free Code Camp - Git Git in 20 min (Video) Git bless you How to Write a Git Commit Message A successful Git branching model Using git-flow to automate your git branching workflow One flow Pull it together Better Pull Requests Great Pull Requests Code Review BP Tooling git GUI clients Gitflow AVH Magit (emacs) tig git for windows (if you have too…) Git Ops General resources GitOps GitLab view on GitOps

September 3, 2019 · 1 min · YS