Added RodCuttingProblem [JavaScript] (#363)

* Added  rodCuttingProblem [JavaScript]

* Added rodCuttingProblem [JavaScript]

* bot fix v1.0

* Monal changes :O

* Take that inches off  !

* Use GFG implementation

* Declare tmax atleast !

Author: anshumanv

README.md

@@ -36,7 +36,7 @@ Community (college) maintained list of Algorithms and Data Structures implementa
 | [Prims](https://en.wikipedia.org/wiki/Prim%27s_algorithm) | [:white_check_mark:](prims/prims.c) | | [:white_check_mark:](prims/Prims.java) | | | |
 | [Quick Select](https://en.wikipedia.org/wiki/Quickselect) | [:white_check_mark:](quick_select/quick_select.c) | | [:white_check_mark:](quick_select/QuickSelect.java) | [:white_check_mark:](quick_select/quick_select.py) | | |
 | [Quicksort](https://en.wikipedia.org/wiki/Quicksort) | [:white_check_mark:](quicksort/quicksort.c) | | [:white_check_mark:](quicksort/QuickSort.java) | [:white_check_mark:](quicksort/quick_sort.py) | [:white_check_mark:](quicksort/quick_sort.go) | |
-| [Rod Cutting Problem](http://www.geeksforgeeks.org/dynamic-programming-set-13-cutting-a-rod/) | [:white_check_mark:](rod_cutting_problem/rod_cutting.c) | | [:white_check_mark:](rod_cutting_problem/RodCutting.java) | [:white_check_mark:](rod_cutting_problem/rod_cutting.py) | [:white_check_mark:](rod_cutting_problem/rod_cutting.go) | |
+| [Rod Cutting Problem](http://www.geeksforgeeks.org/dynamic-programming-set-13-cutting-a-rod/) | [:white_check_mark:](rod_cutting_problem/rod_cutting.c) | | [:white_check_mark:](rod_cutting_problem/RodCutting.java) | [:white_check_mark:](rod_cutting_problem/rod_cutting.py) | [:white_check_mark:](rod_cutting_problem/rod_cutting.go) | [:white_check_mark:](rod_cutting_problem/rodCuttingProblem.js) |
 | [Shell Sort](https://en.wikipedia.org/wiki/Shellsort) | | [:white_check_mark:](shell_sort/ShellSort.cpp) | | [:white_check_mark:](/shell_sort/shell_sort.py) | [:white_check_mark:](shell_sort/shell_sort.go) | [:white_check_mark:](shell_sort/shellSort.js) |
 | [Sieve of Eratosthenes](https://en.wikipedia.org/wiki/Sieve_of_Eratosthenes) | [:white_check_mark:](sieve_of_eratosthenes/sieveOfEratosthenes.c) | | [:white_check_mark:](sieve_of_eratosthenes/SieveOfEratosthenes.java) | [:white_check_mark:](sieve_of_eratosthenes/sieve_of_eratosthenes.py) | [:white_check_mark:](sieve_of_eratosthenes/sieve_of_eratosthenes.go) | [:white_check_mark:](sieve_of_eratosthenes/sieveOfEratosthenes.js) |
 | [Sleep Sort](http://www.geeksforgeeks.org/sleep-sort-king-laziness-sorting-sleeping/) | | [:white_check_mark:](sleep_sort/sleep_sort.cpp) | | [:white_check_mark:](sleep_sort/sleep_sort.py) | | |

rod_cutting_problem/rodCuttingProblem.js

@@ -0,0 +1,35 @@
+/*
+* Problem Statement: Given a rod of length n and an array of prices that contains prices of all pieces of size smaller than n.
+* Determine the maximum value obtainable by cutting up the rod and selling the pieces.
+*/
+
+function rodCuttingProblem (price) {
+	/*
+	Computes maximum money that can be earned by cutting a rod of length n (Bottom-Up Approach).
+	Time Complexity	:	O(n ^ 2)
+	Space Complexity : O(n)
+	:param price:	Array in which price[i] denotes price	of rod of length i.
+	:return: returns maximum value obtainable by cutting up the rod and selling the pieces.
+	*/
+	let n = price.length;
+	let bestPrice = new Array(n + 1);
+	bestPrice.fill(0);
+	for (let i = 1; i < bestPrice.length; i++) {
+		bestPrice[i] = price[i - 1];
+	}
+	for (let i = 1; i <= n; i++) {
+		let tmax = Number.MIN_SAFE_INTEGER;
+		for (let j = 0; j < i; j++) {
+			tmax = Math.max(tmax, bestPrice[i - j - 1] + price[j]);
+		}
+		bestPrice[i] = tmax;
+	}
+	return bestPrice[n];
+}
+
+function main () {
+	let price = [10, 52, 84, 93, 101, 17, 117, 20];
+	console.log('Maximum obtainable value is : ' + rodCuttingProblem(price));
+}
+
+main();