Reasoning Into CodeArunank Divya Sharan · Python edition← Arunank’s portfolio
A pattern-first interview workbook

Reasoning Into Code

250 deliberate katas for coding interviews. Learn to turn a correct idea into precise state, safe transitions and working Python.

Reading guide · The 25-module progression · Practice tools and glossary

Download the book PDF · Download all Python solutions

250 lessons shown

  1. 001. Running TotalModule 01: Execution Grammar and State Mutation · Foundation
  2. 002. Running Minimum and MaximumModule 01: Execution Grammar and State Mutation · Foundation
  3. 003. Maximum Value and First IndexModule 01: Execution Grammar and State Mutation · Foundation
  4. 004. Count Positives, Negatives, and ZerosModule 01: Execution Grammar and State Mutation · Foundation
  5. 005. First Cumulative Threshold CrossingModule 01: Execution Grammar and State Mutation · Bridge
  6. 006. Longest Positive StreakModule 01: Execution Grammar and State Mutation · Bridge
  7. 007. Longest Alternating-Parity StreakModule 01: Execution Grammar and State Mutation · Bridge
  8. 008. Run-Length EncodingModule 01: Execution Grammar and State Mutation · Interview
  9. 009. Split on SentinelsModule 01: Execution Grammar and State Mutation · Interview
  10. 010. Peak Active BalanceModule 01: Execution Grammar and State Mutation · Interview
  11. 011. Two-Sum IndicesModule 02: Hash Maps, Sets, and Frequency State · Foundation
  12. 012. First Repeated ValueModule 02: Hash Maps, Sets, and Frequency State · Foundation
  13. 013. Valid AnagramModule 02: Hash Maps, Sets, and Frequency State · Foundation
  14. 014. First Unique CharacterModule 02: Hash Maps, Sets, and Frequency State · Foundation
  15. 015. Group AnagramsModule 02: Hash Maps, Sets, and Frequency State · Bridge
  16. 016. Most Frequent with Earliest TieModule 02: Hash Maps, Sets, and Frequency State · Bridge
  17. 017. Isomorphic StringsModule 02: Hash Maps, Sets, and Frequency State · Bridge
  18. 018. Multiset IntersectionModule 02: Hash Maps, Sets, and Frequency State · Interview
  19. 019. Longest Consecutive SequenceModule 02: Hash Maps, Sets, and Frequency State · Interview
  20. 020. Count Equal PairsModule 02: Hash Maps, Sets, and Frequency State · Interview
  21. 021. Merge Two Sorted ArraysModule 03: Sorting and Ordered Scans · Foundation
  22. 022. Deduplicate a Sorted ArrayModule 03: Sorting and Ordered Scans · Foundation
  23. 023. Three-Way Sort 0/1/2Module 03: Sorting and Ordered Scans · Foundation
  24. 024. Rank TransformModule 03: Sorting and Ordered Scans · Foundation
  25. 025. Merge Overlapping IntervalsModule 03: Sorting and Ordered Scans · Bridge
  26. 026. Insert One IntervalModule 03: Sorting and Ordered Scans · Bridge
  27. 027. Intersect Two Interval ListsModule 03: Sorting and Ordered Scans · Bridge
  28. 028. Closest Pair to TargetModule 03: Sorting and Ordered Scans · Interview
  29. 029. Minimum-Difference PairsModule 03: Sorting and Ordered Scans · Interview
  30. 030. Sort Records by Multiple KeysModule 03: Sorting and Ordered Scans · Interview
  31. 031. Reverse an Array In PlaceModule 04: Two Pointers and In-Place Read/Write State · Foundation
  32. 032. Normalized PalindromeModule 04: Two Pointers and In-Place Read/Write State · Foundation
  33. 033. Move Zeros StablyModule 04: Two Pointers and In-Place Read/Write State · Foundation
  34. 034. Remove a Target In PlaceModule 04: Two Pointers and In-Place Read/Write State · Foundation
  35. 035. Two Sum in Sorted ArrayModule 04: Two Pointers and In-Place Read/Write State · Bridge
  36. 036. Sorted SquaresModule 04: Two Pointers and In-Place Read/Write State · Bridge
  37. 037. Three Sum to ZeroModule 04: Two Pointers and In-Place Read/Write State · Bridge
  38. 038. Container With Most WaterModule 04: Two Pointers and In-Place Read/Write State · Interview
  39. 039. Trapping Rain WaterModule 04: Two Pointers and In-Place Read/Write State · Interview
  40. 040. Partition Evens Before OddsModule 04: Two Pointers and In-Place Read/Write State · Interview
  41. 041. Maximum Fixed-Window SumModule 05: Sliding Windows · Foundation
  42. 042. Count Fixed Windows Above ThresholdModule 05: Sliding Windows · Foundation
  43. 043. Moving Average StreamModule 05: Sliding Windows · Foundation
  44. 044. Longest Substring Without RepeatsModule 05: Sliding Windows · Foundation
  45. 045. Longest Substring with At Most K DistinctModule 05: Sliding Windows · Bridge
  46. 046. Longest Ones After K FlipsModule 05: Sliding Windows · Bridge
  47. 047. Permutation InclusionModule 05: Sliding Windows · Bridge
  48. 048. Shortest Positive Window Reaching TargetModule 05: Sliding Windows · Interview
  49. 049. Minimum Covering SubstringModule 05: Sliding Windows · Interview
  50. 050. Count Subarrays with Exactly K DistinctModule 05: Sliding Windows · Interview
  51. 051. Build a Prefix-Sum ArrayModule 06: Prefix Sums, Prefix State, and Difference Arrays · Foundation
  52. 052. Answer Static Range-Sum QueriesModule 06: Prefix Sums, Prefix State, and Difference Arrays · Foundation
  53. 053. Pivot IndexModule 06: Prefix Sums, Prefix State, and Difference Arrays · Foundation
  54. 054. Count Subarrays Summing to KModule 06: Prefix Sums, Prefix State, and Difference Arrays · Foundation
  55. 055. Longest Subarray Summing to KModule 06: Prefix Sums, Prefix State, and Difference Arrays · Bridge
  56. 056. Equal Zeros and OnesModule 06: Prefix Sums, Prefix State, and Difference Arrays · Bridge
  57. 057. Product Except SelfModule 06: Prefix Sums, Prefix State, and Difference Arrays · Bridge
  58. 058. Range Addition with Difference ArrayModule 06: Prefix Sums, Prefix State, and Difference Arrays · Interview
  59. 059. Flight BookingsModule 06: Prefix Sums, Prefix State, and Difference Arrays · Interview
  60. 060. Two-Dimensional Prefix QueriesModule 06: Prefix Sums, Prefix State, and Difference Arrays · Interview
  61. 061. Balanced BracketsModule 07: Stacks and Expression State · Foundation
  62. 062. Evaluate Postfix NotationModule 07: Stacks and Expression State · Foundation
  63. 063. Remove Adjacent Equal PairsModule 07: Stacks and Expression State · Foundation
  64. 064. Simplify an Absolute Unix PathModule 07: Stacks and Expression State · Foundation
  65. 065. Validate Stack Push/Pop SequencesModule 07: Stacks and Expression State · Bridge
  66. 066. Design Min StackModule 07: Stacks and Expression State · Bridge
  67. 067. Decode Nested RepetitionModule 07: Stacks and Expression State · Bridge
  68. 068. Asteroid CollisionModule 07: Stacks and Expression State · Interview
  69. 069. Basic Calculator with ParenthesesModule 07: Stacks and Expression State · Interview
  70. 070. Score of ParenthesesModule 07: Stacks and Expression State · Interview
  71. 071. Next Greater ElementModule 08: Monotonic Stacks and Monotonic Deques · Foundation
  72. 072. Next Smaller ElementModule 08: Monotonic Stacks and Monotonic Deques · Foundation
  73. 073. Days Until Warmer TemperatureModule 08: Monotonic Stacks and Monotonic Deques · Foundation
  74. 074. Online Stock SpanModule 08: Monotonic Stacks and Monotonic Deques · Foundation
  75. 075. Largest Rectangle in HistogramModule 08: Monotonic Stacks and Monotonic Deques · Bridge
  76. 076. Maximal Rectangle in Binary MatrixModule 08: Monotonic Stacks and Monotonic Deques · Bridge
  77. 077. Sum of Subarray MinimumsModule 08: Monotonic Stacks and Monotonic Deques · Bridge
  78. 078. Sliding Window MaximumModule 08: Monotonic Stacks and Monotonic Deques · Interview
  79. 079. Shortest Subarray Sum At Least K with NegativesModule 08: Monotonic Stacks and Monotonic Deques · Interview
  80. 080. Remove K DigitsModule 08: Monotonic Stacks and Monotonic Deques · Interview
  81. 081. Queue Using Two StacksModule 09: Queues, Heaps, and Streaming Frontiers · Foundation
  82. 082. Stack Using One QueueModule 09: Queues, Heaps, and Streaming Frontiers · Foundation
  83. 083. Recent CounterModule 09: Queues, Heaps, and Streaming Frontiers · Foundation
  84. 084. Largest K Values from a StreamModule 09: Queues, Heaps, and Streaming Frontiers · Foundation
  85. 085. Smallest K Values from a StreamModule 09: Queues, Heaps, and Streaming Frontiers · Bridge
  86. 086. Kth Largest Stream ClassModule 09: Queues, Heaps, and Streaming Frontiers · Bridge
  87. 087. Top K Frequent ValuesModule 09: Queues, Heaps, and Streaming Frontiers · Bridge
  88. 088. Merge K Sorted ArraysModule 09: Queues, Heaps, and Streaming Frontiers · Interview
  89. 089. K Closest Points to OriginModule 09: Queues, Heaps, and Streaming Frontiers · Interview
  90. 090. Running MedianModule 09: Queues, Heaps, and Streaming Frontiers · Interview
  91. 091. Maximum Concurrent IntervalsModule 10: Intervals and Sweep-Line Events · Foundation
  92. 092. Minimum Meeting RoomsModule 10: Intervals and Sweep-Line Events · Foundation
  93. 093. Car Pooling CapacityModule 10: Intervals and Sweep-Line Events · Foundation
  94. 094. Total Covered LengthModule 10: Intervals and Sweep-Line Events · Foundation
  95. 095. Employee Free TimeModule 10: Intervals and Sweep-Line Events · Bridge
  96. 096. Calendar Booking IModule 10: Intervals and Sweep-Line Events · Bridge
  97. 097. Calendar Maximum OverlapModule 10: Intervals and Sweep-Line Events · Bridge
  98. 098. Minimum Points to Cover IntervalsModule 10: Intervals and Sweep-Line Events · Interview
  99. 099. Skyline Key PointsModule 10: Intervals and Sweep-Line Events · Interview
  100. 100. Active Interval Count QueriesModule 10: Intervals and Sweep-Line Events · Interview
  101. 101. Build and Serialize a Singly Linked ListModule 11: Linked Lists and Pointer Mutation · Foundation
  102. 102. Reverse a Linked ListModule 11: Linked Lists and Pointer Mutation · Foundation
  103. 103. Merge Two Sorted Linked ListsModule 11: Linked Lists and Pointer Mutation · Foundation
  104. 104. Find the Middle NodeModule 11: Linked Lists and Pointer Mutation · Foundation
  105. 105. Detect a CycleModule 11: Linked Lists and Pointer Mutation · Bridge
  106. 106. Find Cycle EntryModule 11: Linked Lists and Pointer Mutation · Bridge
  107. 107. Remove Nth Node from EndModule 11: Linked Lists and Pointer Mutation · Bridge
  108. 108. Reverse a SublistModule 11: Linked Lists and Pointer Mutation · Interview
  109. 109. Reorder ListModule 11: Linked Lists and Pointer Mutation · Interview
  110. 110. Copy List with Random PointerModule 11: Linked Lists and Pointer Mutation · Interview
  111. 111. Exact Binary SearchModule 12: Binary Search and Monotone Answer Spaces · Foundation
  112. 112. Lower BoundModule 12: Binary Search and Monotone Answer Spaces · Foundation
  113. 113. Upper BoundModule 12: Binary Search and Monotone Answer Spaces · Foundation
  114. 114. First and Last Target PositionModule 12: Binary Search and Monotone Answer Spaces · Foundation
  115. 115. Integer Square RootModule 12: Binary Search and Monotone Answer Spaces · Bridge
  116. 116. Search Rotated Sorted ArrayModule 12: Binary Search and Monotone Answer Spaces · Bridge
  117. 117. Find Minimum in Rotated Sorted ArrayModule 12: Binary Search and Monotone Answer Spaces · Bridge
  118. 118. Search a Row-Major Sorted MatrixModule 12: Binary Search and Monotone Answer Spaces · Interview
  119. 119. Minimum Eating SpeedModule 12: Binary Search and Monotone Answer Spaces · Interview
  120. 120. Minimum Shipping CapacityModule 12: Binary Search and Monotone Answer Spaces · Interview
  121. 121. Row and Column TotalsModule 13: Matrix Traversal and Simulation · Foundation
  122. 122. Transpose a MatrixModule 13: Matrix Traversal and Simulation · Foundation
  123. 123. Rotate a Square Matrix ClockwiseModule 13: Matrix Traversal and Simulation · Foundation
  124. 124. Spiral TraversalModule 13: Matrix Traversal and Simulation · Foundation
  125. 125. Set Matrix ZeroesModule 13: Matrix Traversal and Simulation · Bridge
  126. 126. Diagonal Zigzag TraversalModule 13: Matrix Traversal and Simulation · Bridge
  127. 127. Game of Life StepModule 13: Matrix Traversal and Simulation · Bridge
  128. 128. Matrix ReshapeModule 13: Matrix Traversal and Simulation · Interview
  129. 129. Sparse Matrix MultiplicationModule 13: Matrix Traversal and Simulation · Interview
  130. 130. Validate Sudoku BoardModule 13: Matrix Traversal and Simulation · Interview
  131. 131. Flood Fill with DFSModule 14: Grid DFS, BFS, and Multi-Source Search · Foundation
  132. 132. Flood Fill with BFSModule 14: Grid DFS, BFS, and Multi-Source Search · Foundation
  133. 133. Count IslandsModule 14: Grid DFS, BFS, and Multi-Source Search · Foundation
  134. 134. Maximum Island AreaModule 14: Grid DFS, BFS, and Multi-Source Search · Foundation
  135. 135. Surrounded RegionsModule 14: Grid DFS, BFS, and Multi-Source Search · Bridge
  136. 136. Rotting OrangesModule 14: Grid DFS, BFS, and Multi-Source Search · Bridge
  137. 137. Shortest Binary-Matrix PathModule 14: Grid DFS, BFS, and Multi-Source Search · Bridge
  138. 138. Nearest-Zero DistancesModule 14: Grid DFS, BFS, and Multi-Source Search · Interview
  139. 139. Walls and GatesModule 14: Grid DFS, BFS, and Multi-Source Search · Interview
  140. 140. Pacific Atlantic Water FlowModule 14: Grid DFS, BFS, and Multi-Source Search · Interview
  141. 141. Factorial with Call TraceModule 15: Recursion and Divide-and-Conquer · Foundation
  142. 142. Sum a Nested ListModule 15: Recursion and Divide-and-Conquer · Foundation
  143. 143. Flatten a Nested ListModule 15: Recursion and Divide-and-Conquer · Foundation
  144. 144. Reverse a String RecursivelyModule 15: Recursion and Divide-and-Conquer · Foundation
  145. 145. Fast ExponentiationModule 15: Recursion and Divide-and-Conquer · Bridge
  146. 146. Merge SortModule 15: Recursion and Divide-and-Conquer · Bridge
  147. 147. Quicksort PartitionModule 15: Recursion and Divide-and-Conquer · Bridge
  148. 148. Quickselect Kth StatisticModule 15: Recursion and Divide-and-Conquer · Interview
  149. 149. Tower of HanoiModule 15: Recursion and Divide-and-Conquer · Interview
  150. 150. Merge K Sorted Arrays by Divide-and-ConquerModule 15: Recursion and Divide-and-Conquer · Interview
  151. 151. Generate Binary StringsModule 16: Backtracking and Combinatorial Search · Foundation
  152. 152. Generate All SubsetsModule 16: Backtracking and Combinatorial Search · Foundation
  153. 153. Choose K CombinationsModule 16: Backtracking and Combinatorial Search · Foundation
  154. 154. Generate PermutationsModule 16: Backtracking and Combinatorial Search · Foundation
  155. 155. Generate Unique PermutationsModule 16: Backtracking and Combinatorial Search · Bridge
  156. 156. Combination SumModule 16: Backtracking and Combinatorial Search · Bridge
  157. 157. Generate Balanced ParenthesesModule 16: Backtracking and Combinatorial Search · Bridge
  158. 158. Word Search in GridModule 16: Backtracking and Combinatorial Search · Interview
  159. 159. Palindrome PartitioningModule 16: Backtracking and Combinatorial Search · Interview
  160. 160. N-QueensModule 16: Backtracking and Combinatorial Search · Interview
  161. 161. Build and Serialize a Binary TreeModule 17: Binary Trees: Recursive DFS and Structural Contracts · Foundation
  162. 162. Maximum DepthModule 17: Binary Trees: Recursive DFS and Structural Contracts · Foundation
  163. 163. Recursive Preorder TraversalModule 17: Binary Trees: Recursive DFS and Structural Contracts · Foundation
  164. 164. Recursive Inorder TraversalModule 17: Binary Trees: Recursive DFS and Structural Contracts · Foundation
  165. 165. Recursive Postorder TraversalModule 17: Binary Trees: Recursive DFS and Structural Contracts · Bridge
  166. 166. Same TreeModule 17: Binary Trees: Recursive DFS and Structural Contracts · Bridge
  167. 167. Invert Binary TreeModule 17: Binary Trees: Recursive DFS and Structural Contracts · Bridge
  168. 168. Diameter of Binary TreeModule 17: Binary Trees: Recursive DFS and Structural Contracts · Interview
  169. 169. Balanced Binary TreeModule 17: Binary Trees: Recursive DFS and Structural Contracts · Interview
  170. 170. Root-to-Leaf Target SumModule 17: Binary Trees: Recursive DFS and Structural Contracts · Interview
  171. 171. Binary Tree Level OrderModule 18: Tree BFS, Binary Search Trees, and Tries · Foundation
  172. 172. Minimum Tree Depth with BFSModule 18: Tree BFS, Binary Search Trees, and Tries · Foundation
  173. 173. Right Side ViewModule 18: Tree BFS, Binary Search Trees, and Tries · Foundation
  174. 174. Zigzag Level OrderModule 18: Tree BFS, Binary Search Trees, and Tries · Foundation
  175. 175. Validate a BSTModule 18: Tree BFS, Binary Search Trees, and Tries · Bridge
  176. 176. Kth Smallest in BSTModule 18: Tree BFS, Binary Search Trees, and Tries · Bridge
  177. 177. Lowest Common Ancestor in BSTModule 18: Tree BFS, Binary Search Trees, and Tries · Bridge
  178. 178. Sorted Array to Balanced BSTModule 18: Tree BFS, Binary Search Trees, and Tries · Interview
  179. 179. Implement TrieModule 18: Tree BFS, Binary Search Trees, and Tries · Interview
  180. 180. Wildcard Word DictionaryModule 18: Tree BFS, Binary Search Trees, and Tries · Interview
  181. 181. Build an Adjacency ListModule 19: Graph Traversal and Connected Components · Foundation
  182. 182. DFS ReachabilityModule 19: Graph Traversal and Connected Components · Foundation
  183. 183. BFS Shortest HopsModule 19: Graph Traversal and Connected Components · Foundation
  184. 184. Count Graph ComponentsModule 19: Graph Traversal and Connected Components · Foundation
  185. 185. Clone a GraphModule 19: Graph Traversal and Connected Components · Bridge
  186. 186. Validate an Undirected TreeModule 19: Graph Traversal and Connected Components · Bridge
  187. 187. Bipartite Graph CheckModule 19: Graph Traversal and Connected Components · Bridge
  188. 188. All Paths from Source to Target in DAGModule 19: Graph Traversal and Connected Components · Interview
  189. 189. Number of ProvincesModule 19: Graph Traversal and Connected Components · Interview
  190. 190. Word Ladder LengthModule 19: Graph Traversal and Connected Components · Interview
  191. 191. Detect a Directed Cycle with Three StatesModule 20: Directed Graphs, Cycles, and Topological Order · Foundation
  192. 192. Course Schedule FeasibilityModule 20: Directed Graphs, Cycles, and Topological Order · Foundation
  193. 193. Return One Course OrderModule 20: Directed Graphs, Cycles, and Topological Order · Foundation
  194. 194. Minimum SemestersModule 20: Directed Graphs, Cycles, and Topological Order · Foundation
  195. 195. Eventual Safe NodesModule 20: Directed Graphs, Cycles, and Topological Order · Bridge
  196. 196. Longest Path in a DAGModule 20: Directed Graphs, Cycles, and Topological Order · Bridge
  197. 197. Prerequisite Reachability QueriesModule 20: Directed Graphs, Cycles, and Topological Order · Bridge
  198. 198. Alien Dictionary OrderModule 20: Directed Graphs, Cycles, and Topological Order · Interview
  199. 199. Reconstruct ItineraryModule 20: Directed Graphs, Cycles, and Topological Order · Interview
  200. 200. Dependency Impact CountsModule 20: Directed Graphs, Cycles, and Topological Order · Interview
  201. 201. Implement Disjoint-Set UnionModule 21: Union-Find, Weighted Graphs, and Minimum Spanning Trees · Foundation
  202. 202. Count Components with Union-FindModule 21: Union-Find, Weighted Graphs, and Minimum Spanning Trees · Foundation
  203. 203. Redundant ConnectionModule 21: Union-Find, Weighted Graphs, and Minimum Spanning Trees · Foundation
  204. 204. Accounts MergeModule 21: Union-Find, Weighted Graphs, and Minimum Spanning Trees · Foundation
  205. 205. Kruskal Minimum Spanning TreeModule 21: Union-Find, Weighted Graphs, and Minimum Spanning Trees · Bridge
  206. 206. Prim Minimum Spanning TreeModule 21: Union-Find, Weighted Graphs, and Minimum Spanning Trees · Bridge
  207. 207. Dijkstra Shortest PathsModule 21: Union-Find, Weighted Graphs, and Minimum Spanning Trees · Bridge
  208. 208. Network Delay TimeModule 21: Union-Find, Weighted Graphs, and Minimum Spanning Trees · Interview
  209. 209. Cheapest Flight Within K StopsModule 21: Union-Find, Weighted Graphs, and Minimum Spanning Trees · Interview
  210. 210. Zero-One BFSModule 21: Union-Find, Weighted Graphs, and Minimum Spanning Trees · Interview
  211. 211. Best Single Stock TransactionModule 22: Greedy Algorithms and Kadane-Style State · Foundation
  212. 212. Maximum Subarray SumModule 22: Greedy Algorithms and Kadane-Style State · Foundation
  213. 213. Maximum Product SubarrayModule 22: Greedy Algorithms and Kadane-Style State · Foundation
  214. 214. Maximum Circular SubarrayModule 22: Greedy Algorithms and Kadane-Style State · Foundation
  215. 215. Jump Game ReachabilityModule 22: Greedy Algorithms and Kadane-Style State · Bridge
  216. 216. Minimum Jumps to EndModule 22: Greedy Algorithms and Kadane-Style State · Bridge
  217. 217. Gas Station CircuitModule 22: Greedy Algorithms and Kadane-Style State · Bridge
  218. 218. Maximum Number of Non-overlapping IntervalsModule 22: Greedy Algorithms and Kadane-Style State · Interview
  219. 219. Partition LabelsModule 22: Greedy Algorithms and Kadane-Style State · Interview
  220. 220. Task Scheduler with CooldownModule 22: Greedy Algorithms and Kadane-Style State · Interview
  221. 221. Fibonacci with Rolling StateModule 23: Dynamic Programming I: One-Dimensional State · Foundation
  222. 222. Climbing StairsModule 23: Dynamic Programming I: One-Dimensional State · Foundation
  223. 223. Minimum Cost Climbing StairsModule 23: Dynamic Programming I: One-Dimensional State · Foundation
  224. 224. House RobberModule 23: Dynamic Programming I: One-Dimensional State · Foundation
  225. 225. House Robber IIModule 23: Dynamic Programming I: One-Dimensional State · Bridge
  226. 226. Decode WaysModule 23: Dynamic Programming I: One-Dimensional State · Bridge
  227. 227. Word BreakModule 23: Dynamic Programming I: One-Dimensional State · Bridge
  228. 228. Minimum Coin ChangeModule 23: Dynamic Programming I: One-Dimensional State · Interview
  229. 229. Coin-Change Combination CountModule 23: Dynamic Programming I: One-Dimensional State · Interview
  230. 230. Longest Increasing SubsequenceModule 23: Dynamic Programming I: One-Dimensional State · Interview
  231. 231. Unique Grid PathsModule 24: Dynamic Programming II: Grids, Knapsack, and Strings · Foundation
  232. 232. Minimum Path SumModule 24: Dynamic Programming II: Grids, Knapsack, and Strings · Foundation
  233. 233. Unique Paths with ObstaclesModule 24: Dynamic Programming II: Grids, Knapsack, and Strings · Foundation
  234. 234. Zero-One KnapsackModule 24: Dynamic Programming II: Grids, Knapsack, and Strings · Foundation
  235. 235. Partition Equal Subset SumModule 24: Dynamic Programming II: Grids, Knapsack, and Strings · Bridge
  236. 236. Target Sum WaysModule 24: Dynamic Programming II: Grids, Knapsack, and Strings · Bridge
  237. 237. Longest Common SubsequenceModule 24: Dynamic Programming II: Grids, Knapsack, and Strings · Bridge
  238. 238. Edit DistanceModule 24: Dynamic Programming II: Grids, Knapsack, and Strings · Interview
  239. 239. Interleaving StringModule 24: Dynamic Programming II: Grids, Knapsack, and Strings · Interview
  240. 240. Longest Palindromic SubsequenceModule 24: Dynamic Programming II: Grids, Knapsack, and Strings · Interview
  241. 241. Single Number with XORModule 25: Bit Manipulation, Mathematics, and Designed Data Structures · Foundation
  242. 242. Missing Number with XORModule 25: Bit Manipulation, Mathematics, and Designed Data Structures · Foundation
  243. 243. Count Set BitsModule 25: Bit Manipulation, Mathematics, and Designed Data Structures · Foundation
  244. 244. Counting Bits from 0 to NModule 25: Bit Manipulation, Mathematics, and Designed Data Structures · Foundation
  245. 245. Reverse 32 BitsModule 25: Bit Manipulation, Mathematics, and Designed Data Structures · Bridge
  246. 246. Greatest Common Divisor and LCMModule 25: Bit Manipulation, Mathematics, and Designed Data Structures · Bridge
  247. 247. Sieve of EratosthenesModule 25: Bit Manipulation, Mathematics, and Designed Data Structures · Bridge
  248. 248. Design Randomized SetModule 25: Bit Manipulation, Mathematics, and Designed Data Structures · Interview
  249. 249. Design LRU CacheModule 25: Bit Manipulation, Mathematics, and Designed Data Structures · Interview
  250. 250. Time-Based Key-Value StoreModule 25: Bit Manipulation, Mathematics, and Designed Data Structures · Interview