prepare interview questions from Careercup and Cracking the Code Interview in Java , etc.
Solution code
- 1.1 UniqueCharacter.java
- 1.2 ReverseString.java
- 1.3 IsPermutation.java
- 1.4 ReplaceString.java
- 1.5 CompressString.java
- 1.6 RotateImage.java (LeetCode)
- 1.7 SetMatrixZeroes.java (LeetCode)
- 1.8 IsRotation.java
- 2.1 RemoveDuplicatesFromUnsortedLinkedList.java
- 2.2 RemoveNthNodeFromEndofList.java (LeetCode)
- 2.3 RemoveMidNode.java
- 2.4 PartitionList.java (LeetCode)
- 2.5 AddTwoNumbers.java (LeetCode)
- 2.6 LinkedListCycle2.java (LeetCode)
- 2.7 IsLinkedListPalindromic.java
- 3.1 ArrayToThreeStacks.java
- 3.2 StackWithMinElem.java
- 3.3 StackSets.java
- 3.4 Hanoi.java
- 3.5 QueueWithTwoStacks.java
- 3.6 SortingWithTwoStacks.java
- 3.7 AnimalShelter.java
- 4.1 BalancedBinaryTree.java (LeetCode)
- 4.2 SearchRouteInGraph.java (Graph defined)
- 4.3 ConvertSortedArraytoBinarySearchTree.java (LeetCode)
- 4.4 BinaryTreeLevelOrderTraversal.java (LeetCode)
- 4.5 ValidateBinarySearchTree.java (LeetCode)
- 4.6 InorderNextNodeinBST.java (MyTreeNode2 defined, with parent pointer)
- 4.7 LowestCommonAncestor.java (Node and TreeNode defined)
- 4.8 IsSameTree.java(LeetCode) or IsSubtree.java
- 4.9 BinaryTreeSumPath.java (MyTreeNode defined)
- 5.1 InsertInteger.java
- 5.2 DecimalToBinary.java
- 5.3 NextNumber.java
- 5.5 BitsNumberToFlip.java
- 5.6 OddEvenBitsSwap.java
- 5.7 FindMissingNumber.java
- 5.8 DrawLine.java
- 9.1 ClimbingStairs.java (LeetCode)
- 9.2 UniquePaths.java & UniquePaths2.java (LeetCode)
- 9.3 FirstMissingPositive.java (LeetCode)
- 9.4 Subsets.java & Subsets2.java (LeetCode)
- 9.5 Permutations.java & Permutations2.java (LeetCode)
- 9.6 GenerateParentheses.java (LeetCode)
- 9.7 SurroundedRegions.java (LeetCode)
- 9.8 AllChangeCombination.java
- 9.9 NQueens.java (LeetCode)
- 9.10 TallestStack.java
- 9.11 ParenthesizeBooleanExpression.java