Dynamic-Programming : remove live code & console.log, leave examples as comments.

Author: lvlte

Dynamic-Programming/ClimbingStairs.js

@@ -16,11 +16,4 @@ const climbStairs = (n) => {
  return cur
 }
 
-const main = () => {
- const number = 5
-
- console.log('Number of ways to climb ' + number + ' stairs in ' + climbStairs(number))
-}
-
-// testing
-main()
+export { climbStairs }

Dynamic-Programming/EditDistance.js

@@ -51,11 +51,4 @@ const minimumEditDistance = (word1, word2) => {
  return dp[m][n]
 }
 
-const main = () => {
- console.log(minimumEditDistance('horse', 'ros'))
- console.log(minimumEditDistance('cat', 'cut'))
- console.log(minimumEditDistance('', 'abc'))
- console.log(minimumEditDistance('google', 'glgool'))
-}
-
-main()
+export { minimumEditDistance }

Dynamic-Programming/FibonacciNumber.js

@@ -11,8 +11,4 @@ const fibonacci = (N) => {
  return memo[N]
 }
 
-// testing
-(() => {
- const number = 5
- console.log(number + 'th Fibonacci number is ' + fibonacci(number))
-})()
+export { fibonacci }

Dynamic-Programming/FindMonthCalendar.js

@@ -13,8 +13,8 @@ class Month {
  this.monthDaysLeap = [31, 31, 29, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31]
  }
 
- printCal (days, startDay) {
- console.log('M T W Th F S Su')
+ printCal (days, startDay, output = value => console.log(value)) {
+ output('M T W Th F S Su')
  const dates = []; let i
  for (i = 1; i <= days; i++) {
  dates.push(i)
@@ -30,7 +30,7 @@ class Month {
  row += ' '
  }
  }
- console.log(row)
+ output(row)
  if (dates.length === 0) break
  }
  }
@@ -108,6 +108,7 @@ class Month {
  }
 }
 
-// testing
-const x = new Month()
-x.generateMonthCal('1/2021')
+export { Month }
+
+// const x = new Month()
+// x.generateMonthCal('1/2021')

Dynamic-Programming/LevenshteinDistance.js

@@ -17,6 +17,7 @@ function costOfSubstitution (x, y) {
  return x === y ? 0 : 1
 }
 
+// Levenshtein distance between x and y
 function calculate (x, y) {
  const dp = new Array(x.length + 1)
  for (let i = 0; i < x.length + 1; i++) {
@@ -38,12 +39,4 @@ function calculate (x, y) {
  return dp[x.length][y.length]
 }
 
-function main () {
- const x = '' // enter your string here
- const y = '' // enter your string here
-
- console.log('Levenshtein distance between ' + x + ' and ' + y + ' is: ')
- console.log(calculate(x, y))
-}
-
-main()
+export { calculate }

Dynamic-Programming/LongestCommonSubsequence.js

@@ -22,12 +22,11 @@ function longestCommonSubsequence (x, y, str1, str2, dp) {
  }
 }
 
-function main () {
- const str1 = 'ABCDGH'
- const str2 = 'AEDFHR'
- const dp = new Array(str1.length + 1).fill(0).map(x => new Array(str2.length + 1).fill(0))
- const res = longestCommonSubsequence(str1.length - 1, str2.length - 1, str1, str2, dp)
- console.log(res)
-}
+// Example
+
+// const str1 = 'ABCDGH'
+// const str2 = 'AEDFHR'
+// const dp = new Array(str1.length + 1).fill(0).map(x => new Array(str2.length + 1).fill(0))
+// const res = longestCommonSubsequence(str1.length - 1, str2.length - 1, str1, str2, dp)
 
-main()
+export { longestCommonSubsequence }

Dynamic-Programming/LongestIncreasingSubsequence.js

@@ -3,8 +3,8 @@
  * https://en.wikipedia.org/wiki/Longest_increasing_subsequence
  */
 
-function main () {
- const x = [0, 8, 4, 12, 2, 10, 6, 14, 1, 9, 5, 13, 3, 11, 7, 15]
+// Return the length of the Longest Increasing Subsequence, given array x
+function longestIncreasingSubsequence (x) {
  const length = x.length
  const dp = Array(length).fill(1)
 
@@ -21,7 +21,7 @@ function main () {
  }
  }
 
- console.log('Length of Longest Increasing Subsequence is:', res)
+ return res
 }
 
-main()
+export { longestIncreasingSubsequence }

Dynamic-Programming/MaxNonAdjacentSum.js

@@ -19,11 +19,11 @@ function maximumNonAdjacentSum (nums) {
  return Math.max(maxExcluding, maxIncluding)
 }
 
-function main () {
- console.log(maximumNonAdjacentSum([1, 2, 3]))
- console.log(maximumNonAdjacentSum([1, 5, 3, 7, 2, 2, 6]))
- console.log(maximumNonAdjacentSum([-1, -5, -3, -7, -2, -2, -6]))
- console.log(maximumNonAdjacentSum([499, 500, -3, -7, -2, -2, -6]))
-}
+// Exmaple
+
+// maximumNonAdjacentSum([1, 2, 3]))
+// maximumNonAdjacentSum([1, 5, 3, 7, 2, 2, 6]))
+// maximumNonAdjacentSum([-1, -5, -3, -7, -2, -2, -6]))
+// maximumNonAdjacentSum([499, 500, -3, -7, -2, -2, -6]))
 
-main()
+export { maximumNonAdjacentSum }

Dynamic-Programming/MinimumCostPath.js

@@ -26,21 +26,19 @@ const minCostPath = (matrix) => {
  return moves[n - 1][m - 1]
 }
 
-const main = () => {
- console.log(
- minCostPath([
- [2, 1],
- [3, 1],
- [4, 2]
- ])
- )
- console.log(
- minCostPath([
- [2, 1, 4],
- [2, 1, 3],
- [3, 2, 1]
- ])
- )
-}
+export { minCostPath }
+
+// Example
+
+// minCostPath([
+// [2, 1],
+// [3, 1],
+// [4, 2]
+// ])
+
+// minCostPath([
+// [2, 1, 4],
+// [2, 1, 3],
+// [3, 2, 1]
+// ])
 
-main()

Dynamic-Programming/NumberOfSubsetEqualToGivenSum.js

@@ -23,10 +23,10 @@ function NumberOfSubsetSum (array, sum) {
  return dp[sum]
 }
 
-function main () {
- const array = [1, 1, 2, 2, 3, 1, 1]
- const sum = 4
- const result = NumberOfSubsetSum(array, sum)
- console.log(result)
-}
-main()
+// example
+
+// const array = [1, 1, 2, 2, 3, 1, 1]
+// const sum = 4
+// const result = NumberOfSubsetSum(array, sum)
+
+export { NumberOfSubsetSum }