Introduction and Problem Solving Tips
  • Introduction
  • What Is a Typical Coding Interview Like?
  • Problem Solving Technique #1 for Coding Interviews
  • Problem Solving Technique #2 for Coding Interviews
  • Problem Solving Technique #3 for Coding Interviews
Arrays
  • Most Frequently Occurring Item in an Array (Difficulty = *)
  • Most Frequently Occurring Item in an Array (Python)
  • Most Frequently Occurring Item in an Array (Java)
  • Most Frequently Occurring Item in an Array (Solution)
  • Common Elements in Two Sorted Arrays (Difficulty = **)
  • Common Elements in Two Sorted Arrays (Python)
  • Common Elements in Two Sorted Arrays (Java)
  • Common Elements in Two Sorted Arrays (Solution)
  • Is One Array a Rotation of Another? (Difficulty = **)
  • Is One Array a Rotation of Another? (Python)
  • Is One Array a Rotation of Another? (Java)
  • Is One Array a Rotation of Another? (Solution)
Strings
  • Non-Repeating Character (Difficulty = **)
  • Non-Repeating Character (Python)
  • Non-Repeating Character (Java)
  • Non-Repeating Character (Solution)
  • One Away Strings (Difficulty = ***)
  • One Away Strings (Python)
  • One Away Strings (Java)
  • One Away Strings (Solution)
  • One Away Strings (Solution in Pseudocode)
Two-Dimensional Arrays
  • Assign Numbers in Minesweeper (Difficulty = **)
  • Assign Numbers in Minesweeper (Python)
  • Assign Numbers in Minesweeper (Java)
  • Assign Numbers in Minesweeper (Solution)
  • Find Where to Expand in Minesweeper (Difficulty = ***)
  • Find Where to Expand in Minesweeper (Python)
  • Find Where to Expand in Minesweeper (Java)
  • Find Where to Expand in Minesweeper (Solution)
  • Find Where to Expand in Minesweeper (Solution in Pseudocode)
  • Rotating 2D Array (Difficulty = ***)
  • Rotating a 2D Array by 90 Degrees (Python)
  • Rotating a 2D Array by 90 Degrees (Java)
  • Rotating 2D Array (Out-of-Place Solution)
  • Rotating 2D Array (In-Place Solution)
  • Rotating 2D Array (In-Place Solution in Pseudocode)
Linked Lists and Trees
  • N-th Element of a Linked List (Difficulty = **)
  • N-th Element of a Linked List (Python)
  • N-th Element of a Linked List (Java)
  • N-th Element of a Linked List (Solution)
  • Is This a Binary Search Tree? (Difficulty = **)
  • Is This a Binary Search Tree? (Python)
  • Is This a Binary Search Tree? (Java)
  • Is This a Binary Search Tree? (Solution)
  • Is This a Binary Search Tree? (Solution in Pseudocode)
  • Lowest Common Ancestor (Difficulty = ***)
  • Lowest Common Ancestor (Python)
  • Lowest Common Ancestor (Java)
  • Lowest Common Ancestor (Solution)
  • Lowest Common Ancestor (Solution in Pseudocode)
Conclusion
  • Conclusion
  • Have any extra problems I should solve?