Find a lesson, question or project

Start typing to search published content and planned structures.

↑ ↓ moveEnter openEsc close

Best for: Learners ready to deepen pattern recognition.

Use these 224 questions to compare related approaches and practise adapting a pattern. Group your revision by topic, and explain what changes between similar problems rather than memorizing solutions.

System Design Atlas practice · Question list checked .

224 questions24 topics18 with Atlas lessons

224 of 224 questions shown · All filters clear

Arrays

22 questions
  1. Move Zeros to End — Solve on LeetCode (opens in a new tab)

    BasicLeetCodeLinear Scan and State TrackingAccess not stated

    Related Atlas lesson: Move Zeroes. Check the source problem’s input/output requirements before adapting it.

  2. Remove duplicates from sorted array — Solve on LeetCode (opens in a new tab)

    BasicLeetCodeLinear Scan and State TrackingAccess not stated

    Related Atlas lesson: Remove Duplicates from Sorted Array. Check the source problem’s input/output requirements before adapting it.

  3. Majority Element-I — Solve on LeetCode (opens in a new tab)

    CoreLeetCodeLinear Scan and State TrackingAccess not stated
  4. Palindrome Check — Find on GeeksforGeeks (opens in a new tab)

    CoreGeeksforGeeksTwo Pointer and In-place ManipulationAccess not stated

    Direct match not yet confirmed; opens a GeeksforGeeks search.

  5. Sort an array of 0's 1's and 2's — Solve on LeetCode (opens in a new tab)

    CoreLeetCodeTwo Pointer and In-place ManipulationAccess not stated
  6. Rearrange array elements by sign — Solve on LeetCode (opens in a new tab)

    CoreLeetCodeTwo Pointer and In-place ManipulationAccess not stated
  7. Count Inversions — Read on GeeksforGeeks (opens in a new tab)

    ProGeeksforGeeksDivide and Conquer / Merge Sort CountingAccess not stated
  8. Reverse Pairs — Solve on LeetCode (opens in a new tab)

    ProLeetCodeDivide and Conquer / Merge Sort CountingAccess not stated

Linked Lists

10 questions

Sliding Window

4 questions

Binary Search

14 questions
  1. Search insert position — Solve on LeetCode (opens in a new tab)

    BasicLeetCodeSorted, Rotated and Matrix SearchAccess not stated
  2. First and last occurrence — Solve on LeetCode (opens in a new tab)

    CoreLeetCodeSorted, Rotated and Matrix SearchAccess not stated
  3. Single element in sorted array — Solve on LeetCode (opens in a new tab)

    CoreLeetCodeSorted, Rotated and Matrix SearchAccess not stated
  4. Find peak element — Solve on LeetCode (opens in a new tab)

    CoreLeetCodeSearch on AnswerAccess not stated

Strings

13 questions
  1. Longest Common Prefix — Solve on LeetCode (opens in a new tab)

    CoreLeetCodeLinear Scan and State TrackingAccess not stated
  2. Count and say — Solve on LeetCode (opens in a new tab)

    CoreLeetCodeLinear Scan and State TrackingAccess not stated
  3. Reverse every word in a string — Find on GeeksforGeeks (opens in a new tab)

    CoreGeeksforGeeksLinear Scan and State TrackingAccess not stated

    Direct match not yet confirmed; opens a GeeksforGeeks search.

  4. Minimum number of bracket reversals to make an expression balanced — Find on GeeksforGeeks (opens in a new tab)

    CoreGeeksforGeeksLinear Scan and State TrackingAccess not stated

    Direct match not yet confirmed; opens a GeeksforGeeks search.

  5. Shortest Palindrome — Solve on LeetCode (opens in a new tab)

    ProLeetCodeString Matching / Rolling HashAccess not stated

Dynamic Programming

24 questions
  1. Best time to buy and sell stock II — Solve on LeetCode (opens in a new tab)

    CoreLeetCodeLinear, Grid and Multi-State DPAccess not stated
  2. Minimum Falling Path Sum — Solve on LeetCode (opens in a new tab)

    CoreLeetCodeLinear, Grid and Multi-State DPAccess not stated
  3. Triangle — Solve on LeetCode (opens in a new tab)

    CoreLeetCodeLinear, Grid and Multi-State DPAccess not stated
  4. Subset sum equals to target — Solve on GeeksforGeeks (opens in a new tab)

    CoreGeeksforGeeksKnapsack / Subset DPAccess not stated
  5. Wildcard matching — Solve on LeetCode (opens in a new tab)

    ProLeetCodeLIS, Sequence and String DPAccess not stated
  6. Palindrome partitioning II — Solve on LeetCode (opens in a new tab)

    ProLeetCodeInterval / Partition DPAccess not stated

Mathematics

1 questions

Binary Trees

