Merge branch 'master' of https://github.com/manju07/Data-Structure-and-Algorithms

Author: manju07

Algorithms/Dynamic Programming/longestCommonSequence.js

@@ -0,0 +1,45 @@
+'use strict';
+function constructMagicSumMatrix(n) {
+    let matrix = new Array(n);
+    for (let index = 0; index < matrix.length; index++)
+        matrix[index] = new Array(index);
+    for (let i = 0; i < n; i++) {
+        for (let j = 0; j < n; j++) {
+            matrix[i][j] = -1;
+        }
+    }
+    let i = 0,
+        j = parseInt((n / 2)),
+        num = 1;
+    while (num <= (n * n)) {
+        if (i == -1 && j == -1) {
+            i = 1;
+            j = 0;
+        } else {
+            if (i == -1) i = n - 1;
+            if (j == -1) j = n - 1;
+        }
+        if (matrix[i][j] != -1) {
+            i = i + 2;
+            j++;
+            continue;
+        } else matrix[i][j] = num++;
+
+        i--;
+        j--;
+    }
+    return matrix;
+}
+
+function displayMatrix(matrix, n) {
+    for (let i = 0; i < n; i++) {
+        let row = '';
+        for (let j = 0; j < n; j++) {
+            row = row + matrix[i][j] + ' ';
+        }
+        console.log(row);
+    }
+}
+let n = 7;
+let magicMatrix = constructMagicSumMatrix(n);
+displayMatrix(magicMatrix, n);

Data-Structure/Array/rotateArray.js renamed to Data-Structure/Array/1D/rotateArray.js

@@ -0,0 +1,44 @@
+'use strict';
+
+function minimumMoves(visited, moves, n) {
+    let result = {};
+    result.vertex = 0;
+    result.distance = 0;
+    let queue = [result];
+    let temp = null;
+    while (queue.length != 0) {
+        temp = queue.shift();
+        if (result.vertex == n) break;
+        for (let index = (temp.vertex + 1); index <= (temp.vertex + 6) && (temp.vertex < n); index++) {
+            if (visited[index] == 0) {
+                let qEntry = {};
+                qEntry.distance = temp.distance + 1;
+                visited[index] = 1;
+                if (moves[index] != -1) {
+                    qEntry.vertex = moves[index];
+                } else qEntry.vertex = index;
+                queue.push(qEntry);
+            }
+        }
+    }
+    return temp.distance;
+}
+
+let visited = [];
+let moves = [];
+let n = 100;
+for (let index = 0; index < n; index++) {
+    visited[index] = 0;
+    moves[index] = -1;
+}
+// Ladders Positions
+moves[2] = 23;
+moves[19] = 32;
+moves[66] = 82;
+moves[17] = 53;
+
+// Snakes Positions
+moves[99] = 65;
+moves[36] = 18;
+moves[74] = 47;
+console.log('Minimum number of moves ', minimumMoves(visited, moves, n))