ZoomCar Interview Experience
Interview Experience
I was contacted by an Zoomcar HR for the position of IoT based Development Role. There were total 4 rounds and they were based on Pure DS Algo.
Round 1 It was a Simple Int...
Full Details
I was contacted by an Zoomcar HR for the position of IoT based Development Role. There were total 4 rounds and they were based on Pure DS Algo.
Round 1 It was a Simple Introductory round. The interviewer was very friendly. He started with some basic OS question like what is deadlock, what is virtual memory. Then he asked me some basic OOP'S Concept like Polymorphism, Encapsulation. After that he moved on to the DS Algo part. The question was "Find two elements which sum to a given target" ( https://www.geeksforgeeks.org/dsa/check-if-pair-with-given-sum-exists-in-array/ ). I told him the HashMap approach and he was satisfied with my solution.
Round 2 It was a Pure DS Algo round, The interviewer was very friendly and he helped me a lot during the Interview. Find the subarray with maximum Product in the given array (https://www.geeksforgeeks.org/dsa/maximum-product-subarray/) (Not able to solved it at that time) Find the Inorder Successor of the given node in the Binary Search Tree ( https://www.geeksforgeeks.org/dsa/inorder-successor-in-binary-search-tree/ )
Round 3 This was the best interview I have ever given. Although I was not able to fully solve the problem but the interviewer was so friendly. He really helped me a lot during the interview. It was a tough DP question. I have never solved this type of question before. I started with the recursive approach. After I gradually moved towards the DP solution. Given two jar with capacity A and B. You have infinite pool of water from where you can fill water in the jar. Now you can do 3 operation Transfer the water from Jar A to Jar B. Fill the water from the Pool to Jar A or Jar B. This is step is counted. Now you have target amount C. You have to adjust water in A and B such that the sum of water in Jar A and Jar B is equal to C and you have to do this in minimum number of step . Also you have to first check whether it is possible to achieve the task or not.
Round 4 This was somewhat easier than the previous round. The question was similar to Rotten Oranges ( https://www.geeksforgeeks.org/dsa/minimum-time-required-so-that-all-oranges-become-rotten/ ). It was a pretty easy question if you have done the Rotten Oranges question beforehand.
Verdict Selected
About This Question
This is a candidate experience report from a zoomcar interview for a swe role during the phone screen round reported in 2025.
It covers the following topics: Oop, Trees, Dynamic Programming, Binary Tree, Binary Search, Recursion, Os, Hash Table, Arrays .
Difficulty rating: Easy
More Zoomcar Interview Questions
About Zoomcar Interview Reports
This question was reported by a candidate who interviewed at Zoomcar. LeakCode aggregates interview reports from 10+ sources, including 1Point3Acres, Glassdoor, LeetCode Discuss, Blind, Reddit, Indeed, and Nowcoder. Each report is translated where necessary, deduplicated against existing entries, and tagged by company, role, round type, and reporting date.
Use this question as one calibration data point, not a memorization target. Companies typically rotate their question pools every 2-4 months; the exact wording of a 2024 question may differ from what you encounter today. The underlying pattern, difficulty level, and follow-up depth at Zoomcar are the higher-signal extractions to take from this report.
For broader preparation context, the Zoomcar interview process typically includes a recruiter screen, one or two technical phone screens, and a 4-5 round on-site loop covering coding, system design (at L4+ levels), and behavioral. Reports tagged on LeakCode show the round-by-round distribution and typical difficulty calibration. To browse questions filtered by round type and seniority, use the company hub linked above.
How To Practice This Type of Question
Solve similar problems on LeetCode under timed conditions (25-35 minutes per medium difficulty). The goal is pattern recognition: recognize the underlying technique (sliding window, two-pointer, BFS, memoized recursion, etc.) within 60-90 seconds of reading. Strong candidates verbalize their hypothesis out loud before coding, then iterate based on feedback. Weak candidates dive into implementation immediately, lose time on the wrong approach, and run out of time for follow-ups.
Companies update their question pools every 2-4 months. The exact wording of any given question may have been retired by the time you interview. Focus your prep on the pattern, not the specific problem. The patterns that appear in Zoomcar reports consistently are the ones worth investing in; one-off niche problems are not.
During Your Zoomcar Round
Apply the standard interview round template: clarify requirements (2-3 minutes), state your approach out loud and confirm direction with the interviewer (3-5 minutes), code with narration (15-25 minutes), test with concrete examples including edge cases (5 minutes), discuss optimization or trade-offs if time permits (5 minutes). This template is universally accepted across FAANG and adjacent companies; deviating from it produces weaker interviewer feedback signal.
The single most predictive failure mode in Zoomcar reports tagged "no hire": not asking clarifying questions. Interviewers are explicitly trained to weight this. Strong candidates ask 3-5 clarifying questions even on problems that look obvious; weak candidates dive into code immediately. The clarifying-question check is often the first signal recorded in the interviewer's written notes.