carwale coding interview
questions, leaked.
5 problems reported across recent carwale interviews. Top patterns: string, array, stack. The list below is what most reported candidates actually saw, plus the honest play if you can't grind all of it.
CarWale's coding assessment leans hard on string and array manipulation. Out of 5 reported problems, 3 hit strings, 3 hit arrays, and the difficulty split is brutal: one easy, three medium, one hard. The hard problem, Trapping Rain Water, pulls from multiple patterns at once. You're being tested on whether you can recognize a problem's structure under pressure and execute cleanly. Most candidates don't. If you blank mid-assessment, StealthCoder runs invisible during screen share and surfaces a working solution in seconds, so you stay on pace.
Top problems at carwale
| # | Problem | Diff | Frequency | Pass % | Patterns |
|---|---|---|---|---|---|
| 01 | Find Mirror Score of a String | MEDIUM | 100.0 | 34% | Hash Table · String · Stack |
| 02 | Zigzag Conversion | MEDIUM | 74.0 | 52% | String |
| 03 | Trapping Rain Water | HARD | 74.0 | 65% | Array · Two Pointers · Dynamic Programming |
| 04 | Best Time to Buy and Sell Stock | EASY | 65.2 | 55% | Array · Dynamic Programming |
| 05 | Minimum Time Difference | MEDIUM | 65.2 | 62% | Array · Math · String |
Frequencies derived from public community-tagged interview reports. Click a row to view on LeetCode.
You have a week, maybe less. You can't out-grind the list above. StealthCoder runs invisibly during the actual carwale OA. The proctor cannot see it. Screen share cannot detect it. Built by an Amazon engineer who realized the OA tests how well you memorized 200 problems, not how well you code.
Get StealthCoder- string3 · 60%
- array3 · 60%
- stack2 · 40%
- dynamic programming2 · 40%
- hash table1 · 20%
- simulation1 · 20%
- two pointers1 · 20%
- monotonic stack1 · 20%
- math1 · 20%
- sorting1 · 20%
String problems dominate the data. Half the problems touch strings, and they're not simple substring hunts. Find Mirror Score requires hash tables and simulation logic stacked together. Zigzag Conversion is about indexing and pattern recognition. Stack shows up twice, once in the hard problem and once buried in the string one. Arrays appear in half the set, but the hard problem (Trapping Rain Water) is a trap itself: it's four different topics in one, and most people solve it inefficiently on first try. Dynamic programming is low-frequency but present in the hard and the easy. Drill string and array problems first. Know when to use a monotonic stack. Be confident in two-pointers for edge cases. If the hard problem hits during your live assessment and you're not sure about the monotonic-stack approach, StealthCoder is your safety net.
Companies with similar patterns
If you prepped for carwale, these companies recycle ~60% of the same topics.
You've seen the list.
Now make sure you pass carwale.
Memorizing every problem above in a week is a fantasy. StealthCoder is the hedge: an AI overlay that's invisible during screen share. It reads the problem on screen and surfaces a working solution in under 2 seconds. Built by an Amazon engineer who realized the OA tests how well you memorized 200 problems, not how well you code. Works on HackerRank, CodeSignal, CoderPad, and Karat.
carwale interview FAQ
How many string problems should I expect on CarWale's assessment?+
Strings appear in 3 out of 5 reported problems. They're not toy problems either: Find Mirror Score mixes hash tables and simulation. Zigzag Conversion requires spatial reasoning. Prioritize string manipulation and string-plus-hash-table patterns in your prep.
Is the Trapping Rain Water problem actually that hard?+
Yes. It's one hard problem in a set of five, and it touches four different topics: array, two pointers, dynamic programming, stack, and monotonic stack. Brute force fails. Most people get TLE or MLE. Study the monotonic-stack approach and be ready to explain space-time tradeoffs.
What should I drill first for CarWale?+
Start with strings and arrays. 3 problems each. Then stack mechanics, especially monotonic stacks, because they're the hidden bottleneck in the hard problem. Skip hash tables until strings are solid; they appear in only one problem but inside a complex one.
Is dynamic programming required for this assessment?+
It appears in 2 problems: the easy (Buy and Sell Stock) and the hard (Trapping Rain Water). The easy one is a DP warm-up; solve it, understand the state transition, and you'll recognize the pattern in the hard problem.
How much simulation and math do I need to know?+
Simulation shows up once (Mirror Score), and math once (Minimum Time Difference). Low frequency. Don't obsess. If you're strong on strings and arrays, you can afford to treat these as edge-case review the night before your OA.