Skip to content
Skilled.dev

Interactive tools

Coding interview study-plan builder

Build a time-budgeted learning schedule with course links, rotating review, local completion marks, and a downloadable Markdown checklist.

Published · 5 min read

Build a schedule you can follow

Current plan: Algorithms and data structures. 14 study days, 60 minutes per day, 5 review blocks. Each block reserves 25 minutes for work and 5 for notes. Add rest days to your own calendar.

0 of 28 blocks marked complete.

This schedule leaves 4 topics without an initial practice block: Dynamic programming, Monotonic stacks, Heaps and top-K, Explain and test a solution. Add days or carry these topics into your next plan.

Settings and completion marks are saved in this browser. They are not synced to an account. Download a copy before switching devices.

Day 1 · 60 minutes

  • Open reading. Count the work and auxiliary memory of two different solutions.

  • Open exercise. Count the work and auxiliary memory of two different solutions.

Day 2 · 60 minutes

  • Open reading. Explain the lookup invariant and test repeated values and missing answers.

  • Open exercise. Explain the lookup invariant and test repeated values and missing answers.

Day 3 · 60 minutes

  • Open exercise. Count the work and auxiliary memory of two different solutions.

    Retry without earlier code. Change one constraint, trace a failing case, and record what still needs work.

  • Open reading. Explain why each discarded candidate cannot improve the answer.

Day 4 · 60 minutes

  • Open exercise. Explain why each discarded candidate cannot improve the answer.

  • Open reading. Implement a window and explain exactly when its left edge moves.

Day 5 · 60 minutes

  • Open exercise. Implement a window and explain exactly when its left edge moves.

  • Open exercise. Explain the lookup invariant and test repeated values and missing answers.

    Retry without earlier code. Change one constraint, trace a failing case, and record what still needs work.

Day 6 · 60 minutes

  • Open reading. Compare range subtraction and prefix-frequency counting with a small exhaustive baseline.

  • Open exercise. Compare range subtraction and prefix-frequency counting with a small exhaustive baseline.

Day 7 · 60 minutes

  • Open reading. State the boundary invariant and trace empty, duplicate, and all-false inputs.

  • Open exercise. State the boundary invariant and trace empty, duplicate, and all-false inputs.

Day 8 · 60 minutes

  • Open exercise. Count the work and auxiliary memory of two different solutions.

    Retry without earlier code. Change one constraint, trace a failing case, and record what still needs work.

  • Open reading. Trace the next pointer before each reassignment and test a one-node list.

Day 9 · 60 minutes

  • Open exercise. Trace the next pointer before each reassignment and test a one-node list.

  • Open reading. Describe what each stack entry means and reject mismatched closing brackets.

Day 10 · 60 minutes

  • Open exercise. Describe what each stack entry means and reject mismatched closing brackets.

  • Open exercise. Explain why each discarded candidate cannot improve the answer.

    Retry without earlier code. Change one constraint, trace a failing case, and record what still needs work.

Day 11 · 60 minutes

  • Open reading. Define the recursive return value and the empty-subtree base case.

  • Open exercise. Define the recursive return value and the empty-subtree base case.

Day 12 · 60 minutes

  • Open reading. Track visited cells and explain queue versus recursion memory.

  • Open exercise. Track visited cells and explain queue versus recursion memory.

Day 13 · 60 minutes

  • Open exercise. Implement a window and explain exactly when its left edge moves.

    Retry without earlier code. Change one constraint, trace a failing case, and record what still needs work.

  • Open reading. Choose, recurse, undo, and copy each completed result.

Day 14 · 60 minutes

  • Open exercise. Choose, recurse, undo, and copy each completed result.

  • Open reading. Define the state and compare the recurrence with exhaustive small cases.

Build a coding interview schedule around the time you can spend on each study day. Choose a track, set the number of days, and use the generated learning, practice, and review blocks as a starting allocation. The checklist links directly to public guides, published course lessons, and worked exercises.

A schedule can reserve time; it cannot predict how quickly you will learn a topic. If a practice block ends before you understand the solution, write down the missing step and continue it in a later block. Finishing the calendar is a different observation from solving unfamiliar problems independently.

