Atlas / DSA / Company Practice 3 companies18 topics per track54 official practice links
54 recommendations shown
G Google A reasoning-heavy track spanning search, recursion, graphs and dynamic programming.
18 / 18› 01 / Arrays medium
Maximum Subarray array · kadane · dynamic programming
02 / Strings hard
Minimum Window Substring string · sliding window · frequency map
03 / Hashing medium
Longest Consecutive Sequence hash set · array · hash map
04 / Two Pointers hard
Trapping Rain Water two pointers · prefix maximum · monotonic stack
05 / Sliding Window hard
Sliding Window Maximum sliding window · monotonic deque · monotonic queue
06 / Binary Search hard
Median of Two Sorted Arrays binary search · partition · two heaps median maintenance
07 / Linked Lists medium
Copy List with Random Pointer linked list · hash map · set
08 / Stacks and Queues hard
Largest Rectangle in Histogram monotonic stack · recursion · divide
09 / Recursion and Backtracking hard
N-Queens backtracking · constraints · board configurations
10 / Binary Trees hard
Binary Tree Maximum Path Sum tree · dfs · dynamic programming
11 / Binary Search Trees medium
Validate Binary Search Tree bst · dfs · bounds
12 / Heaps and Priority Queues hard
Find Median from Data Stream two heaps · design · two heaps median maintenance
13 / Graphs hard
Word Ladder graph · bfs · string
14 / Greedy hard
Candy greedy · two pass · array traversal
15 / Dynamic Programming medium
Edit Distance dynamic programming · string · dp on strings
16 / Tries hard
Word Search II trie · backtracking · matrix
17 / Bit Manipulation medium
Sum of Two Integers bit manipulation
18 / Intervals medium
Merge Intervals intervals · sorting · partitioning
M Meta (Facebook) A practical track focused on arrays, strings, pointer reasoning, trees and graph traversal.
18 / 18› 01 / Arrays easy
Merge Sorted Array array · two pointers · in place
02 / Strings easy
Valid Palindrome string · two pointers
03 / Hashing medium
Group Anagrams hash map · string · sorting
04 / Two Pointers medium
3Sum two pointers · sorting
05 / Sliding Window medium
Longest Substring Without Repeating Characters sliding window · hash set
06 / Binary Search medium
Find First and Last Position of Element in Sorted Array binary search · boundary
07 / Linked Lists easy
Linked List Cycle linked list · fast slow pointers · fast
08 / Stacks and Queues easy
Valid Parentheses stack · string
09 / Recursion and Backtracking medium
Subsets recursion · backtracking · divide
10 / Binary Trees medium
Binary Tree Level Order Traversal tree · bfs · queue
11 / Binary Search Trees medium
Kth Smallest Element in a BST bst · inorder · bst properties
12 / Heaps and Priority Queues medium
K Closest Points to Origin heap · geometry · priority queue
13 / Graphs medium
Clone Graph graph · dfs · bfs
14 / Greedy medium
Partition Labels greedy · string · two pointers
15 / Dynamic Programming medium
Decode Ways dynamic programming · string
16 / Tries medium
Design Add and Search Words Data Structure trie · dfs · design
17 / Bit Manipulation easy
Number of 1 Bits bit manipulation
18 / Intervals medium
Interval List Intersections intervals · two pointers
U Uber A backend-flavoured track with intervals, heaps, graph connectivity and optimization problems.
18 / 18› 01 / Arrays easy
Best Time to Buy and Sell Stock array · running answer · greedy
02 / Strings medium
Reverse Words in a String string · two pointers
03 / Hashing medium
Subarray Sum Equals K prefix sum · hash map
04 / Two Pointers medium
Container With Most Water two pointers · greedy
05 / Sliding Window medium
Minimum Size Subarray Sum sliding window · array · two pointers
06 / Binary Search medium
Koko Eating Bananas binary search · answer space · binary search on answer
07 / Linked Lists medium
Reorder List linked list · fast slow pointers · reversal
08 / Stacks and Queues medium
Daily Temperatures monotonic stack · array
09 / Recursion and Backtracking medium
Word Search backtracking · matrix · dfs
10 / Binary Trees medium
Binary Tree Right Side View tree · bfs · dfs
11 / Binary Search Trees medium
Delete Node in a BST bst · recursion · bst operations
12 / Heaps and Priority Queues medium
Task Scheduler heap · greedy · priority queue
13 / Graphs medium
Cheapest Flights Within K Stops graph · shortest path · shortest path dijkstra
14 / Greedy medium
Gas Station greedy · array · circular array
15 / Dynamic Programming medium
Coin Change dynamic programming · unbounded knapsack · coin change
16 / Tries medium
Implement Trie (Prefix Tree) trie · design · prefix tree
17 / Bit Manipulation easy
Missing Number bit manipulation · xor
18 / Intervals medium
Non-overlapping Intervals intervals · greedy · interval scheduling
No recommendations match those filters. Reset the filters or try a broader search.
How to read these tracks Interview questions change and employers do not publish an official question bank. These are preparation tracks based on recurring community-reported topics. They are not a promise that the same question will appear in an interview.
Looking for recent interview experiences by role and location? Build a sourced interview prep brief .