Course outline · 0% complete

0/30 lessons0%

Course overview →

Practice like it is the job

lesson 11-2 · ~10 min · 30/30

Practice like it is the job

You have the patterns. Skill now comes from reps under realistic conditions, and the DSA platform on your dashboard is built for exactly this. A rep that actually builds skill looks like:

  1. Pick by topic, not at random. Weakest pattern first. Filter problems by the topic you are training.
  2. Time-box 25 minutes without hints: restate the problem, write the trigger phrase, name the pattern out loud, then code.
  3. Stuck at 25? Read a hint, not the solution. Stuck at 35? Read the editorial fully, close it, and re-implement from memory.
  4. Log a one-line note: "missed that sorted input → two pointers". Your miss-log is your syllabus.
  5. Re-solve every miss 3 days later. A problem is only "done" when you have solved it cold, twice.

The interview-day protocol

A four-week baseline that has carried many people through interviews: week 1, searching + sorting + two pointers. Week 2, sliding window + recursion + backtracking. Week 3, BFS/DFS + greedy. Week 4, DP + mixed random sets. One or two problems a day beats ten on Sunday.

In the room, run this script every single time:

  1. Restate the problem and invent a small example.
  2. Ask about edge cases: empty input, duplicates, sizes.
  3. Name the brute force and its Big-O in one sentence.
  4. Spot the trigger, name the pattern, state target complexity.
  5. Code it, narrating as you go.
  6. Trace your example through your code before saying done.

Interviewers pass people they can follow. The narration is not decoration, it is the deliverable.

Quiz

You are 25 minutes into a practice problem and stuck. What does deliberate practice say to do?

Code exercise · python

Final boss. Longest consecutive run: given unsorted numbers, find the length of the longest streak of consecutive integers (values, not positions). Target O(n): put everything in a set, and only count upward from numbers that START a run (n - 1 not in the set). Narrate the pattern to yourself as you write it.

Problem

Last callback: fewest coins to make an amount, with arbitrary denominations like [1, 3, 4]. Greedy or DP?