13 questions
  1. Inorder Traversal — Solve on LeetCode (opens in a new tab)

    BasicLeetCodeTree DFS, Construction and Tree DPAccess not stated
  2. LCA in BT — Solve on LeetCode (opens in a new tab)

    ProLeetCodeTree DFS, Construction and Tree DPAccess not stated
  3. Zig Zag or Spiral Traversal — Solve on LeetCode (opens in a new tab)

    CoreLeetCodeBFS / Views and Tree TransformationAccess not stated

Recursion and Backtracking

18 questions
  1. Check if there exists a subsequence with sum K — Solve on GeeksforGeeks (opens in a new tab)

    CoreGeeksforGeeksSubsets, Combinations and PartitioningAccess not stated
  2. Combination Sum III — Solve on LeetCode (opens in a new tab)

    ProLeetCodeSubsets, Combinations and PartitioningAccess not stated

    Related Atlas lesson: Combination Sum III. Check the source problem’s input/output requirements before adapting it.

  3. Sudoku Solver — Solve on LeetCode (opens in a new tab)

    ProLeetCodeConstraint Satisfaction and Grid BacktrackingAccess not stated

    Related Atlas lesson: Sudoku Solver. Check the source problem’s input/output requirements before adapting it.

Two Pointers

4 questions

Graphs

28 questions
  1. Graph Valid Tree — Solve on LeetCode (opens in a new tab)

    MediumLeetCodeLeetCode #261LeetCode Premium
  2. Alien Dictionary — Solve on LeetCode (opens in a new tab)

    HardLeetCodeLeetCode #269LeetCode Premium
  3. Walls and Gates — Solve on LeetCode (opens in a new tab)

    MediumLeetCodeLeetCode #286LeetCode Premium
  4. Flood fill algorithm — Solve on LeetCode (opens in a new tab)

    CoreLeetCodeGraph DFS / BFS and Grid TraversalAccess not stated
  5. Number of provinces — Solve on LeetCode (opens in a new tab)

    CoreLeetCodeGraph DFS / BFS and Grid TraversalAccess not stated
  6. Number of enclaves — Solve on LeetCode (opens in a new tab)

    CoreLeetCodeGraph DFS / BFS and Grid TraversalAccess not stated
  7. Detect a cycle in an undirected graph — Solve on GeeksforGeeks (opens in a new tab)

    CoreGeeksforGeeksGraph Ordering and Structural ConnectivityAccess not stated
  8. Bipartite graph — Solve on LeetCode (opens in a new tab)

    CoreLeetCodeGraph Ordering and Structural ConnectivityAccess not stated
  9. Find eventual safe states — Solve on LeetCode (opens in a new tab)

    ProLeetCodeGraph Ordering and Structural ConnectivityAccess not stated
  10. Accounts merge — Solve on LeetCode (opens in a new tab)

    CoreLeetCodeDisjoint Set Union and MSTAccess not stated
  11. Making a large island — Solve on LeetCode (opens in a new tab)

    ProLeetCodeDisjoint Set Union and MSTAccess not stated
  12. Dijkstra's algorithm — Solve on GeeksforGeeks (opens in a new tab)

    CoreGeeksforGeeksShortest PathAccess not stated

Stacks and Queues

6 questions

Greedy

7 questions

Hashing

8 questions
  1. Sort Characters by Frequency — Solve on LeetCode (opens in a new tab)

    CoreLeetCodeHash Sets and Prefix HashingAccess not stated
  2. Longest subarray with sum K — Solve on LeetCode (opens in a new tab)

    CoreLeetCodeHash Sets and Prefix HashingAccess not stated

    Related Atlas lesson: Maximum Size Subarray Sum Equals k. Check the source problem’s input/output requirements before adapting it.

  3. Count subarrays with given sum — Solve on LeetCode (opens in a new tab)

    CoreLeetCodeHash Sets and Prefix HashingAccess not stated

    Related Atlas lesson: Subarray Sum Equals K. Check the source problem’s input/output requirements before adapting it.

Intervals

3 questions

Binary Search Trees

7 questions
  1. Search in BST — Solve on LeetCode (opens in a new tab)

    BasicLeetCodeBST Ordering and InorderAccess not stated
  2. Insert a given node in BST — Solve on LeetCode (opens in a new tab)

    CoreLeetCodeBST Ordering and InorderAccess not stated
  3. Delete a node in BST — Solve on LeetCode (opens in a new tab)

    CoreLeetCodeBST Ordering and InorderAccess not stated
  4. Kth Smallest and Largest element in BST — Find on GeeksforGeeks (opens in a new tab)

    CoreGeeksforGeeksBST Ordering and InorderAccess not stated

    Direct match not yet confirmed; opens a GeeksforGeeks search.

Heaps and Priority Queues

