Skip to content
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
17 changes: 17 additions & 0 deletions Dynamic-Programming/RodCutting.js
Original file line number Diff line number Diff line change
@@ -0,0 +1,17 @@
/*
* You are given a rod of 'n' length and an array of prices associated with all the lengths less than 'n'.
* Find the maximum profit possible by cutting the rod and selling the pieces.
*/

export function rodCut (prices, n) {
const memo = new Array(n + 1)
memo[0] = 0

for (let i = 1; i <= n; i++) {
let maxVal = Number.MIN_VALUE
for (let j = 0; j < i; j++) { maxVal = Math.max(maxVal, prices[j] + memo[i - j - 1]) }
memo[i] = maxVal
}

return memo[n]
}
21 changes: 21 additions & 0 deletions Dynamic-Programming/tests/RodCutting.test.js
Original file line number Diff line number Diff line change
@@ -0,0 +1,21 @@
import { rodCut } from '../RodCutting'

test('Test Case 1', () => {
expect(rodCut([1, 5, 8, 9, 10, 17, 17, 20], 8)).toBe(22)
})

test('Test Case 2', () => {
expect(rodCut([1, 5, 4, 2, 1, 11, 19, 12], 8)).toBe(20)
})

test('Test Case 3', () => {
expect(rodCut([1, 2, 1], 3)).toBe(3)
})

test('Test Case 4', () => {
expect(rodCut([5, 4, 3, 2, 1], 5)).toBe(25)
})

test('Test Case 5', () => {
expect(rodCut([3, 5, 8, 8, 10, 16, 14, 19], 8)).toBe(24)
})