Merge pull request loiane#76 from loiane/third-edition

Third edition

Author: loiane

src/ts/algorithms/greedy/knapsack.ts

@@ -1,4 +1,4 @@
-function knapSack(capacity: number, weights: number[], values: number[]) {
+export function knapSack(capacity: number, weights: number[], values: number[]) {
   const n = values.length;
   let load = 0;
   let val = 0;

src/ts/algorithms/greedy/longest-common-subsequence.ts

@@ -1,4 +1,4 @@
-function lcs(wordX: string, wordY: string, m = wordX.length, n = wordY.length): number {
+export function lcs(wordX: string, wordY: string, m = wordX.length, n = wordY.length): number {
   if (m === 0 || n === 0) {
     return 0;
   }

src/ts/algorithms/greedy/min-coin-change.ts

@@ -1,4 +1,4 @@
-function minCoinChange(coins: number[], amount: number) {
+export function minCoinChange(coins: number[], amount: number) {
   const change: number[] = [];
   let total = 0;
   for (let i = coins.length; i >= 0; i--) {

src/ts/index.ts

@@ -63,9 +63,17 @@ export { findMinValue as findMinValue } from './algorithms/search/min-max-search
 
 // chapter 14
 export { binarySearch as binarySearchRecursive } from './algorithms/search/binary-search-recursive';
-export { minCoinChange as minCoinChange } from './algorithms/dynamic-programing/min-coin-change';
-export { ratInAMaze as ratInAMaze } from './algorithms/backtracking/rat-in-maze';
-export { sudokuSolver as sudokuSolver } from './algorithms/backtracking/sudoku-solver';
+export { minCoinChange } from './algorithms/dynamic-programing/min-coin-change';
+export { minCoinChange as minCoinChangeGreedy } from './algorithms/greedy/min-coin-change';
+export { knapSack } from './algorithms/dynamic-programing/knapsack';
+export { knapSack as knapSackRecursive } from './algorithms/dynamic-programing/knapsack-recursive';
+export { knapSack as knapSackGreedy } from './algorithms/greedy/knapsack';
+export { lcs } from './algorithms/dynamic-programing/longest-common-subsequence';
+export { lcs as lcsPrint } from './algorithms/dynamic-programing/longest-common-subsequence-print';
+export { lcs as lcsRecursive } from './algorithms/greedy/longest-common-subsequence';
+export { ratInAMaze } from './algorithms/backtracking/rat-in-maze';
+export { sudokuSolver } from './algorithms/backtracking/sudoku-solver';
+
 
 
 /* import { hotPotato } from './others/hot-potato';

test/js/algorithms/backtracking/rat-in-maze.spec.js

@@ -0,0 +1,21 @@
+import 'mocha';
+import { expect } from 'chai';
+import { ratInAMaze } from '../../../../src/js/index';
+
+describe('Rat in a maze', () => {
+  it('rat in a maze solver', () => {
+    const maze = [
+      [1, 0, 0, 0],
+      [1, 1, 1, 1],
+      [0, 0, 1, 0],
+      [0, 1, 1, 1]
+    ];
+    const solution = [
+      [1, 0, 0, 0],
+      [1, 1, 1, 0],
+      [0, 0, 1, 0],
+      [0, 0, 1, 1]
+    ];
+    expect(ratInAMaze(maze)).to.deep.equal(solution);
+  });
+});

test/js/algorithms/backtracking/sudoku-solver.spec.js

@@ -0,0 +1,57 @@
+import 'mocha';
+import { expect } from 'chai';
+import { sudokuSolver } from '../../../../src/js/index';
+
+describe('Sudoku Solver', () => {
+  it('sudoku solver', () => {
+    const grid = [
+      [3, 0, 6, 5, 0, 8, 4, 0, 0],
+      [5, 2, 0, 0, 0, 0, 0, 0, 0],
+      [0, 8, 7, 0, 0, 0, 0, 3, 1],
+      [0, 0, 3, 0, 1, 0, 0, 8, 0],
+      [9, 0, 0, 8, 6, 3, 0, 0, 5],
+      [0, 5, 0, 0, 9, 0, 6, 0, 0],
+      [1, 3, 0, 0, 0, 0, 2, 5, 0],
+      [0, 0, 0, 0, 0, 0, 0, 7, 4],
+      [0, 0, 5, 2, 0, 6, 3, 0, 0]
+    ];
+    const solution = [
+      [3, 1, 6, 5, 7, 8, 4, 9, 2],
+      [5, 2, 9, 1, 3, 4, 7, 6, 8],
+      [4, 8, 7, 6, 2, 9, 5, 3, 1],
+      [2, 6, 3, 4, 1, 5, 9, 8, 7],
+      [9, 7, 4, 8, 6, 3, 1, 2, 5],
+      [8, 5, 1, 7, 9, 2, 6, 4, 3],
+      [1, 3, 8, 9, 4, 7, 2, 5, 6],
+      [6, 9, 2, 3, 5, 1, 8, 7, 4],
+      [7, 4, 5, 2, 8, 6, 3, 1, 9]
+    ];
+    expect(sudokuSolver(grid)).to.deep.equal(solution);
+  });
+
+  it('sudoku solver 2', () => {
+    const grid = [
+      [5, 3, 0, 0, 7, 0, 0, 0, 0],
+      [6, 0, 0, 1, 9, 5, 0, 0, 0],
+      [0, 9, 8, 0, 0, 0, 0, 6, 0],
+      [8, 0, 0, 0, 6, 0, 0, 0, 3],
+      [4, 0, 0, 8, 0, 3, 0, 0, 1],
+      [7, 0, 0, 0, 2, 0, 0, 0, 6],
+      [0, 6, 0, 0, 0, 0, 2, 8, 0],
+      [0, 0, 0, 4, 1, 9, 0, 0, 5],
+      [0, 0, 0, 0, 8, 0, 0, 7, 9]
+    ];
+    const solution = [
+      [5, 3, 4, 6, 7, 8, 9, 1, 2],
+      [6, 7, 2, 1, 9, 5, 3, 4, 8],
+      [1, 9, 8, 3, 4, 2, 5, 6, 7],
+      [8, 5, 9, 7, 6, 1, 4, 2, 3],
+      [4, 2, 6, 8, 5, 3, 7, 9, 1],
+      [7, 1, 3, 9, 2, 4, 8, 5, 6],
+      [9, 6, 1, 5, 3, 7, 2, 8, 4],
+      [2, 8, 7, 4, 1, 9, 6, 3, 5],
+      [3, 4, 5, 2, 8, 6, 1, 7, 9]
+    ];
+    expect(sudokuSolver(grid)).to.deep.equal(solution);
+  });
+});

test/ts/algorithms/greedy/knapsack.spec.ts

@@ -0,0 +1,15 @@
+import 'mocha';
+import { expect } from 'chai';
+import { knapSackGreedy } from '../../../../src/ts/index';
+
+describe('Min Coin Change Greedy', () => {
+  const SIZE = 100;
+
+  it('works with greedy approach', () => {
+    const values = [3, 4, 5];
+    const weights = [2, 3, 4];
+    const capacity = 5;
+
+    expect(knapSackGreedy(capacity, weights, values)).to.equal(7);
+  });
+});

test/ts/algorithms/greedy/longest-common-subsequence.spec.ts

@@ -0,0 +1,14 @@
+import 'mocha';
+import { expect } from 'chai';
+import { minCoinChangeGreedy } from '../../../../src/ts/index';
+
+describe('Min Coin Change Greedy', () => {
+
+  const SIZE = 100;
+
+  it('works with greedy approach', () => {
+    expect(minCoinChangeGreedy([1, 5, 10], 15)).to.deep.equal([10, 5]);
+    expect(minCoinChangeGreedy([1, 3, 4], 6)).to.deep.equal([4, 1, 1]);
+  });
+
+});