Home / Interview Glossary / Coding Interview
Interview glossary: Interview formats

Coding Interview

What it is, why it matters for you as a candidate, and how to prepare for it.

Definition

A coding interview asks you to solve a programming problem while the interviewer watches. You are typically given a problem statement, a shared editor and thirty to forty-five minutes to produce working code, explain your approach, reason about time and space complexity, and test what you wrote before the clock runs out.

What Coding Interview means in practice

Coding rounds appear at nearly every stage of a software process: as an automated online assessment, as a technical phone screen with a shared editor, and as one or two live sessions in the final loop. Problems usually center on arrays, strings, hash maps, trees, graphs and dynamic programming, though many companies now prefer practical tasks such as parsing a log file or extending an existing class. Scoring covers correctness, complexity, code quality, testing and communication. Some interviewers expect code that compiles; others accept close to correct code with sound reasoning. Ask which, because the strategy differs.

Why it matters for candidates

This round is the most heavily filtered stage in technical hiring, and it rewards deliberate practice more than raw talent. The most common failure is not a missing algorithm but silence, or writing code before agreeing what the function should return for an empty input. Talking through a brute force solution first, then optimizing it, gives the interviewer something to score even if you never reach the ideal answer.

How to prepare

  • Drill a small set of patterns rather than grinding hundreds of random problems.
  • Practice with a timer and speak every step aloud.
  • State a brute force solution and its complexity before optimizing.
  • Walk through one example and one edge case before declaring you are finished.
  • Write in the language you know best unless the company mandates another.

Example

How it typically plays out

You are asked to return the first non repeating character in a string. A good answer clarifies whether the input is ASCII or Unicode and whether case matters, states the brute force at quadratic time, then proposes a frequency map giving two linear passes. You write it, run it against an empty string and one with all duplicates, and mention that a single pass with an ordered map would trade memory for one fewer traversal.

Know the format. Now know the questions. Paste your actual job description into the free Question Predictor and get the 20 questions that role is most likely to ask, with what each one is really probing.

Predict my questions

Related terms

Walking into this interview soon? GhostPilot listens to your live call, spots the question the moment it is asked, and puts a structured answer on your screen in real time. Try it on your next mock, or grab a $29 Session Pass, no subscription, for the real thing.

See how it works

Rehearse the hard questions before they are asked

Practise with a live copilot, then walk in ready. A $29 Session Pass gets you through the interview with no subscription and no lock-in.

Get GhostPilot