fibLastNumber.js - to find the last digit of š¯‘›-th Fibonacci number
GDC-LCM.js - Greatest Common Divisor & Least Common Multiple (a*b/GCD(a,b) && prime factorization LCM) (node couldn't work with big numbers (ex. 1827116622 251772294 ))
GDC-LCM.js - Greatest Common Divisor & Least Common Multiple (LCM = a*b/GCD(a,b) java could work with big numbers)
changingMoney.js - The goal in this problem is to find the minimum number of coins needed to change the input value (an integer) into coins with denominations 1, 5, and 10. ( elementary greedy algorithm )
fractionalKnapsack.js - The goal of this code problem is to implement an algorithm for the fractional knapsack problem.
editingDistance.js - The goal of this problem is to implement the algorithm for computing the edit distance between two strings.