Find a lesson, question or project

Start typing to search published content and planned structures.

↑ ↓ moveEnter openEsc close

Best for: Learners reviewing a broad set of interview patterns.

The collection currently contains 179 questions across 17 topics. Practise choosing an approach, explaining why it works, and checking its time and space costs. The displayed count reflects the actual questions, not the track name.

System Design Atlas practice · Question list checked .

179 questions17 topics13 with Atlas lessons

179 of 179 questions shown · All filters clear

Arrays

12 questions
  1. Merge two sorted arrays without extra space — Find on GeeksforGeeks (opens in a new tab)

    CoreGeeksforGeeksTwo Pointers

    Direct match not yet confirmed; opens a GeeksforGeeks search.

Hashing

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

    BasicLeetCodeHashing & Prefix Sums
  2. Longest subarray with sum K — Solve on LeetCode (opens in a new tab)

    CoreLeetCodeHashing & Prefix Sums

    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)

    CoreLeetCodeHashing & Prefix Sums

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

Binary Search

13 questions
  1. Find Nth root of a number — Find on GeeksforGeeks (opens in a new tab)

    CoreGeeksforGeeksSearch on Answer

    Direct match not yet confirmed; opens a GeeksforGeeks search.

  2. Kth element of 2 sorted arrays — Find on GeeksforGeeks (opens in a new tab)

    ProGeeksforGeeksPartition Search

    Direct match not yet confirmed; opens a GeeksforGeeks search.

Sliding Window and Two Pointers

9 questions

Recursion and Backtracking

10 questions
  1. Power Set — Solve on LeetCode (opens in a new tab)

    CoreLeetCodeSubsets & Combinations

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

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

    CoreLeetCodeSubsets & Combinations

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

  3. Letter Combinations of a Phone Number — Solve on LeetCode (opens in a new tab)

    ProLeetCodeSubsets & Combinations

    Related Atlas lesson: Letter Combinations of a Phone Number. Check the source problem’s input/output requirements before adapting it.

  4. Combination Sum — Solve on LeetCode (opens in a new tab)

    CoreLeetCodeSubsets & Combinations

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

  5. Combination Sum II — Solve on LeetCode (opens in a new tab)

    CoreLeetCodeSubsets & Combinations

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

  6. Subsets II — Solve on LeetCode (opens in a new tab)

    CoreLeetCodeSubsets & Combinations

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

  7. Palindrome partitioning — Solve on LeetCode (opens in a new tab)

    ProLeetCodeSubsets & Combinations

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

  8. N Queen — Solve on LeetCode (opens in a new tab)

    ProLeetCodeBacktracking

    Related Atlas lesson: N-Queens. Check the source problem’s input/output requirements before adapting it.

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

    ProLeetCodeBacktracking

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

Linked List

16 questions
  1. Length of loop in LL — Find on GeeksforGeeks (opens in a new tab)

    CoreGeeksforGeeksFast & Slow Pointers

    Direct match not yet confirmed; opens a GeeksforGeeks search.

  2. Sort a Linked List of 0's 1's and 2's — Find on GeeksforGeeks (opens in a new tab)

    CoreGeeksforGeeksReversal & Rewiring

    Direct match not yet confirmed; opens a GeeksforGeeks search.

  3. Flattening of LL — Find on GeeksforGeeks (opens in a new tab)

    ProGeeksforGeeksReversal & Rewiring

    Direct match not yet confirmed; opens a GeeksforGeeks search.

Stack and Queues

14 questions

Greedy Algorithms

8 questions
  1. Valid Paranthesis Checker — Find on GeeksforGeeks (opens in a new tab)

    ProGeeksforGeeksGreedy

    Direct match not yet confirmed; opens a GeeksforGeeks search.

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

    CoreGeeksforGeeksIntervals & Scheduling

    Direct match not yet confirmed; opens a GeeksforGeeks search.

  3. Minimum number of platforms required for a railway — Find on GeeksforGeeks (opens in a new tab)

    CoreGeeksforGeeksIntervals & Scheduling

    Direct match not yet confirmed; opens a GeeksforGeeks search.

  4. Job sequencing Problem — Find on GeeksforGeeks (opens in a new tab)

    CoreGeeksforGeeksIntervals & Scheduling

    Direct match not yet confirmed; opens a GeeksforGeeks search.