9 questions
  1. Meeting Rooms — Solve on LeetCode (opens in a new tab)

    EasyLeetCodeLeetCode #252LeetCode Premium
  2. Meeting Rooms II — Solve on LeetCode (opens in a new tab)

    MediumLeetCodeLeetCode #253LeetCode Premium

Bit Manipulation

8 questions
  1. Missing Number — Solve on LeetCode (opens in a new tab)

    EasyLeetCodeLeetCode #268

    Related XOR editorial uses 1..n. This question uses 0..n: initialize answer=n and XOR index (not index+1) with each value.

  2. Minimum Bit Flips to Convert Number — Solve on LeetCode (opens in a new tab)

    BasicLeetCodeBitwise XOR and Bitmask EnumerationAccess not stated
  3. Single Number - II — Solve on LeetCode (opens in a new tab)

    CoreLeetCodeBitwise XOR and Bitmask EnumerationAccess not stated

Tries

5 questions
  1. Trie Implementation and Advanced Operations — Solve on LeetCode (opens in a new tab)

    CoreLeetCodePrefix Matching and Bitwise TrieAccess not stated
  2. Longest Word with All Prefixes — Solve on LeetCode (opens in a new tab)

    CoreLeetCodePrefix Matching and Bitwise TrieAccess not stated

Sliding Window and Two Pointers

5 questions
  1. Binary Subarrays With Sum — Solve on LeetCode (opens in a new tab)

    CoreLeetCodeCounting Windows and Exact ConstraintsAccess not stated
  2. Maximum Points You Can Obtain from Cards — Solve on LeetCode (opens in a new tab)

    CoreLeetCodeSliding Window OptimizationAccess not stated
  3. Max Consecutive Ones III — Solve on LeetCode (opens in a new tab)

    CoreLeetCodeSliding Window OptimizationAccess not stated
  4. Fruit Into Baskets — Solve on LeetCode (opens in a new tab)

    CoreLeetCodeSliding Window OptimizationAccess not stated

Stack and Queues

5 questions
  1. Implement Queue using Stack — Solve on LeetCode (opens in a new tab)

    CoreLeetCodeStack, Queue and Data Structure DesignAccess not stated
  2. Asteroid Collision — Solve on LeetCode (opens in a new tab)

    CoreLeetCodeStack, Queue and Data Structure DesignAccess not stated
  3. LFU Cache — Solve on LeetCode (opens in a new tab)

    ProLeetCodeStack, Queue and Data Structure DesignAccess not stated
  4. Next Greater Element - 2 — Solve on LeetCode (opens in a new tab)

    CoreLeetCodeMonotonic Stack / QueueAccess not stated
  5. Maximum Rectangles — Solve on LeetCode (opens in a new tab)

    ProLeetCodeMonotonic Stack / QueueAccess not stated

Linked List

4 questions
  1. Find Middle of Linked List — Solve on LeetCode (opens in a new tab)

    BasicLeetCodePointer Traversal and Cycle DetectionAccess not stated
  2. Delete the middle node in LL — Solve on LeetCode (opens in a new tab)

    CoreLeetCodePointer Traversal and Cycle DetectionAccess not stated
  3. Add one to a number represented by LL — Solve on LeetCode (opens in a new tab)

    CoreLeetCodeIn-place Reversal, Rewiring and MergeAccess not stated
  4. Segregate odd and even nodes in Linked List — Find on GeeksforGeeks (opens in a new tab)

    CoreGeeksforGeeksIn-place Reversal, Rewiring and MergeAccess not stated

    Direct match not yet confirmed; opens a GeeksforGeeks search.

Heaps

4 questions
  1. Heapify Algorithm — Find on GeeksforGeeks (opens in a new tab)

    CoreGeeksforGeeksHeap and Priority QueueAccess not stated

    Direct match not yet confirmed; opens a GeeksforGeeks search.

  2. Build heap from a given Array — Find on GeeksforGeeks (opens in a new tab)

    CoreGeeksforGeeksHeap and Priority QueueAccess not stated

    Direct match not yet confirmed; opens a GeeksforGeeks search.

  3. Implement Max Heap — Find on GeeksforGeeks (opens in a new tab)

    CoreGeeksforGeeksHeap and Priority QueueAccess not stated

    Direct match not yet confirmed; opens a GeeksforGeeks search.

  4. Heap Sort — Find on GeeksforGeeks (opens in a new tab)

    ProGeeksforGeeksHeap and Priority QueueAccess not stated

    Direct match not yet confirmed; opens a GeeksforGeeks search.

Greedy Algorithms

2 questions
  1. N meetings in one room — Find on GeeksforGeeks (opens in a new tab)

    CoreGeeksforGeeksIntervals / SchedulingAccess not stated

    Direct match not yet confirmed; opens a GeeksforGeeks search.

  2. Candy — Solve on LeetCode (opens in a new tab)

    ProLeetCodeGreedy Choice and FeasibilityAccess not stated