Problem database last updated: June 20, 2025
8 problems · 1 Easy, 7 Medium, 0 Hard · Ranked #175 of 458
1 Easy
13% · avg 23%
7 Medium
88% · avg 59%
0 Hard
0% · avg 18%
Based on 8 reported problems, CARS24 interviews are easier than average - only 0% Hard compared to 18% across all companies. The majority (88%) of questions are Medium difficulty, which is typical for companies that want to see solid fundamentals without excessive trick questions.
Compared to the industry average, CARS24 puts unusual emphasis on design (25% of problems, 4.3x the industry average), hash-table (62.5% of problems, 2.8x the industry average), binary-search (25% of problems, 2.8x the industry average). If you're short on time, these are the categories to double down on.
The most common topics are hash-table (62.5%), array (62.5%), string (37.5%), binary-search (25%). Problems below are sorted by frequency, the ones at the top are asked most often.
| Problem | Difficulty | Frequency | Topics | |
|---|---|---|---|---|
Time Based Key-Value Store Design a time-based key-value data structure that can store multiple values for the same key at different time stamps and retrieve the key's value at a certain... | Medium | Very Likely | hash-tablestringbinary-search | Solve |
Online Election You are given two integer arrays persons and times. In an election, the ith vote was cast for persons[i] at time times[i]. | Medium | Very Likely | arrayhash-tablebinary-search | Solve |
Open the Lock You have a lock in front of you with 4 circular wheels. Each wheel has 10 slots: '0', '1', '2', '3', '4', '5', '6', '7', '8', '9'. The wheels can rotate freely... | Medium | Very Likely | arrayhash-tablestring | Solve |
Rabbits in Forest There is a forest with an unknown number of rabbits. We asked n rabbits "How many other rabbits have the same color as you?" and collected the answers in an int... | Medium | Very Likely | arrayhash-tablemath | Solve |
Counter Given an integer n, return a counter function. This counter function initially returns n and then returns 1 more than the previous value every subsequent time i... | Easy | Very Likely | Solve | |
House Robber You are a professional robber planning to rob houses along a street. Each house has a certain amount of money stashed, the only constraint stopping you from rob... | Medium | Very Likely | arraydynamic-programming | Solve |
Bulls and Cows You are playing the Bulls and Cows game with your friend. | Medium | Very Likely | hash-tablestringcounting | Solve |
Merge Intervals Given an array of intervals where intervals[i] = [starti, endi], merge all overlapping intervals, and return an array of the non-overlapping intervals that cove... | Medium | Very Likely | arraysorting | Solve |
Time Based Key-Value Store
SolveDesign a time-based key-value data structure that can store multiple values for the same key at different time stamps and retrieve the key's value at a certain...
Online Election
SolveYou are given two integer arrays persons and times. In an election, the ith vote was cast for persons[i] at time times[i].
Open the Lock
SolveYou have a lock in front of you with 4 circular wheels. Each wheel has 10 slots: '0', '1', '2', '3', '4', '5', '6', '7', '8', '9'. The wheels can rotate freely...
Rabbits in Forest
SolveThere is a forest with an unknown number of rabbits. We asked n rabbits "How many other rabbits have the same color as you?" and collected the answers in an int...
Counter
SolveGiven an integer n, return a counter function. This counter function initially returns n and then returns 1 more than the previous value every subsequent time i...
House Robber
SolveYou are a professional robber planning to rob houses along a street. Each house has a certain amount of money stashed, the only constraint stopping you from rob...
Bulls and Cows
SolveYou are playing the Bulls and Cows game with your friend.
Merge Intervals
SolveGiven an array of intervals where intervals[i] = [starti, endi], merge all overlapping intervals, and return an array of the non-overlapping intervals that cove...
Frequency scores are based on crowdsourced interview reports. A higher score means the problem has been reported more often in recent CARS24 interviews.
Very Likely
75-100%
Likely
50-74%
Sometimes
25-49%
Rare
0-24%
CARS24 interviews focus heavily on hash-table, array, string problems. If you're short on time, these are the categories to prioritize. The problems on this page are sorted by frequency, so start from the top and work your way down.
Beyond solving problems, practice explaining your approach. CARS24 interviewers care about your thought process - how you break down a problem, consider edge cases, and evaluate tradeoffs between solutions. A clean O(n) solution you can explain clearly beats an O(log n) solution you can't articulate.
Looking for more companies? Browse all 458 companies in our directory, or sharpen your fundamentals with our free data structure visualizers and AI-powered DSA tutor.
CARS24 has been reported to ask 8 distinct coding problems. The most common topics are hash-table, array, string. 1 are Easy difficulty, 7 are Medium, and 0 are Hard. Problems are sorted by frequency - the ones at the top are asked most often.
Based on 8 reported problems, CARS24 interviews are easier than average - only 0% Hard compared to 18% across all companies. 88% of questions are Medium difficulty. Focus on the high-frequency Medium problems first, then work through the Hard ones.
Start with the highest-frequency problems listed on this page. Focus on the core topics: hash-table, array, string. Practice solving them under time pressure and explaining your approach out loud. Mock interviews with AI can simulate the real experience.
Simulate a real CARS24 coding interview with an AI interviewer. Get a scorecard with specific feedback on your problem-solving, code quality, and communication.
Simulate a CARS24 interview with AIarrow_forward
