All Courses › Coding Interview Patterns

Coding Interview Patterns

120 lessons

  1. Introduction to Two Pointers
  2. Pair Sum - Sorted
  3. Triplet Sum
  4. Is Palindrome Valid
  5. Largest Container
  6. Shift Zeros to the End
  7. Next Lexicographical Sequence
  8. Introduction to Hash Maps and Sets
  9. Pair Sum - Unsorted
  10. Verify Sudoku Board
  11. Zero Striping
  12. Longest Chain of Consecutive Numbers
  13. Geometric Sequence Triplets
  14. Introduction to Linked Lists
  15. Linked List Reversal
  16. Remove the Kth Last Node From a Linked List
  17. Linked List Intersection
  18. LRU Cache
  19. Palindromic Linked List
  20. Flatten a Multi-Level Linked List
  21. Introduction to Fast and Slow Pointers
  22. Linked List Loop
  23. Linked List Midpoint
  24. Happy Number
  25. Introduction to Sliding Windows
  26. Substring Anagrams
  27. Longest Substring With Unique Characters
  28. Longest Uniform Substring After Replacements
  29. Introduction to Binary Search
  30. Find the Insertion Index
  31. First and Last Occurrences of a Number
  32. Cutting Wood
  33. Find the Target in a Rotated Sorted Array
  34. Find the Median From Two Sorted Arrays
  35. Matrix Search
  36. Local Maxima in Array
  37. Weighted Random Selection
  38. Introduction to Stacks
  39. Valid Parenthesis Expression
  40. Next Largest Number to the Right
  41. Evaluate Expression
  42. Repeated Removal of Adjacent Duplicates
  43. Implement a Queue using Stacks
  44. Maximums of Sliding Window
  45. Introduction to Heaps
  46. K Most Frequent Strings
  47. Combine Sorted Linked Lists
  48. Median of an Integer Stream
  49. Sort a K-Sorted Array
  50. Introduction to Intervals
  51. Merge Overlapping Intervals
  52. Identify All Interval Overlaps
  53. Largest Overlap of Intervals
  54. Introduction to Prefix Sums
  55. Sum Between Range
  56. K-Sum Subarrays
  57. Product Array Without Current Element
  58. Introduction to Trees
  59. Invert Binary Tree
  60. Balanced Binary Tree Validation
  61. Rightmost Nodes of a Binary Tree
  62. Widest Binary Tree Level
  63. Binary Search Tree Validation
  64. Lowest Common Ancestor
  65. Build Binary Tree From Preorder and Inorder Traversals
  66. Maximum Sum of a Continuous Path in a Binary Tree
  67. Binary Tree Symmetry
  68. Binary Tree Columns
  69. Kth Smallest Number in a Binary Search Tree
  70. Serialize and Deserialize a Binary Tree
  71. Introduction to Tries
  72. Design a Trie
  73. Insert and Search Words with Wildcards
  74. Find All Words on a Board
  75. Introduction to Graphs
  76. Graph Deep Copy
  77. Count Islands
  78. Matrix Infection
  79. Bipartite Graph Validation
  80. Longest Increasing Path
  81. Shortest Transformation Sequence
  82. Merging Communities
  83. Prerequisites
  84. Shortest Path
  85. Connect the Dots
  86. Introduction to Backtracking
  87. Find All Permutations
  88. Find All Subsets
  89. N Queens
  90. Combinations of a Sum
  91. Phone Keypad Combinations
  92. Introduction to Dynamic Programming
  93. Climbing Stairs
  94. Minimum Coin Combination
  95. Matrix Pathways
  96. Neighborhood Burglary
  97. Longest Common Subsequence
  98. Longest Palindrome in a String
  99. Maximum Subarray Sum
  100. 0/1 Knapsack
  101. Largest Square in a Matrix
  102. Introduction to Greedy Algorithms
  103. Jump to the End
  104. Gas Stations
  105. Candies
  106. Introduction to Sort and Search
  107. Sort Linked List
  108. Sort Array
  109. Kth Largest Integer
  110. Dutch National Flag
  111. Introduction to Bit Manipulation
  112. Hamming Weights of Integers
  113. Lonely Integer
  114. Swap Odd and Even Bits
  115. Introduction to Math and Geometry
  116. Spiral Traversal
  117. Reverse 32-Bit Integer
  118. Maximum Collinear Points
  119. The Josephus Problem
  120. Triangle Numbers