all levels · 10 questions · ~150 min
DS&A · Round 1 patterns (graphs, trees & DP)
Agoda names graphs and dynamic programming as Round-1 topics, so these are in scope. Ten problems through a 7-phase Socratic loop — clarification, approach, complexity, edges, code, tradeoff. No clock; learn the shapes here, then drill timed.
0 / 10 passed
- 01Two Sumarray · hashmap15m
- 02Valid Parenthesesstack · string15m
- 03Longest Substring Without Repeating Characterssliding-window · hashmap · string15m
- 04Linked List Cycle IIlinked-list · two-pointer · floyd15m
- 05Validate Binary Search Treetree · bst · dfs15m
- 06Number of Islandsgraph · dfs · bfs · union-find · matrix15m
- 07Top K Frequent Elementsheap · bucket-sort · hashmap15m
- 08Word Searchbacktracking · dfs · matrix15m
- 09Course Schedulegraph · topological-sort · dfs · bfs15m
- 10Coin Changedp · memoization15m