Atlas practice / 179 questions
Interview Path 180
Use this topic-by-topic path when you have covered the fundamentals and want structured interview revision.
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 of 179 questions shown · All filters clear
Arrays
12 questionsMerge two sorted arrays without extra space — Find on GeeksforGeeks (opens in a new tab)
Direct match not yet confirmed; opens a GeeksforGeeks search.
Hashing
5 questionsLongest subarray with sum K — Solve on LeetCode (opens in a new tab)
Related Atlas lesson: Maximum Size Subarray Sum Equals k. Check the source problem’s input/output requirements before adapting it.
Count subarrays with given sum — Solve on LeetCode (opens in a new tab)
Related Atlas lesson: Subarray Sum Equals K. Check the source problem’s input/output requirements before adapting it.
Binary Search
13 questionsFind Nth root of a number — Find on GeeksforGeeks (opens in a new tab)
Direct match not yet confirmed; opens a GeeksforGeeks search.
Kth element of 2 sorted arrays — Find on GeeksforGeeks (opens in a new tab)
Direct match not yet confirmed; opens a GeeksforGeeks search.
Sliding Window and Two Pointers
9 questionsRecursion and Backtracking
10 questionsPower Set — Solve on LeetCode (opens in a new tab)
Related Atlas lesson: Subsets. Check the source problem’s input/output requirements before adapting it.
Generate Parentheses — Solve on LeetCode (opens in a new tab)
Related Atlas lesson: Generate Parentheses. Check the source problem’s input/output requirements before adapting it.
Letter Combinations of a Phone Number — Solve on LeetCode (opens in a new tab)
Related Atlas lesson: Letter Combinations of a Phone Number. Check the source problem’s input/output requirements before adapting it.
Combination Sum — Solve on LeetCode (opens in a new tab)
Related Atlas lesson: Combination Sum. Check the source problem’s input/output requirements before adapting it.
Combination Sum II — Solve on LeetCode (opens in a new tab)
Related Atlas lesson: Combination Sum II. Check the source problem’s input/output requirements before adapting it.
Subsets II — Solve on LeetCode (opens in a new tab)
Related Atlas lesson: Subsets II. Check the source problem’s input/output requirements before adapting it.
Palindrome partitioning — Solve on LeetCode (opens in a new tab)
Related Atlas lesson: Palindrome Partitioning. Check the source problem’s input/output requirements before adapting it.
Word Search — Solve on LeetCode (opens in a new tab)
Related Atlas lesson: Word Search. Check the source problem’s input/output requirements before adapting it.
N Queen — Solve on LeetCode (opens in a new tab)
Related Atlas lesson: N-Queens. Check the source problem’s input/output requirements before adapting it.
Sudoku Solver — Solve on LeetCode (opens in a new tab)
Related Atlas lesson: Sudoku Solver. Check the source problem’s input/output requirements before adapting it.
Linked List
16 questionsLength of loop in LL — Find on GeeksforGeeks (opens in a new tab)
Direct match not yet confirmed; opens a GeeksforGeeks search.
Sort a Linked List of 0's 1's and 2's — Find on GeeksforGeeks (opens in a new tab)
Direct match not yet confirmed; opens a GeeksforGeeks search.
Flattening of LL — Find on GeeksforGeeks (opens in a new tab)
Direct match not yet confirmed; opens a GeeksforGeeks search.
Stack and Queues
14 questionsGreedy Algorithms
8 questionsValid Paranthesis Checker — Find on GeeksforGeeks (opens in a new tab)
Direct match not yet confirmed; opens a GeeksforGeeks search.
N meetings in one room — Find on GeeksforGeeks (opens in a new tab)
Direct match not yet confirmed; opens a GeeksforGeeks search.
Minimum number of platforms required for a railway — Find on GeeksforGeeks (opens in a new tab)
Direct match not yet confirmed; opens a GeeksforGeeks search.
Job sequencing Problem — Find on GeeksforGeeks (opens in a new tab)
Direct match not yet confirmed; opens a GeeksforGeeks search.
Heaps
5 questionsHeapify Algorithm — Find on GeeksforGeeks (opens in a new tab)
Direct match not yet confirmed; opens a GeeksforGeeks search.
Build heap from a given Array — Find on GeeksforGeeks (opens in a new tab)
Direct match not yet confirmed; opens a GeeksforGeeks search.
Implement Min Heap — Find on GeeksforGeeks (opens in a new tab)
Direct match not yet confirmed; opens a GeeksforGeeks search.
Binary Trees
15 questionsRight/Left View of BT — Find on GeeksforGeeks (opens in a new tab)
Direct match not yet confirmed; opens a GeeksforGeeks search.
Top View of BT — Find on GeeksforGeeks (opens in a new tab)
Direct match not yet confirmed; opens a GeeksforGeeks search.
Binary Search Trees
10 questionsInorder successor and predecessor in BST — Find on GeeksforGeeks (opens in a new tab)
Direct match not yet confirmed; opens a GeeksforGeeks search.
Kth Smallest and Largest element in BST — Find on GeeksforGeeks (opens in a new tab)
Direct match not yet confirmed; opens a GeeksforGeeks search.
Graphs
29 questionsTopological sort or Kahn's algorithm — Find on GeeksforGeeks (opens in a new tab)
Direct match not yet confirmed; opens a GeeksforGeeks search.
Kosaraju's algorithm — Find on GeeksforGeeks (opens in a new tab)
Direct match not yet confirmed; opens a GeeksforGeeks search.
Articulation point in graph — Find on GeeksforGeeks (opens in a new tab)
Direct match not yet confirmed; opens a GeeksforGeeks search.
Shortest path in undirected graph with unit weights — Find on GeeksforGeeks (opens in a new tab)
Direct match not yet confirmed; opens a GeeksforGeeks search.
Shortest path in DAG — Find on GeeksforGeeks (opens in a new tab)
Direct match not yet confirmed; opens a GeeksforGeeks search.
Bellman ford algorithm — Find on GeeksforGeeks (opens in a new tab)
Direct match not yet confirmed; opens a GeeksforGeeks search.
Floyd warshall algorithm — Find on GeeksforGeeks (opens in a new tab)
Direct match not yet confirmed; opens a GeeksforGeeks search.
Disjoint Set — Find on GeeksforGeeks (opens in a new tab)
Direct match not yet confirmed; opens a GeeksforGeeks search.
Dynamic Programming
19 questionsFrog jump with K distances — Find on GeeksforGeeks (opens in a new tab)
Direct match not yet confirmed; opens a GeeksforGeeks search.
Ninja's training — Find on GeeksforGeeks (opens in a new tab)
Direct match not yet confirmed; opens a GeeksforGeeks search.
Tries
5 questionsStrings
4 questionsRabin Karp Algorithm — Find on GeeksforGeeks (opens in a new tab)
Direct match not yet confirmed; opens a GeeksforGeeks search.
Z function — Find on GeeksforGeeks (opens in a new tab)
Direct match not yet confirmed; opens a GeeksforGeeks search.
Bit Manipulation
4 questionsPower Set Bit Manipulation — Solve on LeetCode (opens in a new tab)
Related Atlas lesson: Subsets. Check the source problem’s input/output requirements before adapting it.
Mathematics
1 questionsPrint all primes till N — Find on GeeksforGeeks (opens in a new tab)
Direct match not yet confirmed; opens a GeeksforGeeks search.
No questions match these filters
Try a shorter search or clear the filters to see the full list.