Commit 1554ba5

authored

test: add tests for NumberOfSubsetEqualToGivenSum (TheAlgorithms#1661)

1 parent 3623e42 commit 1554ba5Copy full SHA for 1554ba5

File tree

+33

-7

lines changed

+33

-7

lines changed

Lines changed: 8 additions & 7 deletions

Original file line number	Diff line number	Diff line change
`@@ -1,12 +1,19 @@`
`1`	`1`	`/*`
`2`		`-Given an array of non-negative integers and a value sum,`
	`2`	`+Given an array of positive integers and a value sum,`
`3`	`3`	`determine the total number of the subset with sum`
`4`	`4`	`equal to the given sum.`
`5`	`5`	`*/`
`6`	`6`	`/*`
`7`	`7`	`Given solution is O(n*sum) Time complexity and O(sum) Space complexity`
`8`	`8`	`*/`
`9`	`9`	`function NumberOfSubsetSum(array, sum) {`
	`10`	`+ if (sum < 0) {`
	`11`	`+ throw new Error('The sum must be non-negative.')`
	`12`	`+ }`
	`13`	`+`
	`14`	`+ if (!array.every((num) => num > 0)) {`
	`15`	`+ throw new Error('All of the inputs of the array must be positive.')`
	`16`	`+ }`
`10`	`17`	`const dp = [] // create an dp array where dp[i] denote number of subset with sum equal to i`
`11`	`18`	`for (let i = 1; i <= sum; i++) {`
`12`	`19`	`dp[i] = 0`
`@@ -23,10 +30,4 @@ function NumberOfSubsetSum(array, sum) {`
`23`	`30`	`return dp[sum]`
`24`	`31`	`}`
`25`	`32`
`26`		`-// example`
`27`		`-`
`28`		`-// const array = [1, 1, 2, 2, 3, 1, 1]`
`29`		`-// const sum = 4`
`30`		`-// const result = NumberOfSubsetSum(array, sum)`
`31`		`-`
`32`	`33`	`export { NumberOfSubsetSum }`

Lines changed: 25 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,25 @@`
	`1`	`+import { NumberOfSubsetSum } from '../NumberOfSubsetEqualToGivenSum'`
	`2`	`+`
	`3`	`+describe('Testing NumberOfSubsetSum', () => {`
	`4`	`+ it.each([`
	`5`	`+ [[], 0, 1],`
	`6`	`+ [[], 1, 0],`
	`7`	`+ [[1], 2, 0],`
	`8`	`+ [[1, 2, 3, 4, 5], 0, 1],`
	`9`	`+ [[1, 1, 1, 1, 1], 5, 1],`
	`10`	`+ [[1, 1, 1, 1, 1], 4, 5],`
	`11`	`+ [[1, 2, 3, 3], 6, 3],`
	`12`	`+ [[10, 20, 30, 1], 31, 2],`
	`13`	`+ [[1, 1, 2, 2, 3, 1, 1], 4, 18]`
	`14`	`+ ])('check with %j and %i', (arr, sum, expected) => {`
	`15`	`+ expect(NumberOfSubsetSum(arr, sum)).toBe(expected)`
	`16`	`+ })`
	`17`	`+`
	`18`	`+ it.each([`
	`19`	`+ [[1, 2], -1],`
	`20`	`+ [[0, 2], 2],`
	`21`	`+ [[1, -1], 0]`
	`22`	`+ ])('throws for %j and %i', (arr, sum) => {`
	`23`	`+ expect(() => NumberOfSubsetSum(arr, sum)).toThrowError()`
	`24`	`+ })`
	`25`	`+})`

Comments

(0)