Micro Free Course — 100% Free Learning
All lessons in this module are free to learn. Sign in with Google to save your progress.
Mock Interview Practice
Six timed mock interviews covering arrays/hashmaps, linked lists, trees, graphs, DP, and a full 90-min combined session. Approach scripts, communication tips, and detailed solution walkthroughs.
Module Content
Mock 1 — Arrays, Strings, Hashmaps (45 min)
Three problems covering two-pointer, sliding window, and hashmap patterns. Time yourself; practice the interview narration.
Mock 2 — Linked Lists (45 min)
Three linked-list problems testing pointer manipulation, the two-pointer (fast/slow) pattern, and recursion.
Mock 3 — Trees (60 min)
Tree problems: traversal, lowest common ancestor, diameter, serialize/deserialize. Tests DFS templates and recursive thinking.
Mock 4 — Graphs (60 min)
Graph problems: connected components, course schedule (topological sort), shortest path, network delay. Tests BFS/DFS/Dijkstra recognition.
Mock 5 — Dynamic Programming (60 min)
DP problems across patterns: 1D, 2D, knapsack-style. Tests recurrence-derivation and state-design skills.
Mock 6 — Full 90-Min Interview (90 min)
Three problems mixing difficulties (easy, medium, hard) like a real interview. Practice pacing, communication, and recovery from getting stuck.