turingfly / cracking-the-coding-interview

Java solutions and explanations to problems in the book Cracking the Coding Interview(6th Edition).

Cracking the Coding Interview (6th Edition)

Java solutions to problems in the book Cracking the Coding Interview(6th Edition).

Table of Contents

• Arrays and Strings
• LinkedList
• Stacks and Queues
• Trees and Graphs
• Bit Manipulation
• Math and Logic Puzzles
• Object Oriented Design
• Recursion and Dynamic Programming
• System Design and Scalability
• Sorting and Searching
• Testing
• Additional Review Problems

Arrays and Strings

• Check Permutation
  
• Is Unique
  
• One Away
  
• Palindrome Permutation
  
• Rotate Matrix
  
• String Compression
  
• String Rotation
  
• Urlify
  
• Zero Matrix
  

LinkedList

• Delete Middle Node
  
• Intersection
  
• ListNode
  
• Loop Detection
  
• Palindrome
  
• Partition
  
• Remove Duplicates
  
• Return Kth To Last
  
• Sum Lists
  

Stacks and Queues

• Animal Shelter
  
• Three Stacks in One Array
  
• Implement Queue Using Stacks
  
• Min Stack
  
• Sort Stack
  

Trees and Graphs

• Check Balanced Tree
  
• First Common Ancestor
  
• List of Depths
  
• Minimal Tree
  
• Paths with Sum
  
• Random Node
  
• Route between Nodes
  
• Successor
  
• Tree Node
  
• Validate BST
  

Bit Manipulation

• Binary to String
  
• Conversion
  
• Flip Bit to Win
  
• Insertion
  
• Introduction
  
• Next Number
  
• Pairwise Swap
  

Math and Logic Puzzles

• Generate a List of Primes
  

Object Oriented Design

Recursion and Dynamic Programming

• Boolean Evaluation
  
• Coins
  
• Eight Queues
  
• Fibonacci
  
• Magic Index
  
• Paint Fill
  
• Parenthesis
  
• Permutations with Duplicates
  
• Permutations without Duplicates
  
• Power Set
  
• Recursive Multiply
  
• Robot In a Grid
  
• Stack of Boxes
  
• Towers of Hanoi
  
• Triple Steps
  

System Design and Scalability

Sorting and Searching

• Group Anagrams
  
• Merge Sort
  
• Quick Sort
  
• Search in Rotated Array
  
• Sort Big File
  
• Sorted Merge
  
• Sorted Search No Size
  
• Sparse Search
  

Testing

Additional Review Problems (Moderate)

Additional Review Problems (Hard)

cracking-the-coding-interview's Issues

https://github.com/Turingfly/cracking-the-coding-interview/blob/master/src/chapter01ArraysAndStrings/OneAway.java

Wondering if method 2 is correct because question asked if string one and two are ZERO or one edit (REPLACE, remove or add a char )

so let's take an example of same length strings s1: aab and s2 : abb, here your method would return false but correct answer is , i believe, true.

method2(String s1, String s2) {
		if (s1 == null || s2 == null || **s1.length() - s2.length()** == 0) {
			return false;
		}

Incorrect code

Here: https://github.com/Turingfly/cracking-the-coding-interview/blob/master/src/chapter01ArraysAndStrings/OneAway.java#L37

Exception in thread "main" java.lang.ArrayIndexOutOfBoundsException

Exception in thread "main" java.lang.ArrayIndexOutOfBoundsException: Index -1 out of bounds for length 3
at ctci.RobotInAGrid.getPath1(RobotInAGrid.java:49)
at ctci.RobotInAGrid.getPath1(RobotInAGrid.java:56)
at ctci.RobotInAGrid.getPath1(RobotInAGrid.java:56)
at ctci.RobotInAGrid.getPath1(RobotInAGrid.java:56)
at ctci.RobotInAGrid.getPath1(RobotInAGrid.java:41)
at ctci.RobotInAGrid.main(RobotInAGrid.java:33)

Program RobotInAGrid.java
Error Line 70

if (!maze[row][col] || col < 0 || row < 0) {
			return false;
}

Must Be

if (col < 0 || row < 0 || !maze[row][col]) {
			return false;
}