Choose a track from the work you need

The algorithms and data structures track moves from complexity, arrays, and pointer techniques through search, lists, stacks, trees, graphs, backtracking, and dynamic programming. It also includes prefix sums, monotonic stacks, and heaps. Its sequence gives early attention to core collection operations before moving to problems that combine several ideas.

Core foundations uses a smaller set of topics: complexity, arrays, two pointers, binary search, stacks, trees, graphs, and explaining a solution. Choose it when those basics still require frequent reference to earlier code. It gives those topics more room within the same number of days, rather than adding advanced material to every available slot.

JavaScript and frontend includes language collections and contracts, complexity, hash-map practice, function context, tasks and microtasks, promises, event timing, and subscriptions. It prepares those subjects alongside explaining and testing an implementation. It does not cover every frontend interview area: browser rendering, accessibility, CSS, component design, and system architecture need additional practice outside this schedule.

Read a 30-minute block

Every block reserves 25 minutes for focused work and five minutes for a written note. These are time budgets you choose to spend, not measured completion estimates for the linked lessons. A long lesson may require several sessions. End the block by recording what you tried, what failed, and the next action.

A learning block opens a guide or topic overview. Read the contract, trace the example, and write the invariant in your own words. A practice block opens a course exercise or a guide's practice section. Attempt it before consulting the worked code. Review blocks return to earlier topics and ask you to retry without that code, alter one constraint, and explain a failing case.

The planner offers 30, 60, 90, or 120 minutes per study day. A 60-minute day contains two blocks; a 90-minute day contains three. Add breaks and rest days to your own calendar. “Day 7” means your seventh study day, so taking a day off does not require pretending a missed session is complete.

Understand review and coverage

Each topic has an initial learning block followed by a practice block. Once practice topics are available, every fifth block is allocated to review. Review rotates through topics already given an initial practice block. After all initial topic blocks fit, the remaining schedule continues with review. This rotation is a simple planning rule; it is not a personalized memory model.

A short plan can end before later topics receive practice time. The tool names those unfinished topics instead of shrinking all lessons until the list appears complete. Add days, increase the time budget if it is sustainable, choose a narrower track, or carry the remaining topics into a later plan.

A topic with an initial reading block but no practice block still appears as unfinished. A completion checkbox records that you marked a scheduled block done. It does not certify mastery or change course access. Existing lesson availability and account requirements follow the application's deployment settings; the public guides and this planner can be used without signing in.

Save progress and take a copy

The planner saves the current settings and completion marks in local browser storage. Reopening the same site in that browser restores the plan when storage is available. A private browsing session, storage restriction, cleared site data, or another device can make that saved copy unavailable. Download a Markdown checklist if you want a file you can keep or move between devices.

The export includes day headings, task links, objectives, current checkboxes, and topics still to schedule. Open it in a text editor or a notes application that supports Markdown checklists. Marking the downloaded file does not sync changes back to the page.

Changing the track, day count, or time budget and pressing Build plan creates a new schedule and resets completion marks. Rebuilding with the same settings keeps them. Download a copy before replacing a plan you want to retain. Clear completion marks starts the same schedule again without changing its sequence.

Adapt the plan after a difficult session

Suppose a binary-search block ends with a wrong answer on duplicate values. Record the smallest failing array, the invariant your code violated, and the branch you need to inspect. Use the next available block to repair that understanding before advancing merely because a different subject is scheduled.

A useful weekly review compares independent attempts rather than checkbox totals. Try one unfamiliar problem, explain why its constraints permit your approach, and compare it with a slower reference on small inputs. Add the mistakes to the next plan. The pattern quiz can expose a weak assumption, while explaining a solution gives a structure for a full spoken walkthrough.

For a fully written sequence with daily goals, use the seven-day review or 30-day plan. Use this builder when you want a bounded checklist that you can adjust around your own calendar.

Practice in the course

Open a lesson to work through its explanation and examples. Coding exercises include an editor; available code languages are shown in each lesson.

Continue learning