‹ gallerydsa-interview
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
  1. 01Two Sum15m
  2. 02Valid Parentheses15m
  3. 03Longest Substring Without Repeating Characters15m
  4. 04Linked List Cycle II15m
  5. 05Validate Binary Search Tree15m
  6. 06Number of Islands15m
  7. 07Top K Frequent Elements15m
  8. 08Word Search15m
  9. 09Course Schedule15m
  10. 10Coin Change15m