Heaps

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

    CoreGeeksforGeeksHeap / Priority Queue

    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 / Priority Queue

    Direct match not yet confirmed; opens a GeeksforGeeks search.

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

    CoreGeeksforGeeksHeap / Priority Queue

    Direct match not yet confirmed; opens a GeeksforGeeks search.

Binary Trees

15 questions
  1. Right/Left View of BT — Find on GeeksforGeeks (opens in a new tab)

    CoreGeeksforGeeksBFS

    Direct match not yet confirmed; opens a GeeksforGeeks search.

  2. Top View of BT — Find on GeeksforGeeks (opens in a new tab)

    CoreGeeksforGeeksBFS

    Direct match not yet confirmed; opens a GeeksforGeeks search.

Binary Search Trees

10 questions
  1. Inorder successor and predecessor in BST — Find on GeeksforGeeks (opens in a new tab)

    CoreGeeksforGeeksInorder Traversal

    Direct match not yet confirmed; opens a GeeksforGeeks search.

  2. Kth Smallest and Largest element in BST — Find on GeeksforGeeks (opens in a new tab)

    CoreGeeksforGeeksInorder Traversal

    Direct match not yet confirmed; opens a GeeksforGeeks search.

Graphs

29 questions
  1. Topological sort or Kahn's algorithm — Find on GeeksforGeeks (opens in a new tab)

    CoreGeeksforGeeksOrdering & Connectivity

    Direct match not yet confirmed; opens a GeeksforGeeks search.

  2. Kosaraju's algorithm — Find on GeeksforGeeks (opens in a new tab)

    ProGeeksforGeeksOrdering & Connectivity

    Direct match not yet confirmed; opens a GeeksforGeeks search.

  3. Articulation point in graph — Find on GeeksforGeeks (opens in a new tab)

    ProGeeksforGeeksOrdering & Connectivity

    Direct match not yet confirmed; opens a GeeksforGeeks search.

  4. Shortest path in undirected graph with unit weights — Find on GeeksforGeeks (opens in a new tab)

    CoreGeeksforGeeksShortest Path

    Direct match not yet confirmed; opens a GeeksforGeeks search.

  5. Shortest path in DAG — Find on GeeksforGeeks (opens in a new tab)

    CoreGeeksforGeeksShortest Path

    Direct match not yet confirmed; opens a GeeksforGeeks search.

  6. Bellman ford algorithm — Find on GeeksforGeeks (opens in a new tab)

    ProGeeksforGeeksShortest Path

    Direct match not yet confirmed; opens a GeeksforGeeks search.

  7. Floyd warshall algorithm — Find on GeeksforGeeks (opens in a new tab)

    ProGeeksforGeeksShortest Path

    Direct match not yet confirmed; opens a GeeksforGeeks search.

  8. Disjoint Set — Find on GeeksforGeeks (opens in a new tab)

    CoreGeeksforGeeksDSU / MST

    Direct match not yet confirmed; opens a GeeksforGeeks search.

Dynamic Programming

19 questions
  1. Frog jump with K distances — Find on GeeksforGeeks (opens in a new tab)

    CoreGeeksforGeeksState Transition DP

    Direct match not yet confirmed; opens a GeeksforGeeks search.

  2. Ninja's training — Find on GeeksforGeeks (opens in a new tab)

    CoreGeeksforGeeksState Transition DP

    Direct match not yet confirmed; opens a GeeksforGeeks search.

Tries

5 questions

Strings

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

    ProGeeksforGeeksString Matching

    Direct match not yet confirmed; opens a GeeksforGeeks search.

  2. Z function — Find on GeeksforGeeks (opens in a new tab)

    ProGeeksforGeeksString Matching

    Direct match not yet confirmed; opens a GeeksforGeeks search.

Bit Manipulation

4 questions
  1. Power Set Bit Manipulation — Solve on LeetCode (opens in a new tab)

    CoreLeetCodeBit Manipulation

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

Mathematics

1 questions
  1. Print all primes till N — Find on GeeksforGeeks (opens in a new tab)

    CoreGeeksforGeeksNumber Theory

    Direct match not yet confirmed; opens a GeeksforGeeks search.