Cracking the Coding Interview 6th Edition - JavaScript ES6

Chapter1 Arrays and Strings

• 1.0 chapter1-all-problems.js
• 1.1 isUnique.js
• 1.2.0 whatIsPermutation.js this for understanding how to make permutation of a string.
• 1.2.1 isPermutation.js
• 1.3 URLify.js
• 1.4 isPalindrome.js
• 1.5 oneWay.js
• 1.6 strCompression.js
• 1.7 rotateMatrix.js
• 1.8 zeroMatrix.js
• 1.9 stringRotation.js

Chapter2 Linked Lists

• 2.1 removeDups.js
• 2.2 kthElements.js
• 2.3 deleteMiddleNode.js
• 2.4 partition.js
• 2.5 sumLists.js
• 2.6 palindrome.js
• 2.7 intersection.js
• 2.8 detectLoop.js

Chapter3 Stacks and Queues

• 3.0.1 MyStack.js Stack implementation
• 3.0.2 MyQueue.js Queue implementation
• 3.1 ThreeInOne.js
• 3.2 StackMin.js
• 3.3 SetOfStacks.js
• 3.4 QueueViaStack.js
• 3.5 sortStack.js
• 3.6 AnimalsQueueAdoption.js

Chapter4 Trees and Graphs

• 4.0.1 inOrderTraversal.js
• 4.0.2 preOrderTraversal.js
• 4.0.3 postOrderTraversal.js
• 4.0.4 breadthFirstSearch.js
• 4.0.5 addNodeToBinarySearchTree.js
• 4.1 routeBetweenNodes.js
• 4.2 minimalTree.js
• 4.3 listOfDepths.js
• 4.4 checkBalanced.js
• 4.5 validateBST.js
• 4.6 successor.js
• 4.7 buildOrder.js
• 4.8 firstCommonAncestor.js
• 4.10 checkSubTree.js
• 4.11 randomNode.js
• 4.12 pathsWithSum.js