machine coding
Build a working system in 90–120 minutes
Some interviews skip the whiteboard. They give you a problem statement and 90–120 minutes, and say: build it, make it run, make it clean. These eight specs let you practise exactly that, with a judge that checks your code.
the round
What a machine-coding round is
In a machine-coding round you build a small, working system on your own laptop: a parking lot, a cache, a splitter. No database, no UI — just classes in memory.
Candidates' interview reports (community-reported, not official) describe this round at Indian product companies such as Flipkart: often 90 minutes, full working code in your own language, then a discussion where the interviewer reads your code and tries boundary cases.
You are marked on five things: working code, structure (can a new feature plug in?), the right data structures with their cost, edge cases, and readability. Working code comes first — a beautiful design that does not run scores low.
Every spec here gives you the exact Java API, an example session, a time plan and a judge with hidden tests. The reference solution stays hidden until you try.
sources: Flipkart Interview Experience | Set 50 (Off-campus) — a 90-minute machine coding round (GeeksforGeeks) ↗ (community-reported)
how to practise
One spec, one sitting
- Pick a spec. Read the brief and requirements twice. Write down your questions — in the real round, you would ask them.
- Start the timed mock. Follow the phases: clarify, design, core code, edge cases, polish.
- Write the code in the editor below the spec. Run checks the example session; Submit adds the hidden tests.
- Stuck for 15 minutes? Open one hint at a time. Then compare with the reference and mark yourself honestly on the rubric.
- Chalo, start with the parking lot. It is the most common first round, and the gentlest.
8 specs
Pick one and start the clock
- 01 · 90 min
Parking Lot
The classic first round: floors, spot types, nearest free spot and an hourly bill in ₹.
- 02 · 90 min
Live Leaderboard
A fantasy-cricket contest table: add points, show the top k, answer “what is my rank?”.
- 03 · 90 min
Snake Game
The Nokia classic as an engine: a deque for the body, a set for “did I bite myself?”.
- 04 · 90 min
API Rate Limiter
Two policies behind one interface: a sliding-window log and a token bucket, per client.
- 05 · 90 min
LRU Cache with TTL
LeetCode 146 grows up: entries also expire, and expired ones must never take space.
- 06 · 90 min
Search Autocomplete
Type “ja”, see the best 10 words: a trie that keeps each prefix's top list ready.
- 07 · 90 min
Expense Splitter
Flatmates share bills: balances in paise, equal and exact splits, and a short settle-up plan.
- 08 · 120 min
Task Scheduler with Dependencies
A CI pipeline runner: priorities, dependencies that may arrive later, and cycle detection.