InterviewMate by ManifestJob
LeetCode ≠ the full interview
Interview practice beyond LeetCode lists
LeetCode, HackerRank, and similar sites are excellent for solving problems. They do not train you to explain a solution to a stranger, narrate tradeoffs, or survive a hiring-manager screen. InterviewMate is the spoken half of interview prep: live voice mock interviews with curated company questions and a report after every session.
Practice the spoken interviewUse both—don’t replace one with the other
| LeetCode-style grind | InterviewMate |
|---|---|
| Solve coding problems | Answer out loud under a clock |
| Silent practice | Live voice session with follow-ups |
| Pattern recognition | Behavioral + project + role questions companies ask |
| Green checkmarks | Scored report: clarity, gaps, stronger sample answers |
When to add spoken practice
- You pass OAs but freeze on phone screens
- You can solve mediums but cannot explain your approach cleanly
- You have an onsite with behavioral + technical discussion rounds
- You are a fresher or junior who under-practiced communication
Real sample questions from our bank
These are real questions from the bank InterviewMate sessions draw on — not filler written for this page.
- [Easy] What is an array, and how do you access the i-th element?
- [Medium] Design an in-memory LRU cache with constant-time get and put. Walk through the data structures, eviction path, and tests for updates and capacity edges.
- [Medium] When do you use an array vs a linked list? What’s the cost of insert/search in each?
- [Hard] A service's latency rises while CPU stays low, run queues are short, and disk utilization is high. Reason through scheduling, virtual memory, page cache, I/O waits, and connection pooling to isolate the bottleneck.
- [Very hard] Suppose you need to maintain the median of a stream of integers, but you are only allowed O(log n) memory at any time; how would you design an approximate solution, and what are the tradeoffs in accuracy and performance?