mirror of
https://github.com/TheAlgorithms/JavaScript.git
synced 2025-07-05 16:26:47 +08:00
added tests for Backtracking/AllCombinationsOfSizeK
This commit is contained in:
@ -38,20 +38,7 @@ class Combinations {
|
||||
this.findCombinations(high, total - 1, i + 1)
|
||||
this.combinationArray.pop()
|
||||
}
|
||||
};
|
||||
}
|
||||
}
|
||||
|
||||
/*
|
||||
Driver Code
|
||||
|
||||
Test Case 1: n = 3, k = 2
|
||||
Test Case 2: n = 4, k = 2
|
||||
*/
|
||||
|
||||
console.log('\nFirst Test Case')
|
||||
const test1 = new Combinations(3, 2)
|
||||
test1.findCombinations()
|
||||
|
||||
console.log('\nSecond Test Case')
|
||||
const test2 = new Combinations(4, 2)
|
||||
test2.findCombinations()
|
||||
export { Combinations }
|
||||
|
13
Backtracking/tests/AllCombinationsOfSizeK.test.mjs
Normal file
13
Backtracking/tests/AllCombinationsOfSizeK.test.mjs
Normal file
@ -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]])
|
||||
})
|
||||
})
|
Reference in New Issue
Block a user