Command Palette

Search for a command to run...

Hectal

Module 44

Interview Method and Simulation

How to solve live: clarify, examples, brute force, optimise, code, test and explain, plus what interviewers expect at each level and six timed mock rounds.

Advanced 6 lessons 18 curated problems ~70 min of lessons

Knowing the patterns is half of a coding interview. The other half is solving in front of someone: asking the right questions, thinking aloud, writing clean code under time pressure, testing it yourself, and recovering when you're stuck.

This module gives you a seven-step method with a sample talk track, explains what interviewers score at different levels, sets out a revision plan for the final weeks, and ends with six mock rounds of three problems each, drawn from across the course and not repeated from the Core 100.

Best after: The Core 100

Part 1

Learn the ideas

  1. 44.1The Seven-Step MethodClarify → examples → brute force → optimise → plan → code → test. Spend the first third of the time before writing code.16 min
  2. 44.2Explaining Your ThinkingNarrate decisions, not keystrokes: what you're trying, why, what it costs, and what you'll check. When stuck, say what you've ruled out.10 min
  3. 44.3What Interviewers Expect at Each LevelInterns and new graduates are judged mostly on problem solving and correct code; mid-level on speed, clean code and trade-offs; seniors on clarity, judgement and connecting the algorithm to real systems.8 min
  4. 44.4Final Weeks: Revision Plan and Mock InterviewsIn the last 2–3 weeks, stop learning new patterns: re-solve your log, do two timed mocks a week out loud, and review each one with a short rubric.10 min
  5. 44.5Where Each Data Structure Lives in Real SystemsEvery structure in this course runs inside real products: hash maps in caches and databases, heaps in schedulers and feeds, graphs in maps and build systems, tries in search boxes, queues in messaging. Knowing these links makes both coding and design rounds easier.12 min
  6. 44.6Am I Ready? The Readiness ChecklistYou're ready for coding rounds when you can do the listed tasks for each topic from a blank file, within time, and explain them. Use this checklist to find gaps, then go back to that module.14 min

Set 1 · 3 problems

Mock round 1

45 minutes for all three. Talk out loud and follow the seven steps.

  1. 1.Contiguous ArrayMediumModule 5Prefix Sum + Hash Map
  2. 2.Minimum Number of Arrows to Burst BalloonsMediumModule 16Greedy Choice
  3. 3.IPOHardModule 19Two Heaps

Set 2 · 3 problems

Mock round 2

45 minutes. Note how you recognised each pattern.

  1. 1.Longest Palindromic SubstringMediumModule 3Expand Around Center
  2. 2.Open the LockMediumModule 22Graph BFS
  3. 3.Best Time to Buy and Sell Stock with CooldownMediumModule 331D Dynamic Programming

Set 3 · 3 problems

Mock round 3

45 minutes. State the brute force for each before optimising.

  1. 1.Car FleetMediumModule 10Monotonic Stack
  2. 2.Most Stones Removed with Same Row or ColumnMediumModule 26Union-Find
  3. 3.Distinct SubsequencesHardModule 32DP on Two Strings

Set 4 · 3 problems

Mock round 4

45 minutes. Test each solution by hand on an edge case.

  1. 1.Capacity to Ship Packages Within D DaysMediumModule 12Binary Search on the Answer
  2. 2.Search Suggestions SystemMediumModule 20Trie (Prefix Tree)
  3. 3.Path With Minimum EffortMediumModule 27Dijkstra's Shortest Path

Set 5 · 3 problems

Mock round 5

45 minutes. Explain the complexity of every idea you mention.

  1. 1.Rotate ArrayMediumModule 2Two Pointers: Opposite Ends
  2. 2.Target SumMediumModule 31Knapsack DP
  3. 3.Reconstruct ItineraryHardModule 37Graph DFS and Flood Fill

Set 6 · 3 problems

Mock round 6

45 minutes. Treat it as the real thing: no notes, no hints.

  1. 1.Partition LabelsMediumModule 34Greedy Choice
  2. 2.Time Based Key-Value StoreMediumModule 40Combine Structures to Design
  3. 3.Longest Increasing Path in a MatrixHardModule 25Topological Sort