Coding Interview Practice

Data structures and algorithms interview problems, worked through like a strong candidate

Coding Interview Practice is a Bertopia flashcard pack of 150 cards: data structures and algorithms interview problems, worked through like a strong candidate. It covers hash maps and arrays; two pointers; sliding window; prefix sums; linked lists; matrix traversal; stacks and monotonic stacks; heaps and top k; trees; graphs, BFS and DFS; binary search; backtracking; intervals; dynamic programming; greedy; tries; union find; design a data structure.

Worked answers by topic

• Hash map, array and prefix sum interview questions (14 questions)
• Two pointers coding interview questions (8 questions)
• Sliding window coding interview questions (8 questions)
• Linked list coding interview questions (6 questions)
• Stack and monotonic stack interview questions (10 questions)
• Heap and top k coding interview questions (10 questions)
• Tree coding interview questions (7 questions)
• Graph, BFS, DFS and union find interview questions (30 questions)
• Binary search coding interview questions (12 questions)
• Backtracking coding interview questions (6 questions)
• Intervals and greedy coding interview questions (11 questions)
• Dynamic programming interview questions (14 questions)
• Data structure design and trie interview questions (14 questions)

Sources

Get this pack when we launch

Coming soon. Get a note when it's ready.

Join the waitlist