Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

Sign up
Appearance settings

added Backtracking/AllCombinationsOfSizeK #748

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
raklaptudirm merged 2 commits into TheAlgorithms:master from chiranjeev-thapliyal:master
Oct 6, 2021
Merged
Show file tree
Hide file tree
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension


Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
44 changes: 44 additions & 0 deletions Backtracking/AllCombinationsOfSizeK.js
View file Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,44 @@
/*
Problem: Given two numbers, n and k, make all unique combinations of k numbers from 1 to n and in sorted order

What is combinations?
- Combinations is selecting items froms a collections without considering order of selection

Example:
- We have an apple, a banana, and a jackfruit
- We have three objects, and need to choose two items, then combinations will be

1. Apple & Banana
2. Apple & Jackfruit
3. Banana & Jackfruit

To read more about combinations, you can visit the following link:
- https://betterexplained.com/articles/easy-permutations-and-combinations/

Solution:
- We will be using backtracking to solve this questions
- Take one element, and make all them combinations for k-1 elements
- Once we get all combinations of that element, pop it and do same for next element
*/

class Combinations {
constructor (n, k) {
this.n = n
this.k = k
this.combinationArray = [] // will be used for storing current combination
}

findCombinations (high = this.n, total = this.k, low = 1) {
if (total === 0) {
console.log(this.combinationArray)
return
}
for (let i = low; i <= high; i++) {
this.combinationArray.push(i)
this.findCombinations(high, total - 1, i + 1)
this.combinationArray.pop()
}
}
}

export { Combinations }
13 changes: 13 additions & 0 deletions Backtracking/tests/AllCombinationsOfSizeK.test.mjs
View file Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,13 @@
import { Combinations } from '../AllCombinationsOfSizeK'

describe('AllCombinationsOfSizeK', () => {
it('should return 3x2 matrix solution for n = 3 and k = 2', () => {
const test1 = new Combinations(3, 2)
expect(test1.findCombinations).toEqual([[1, 2], [1, 3], [2, 3]])
})

it('should return 6x2 matrix solution for n = 3 and k = 2', () => {
const test2 = new Combinations(4, 2)
expect(test2.findCombinations).toEqual([[1, 2], [1, 3], [1, 4], [2, 3], [2, 4], [3, 4]])
})
})
Loading

AltStyle によって変換されたページ (->オリジナル) /