i
CARS24
Filter interviews by
Create a REST API to retrieve employee data by ID
Use a GET request to /employees/{id} endpoint
Query the database for employee data based on the provided ID
Return the employee data in JSON format
I applied via Approached by Company and was interviewed in Nov 2024. There was 1 interview round.
Longest substring without repetition
Use a hashmap to count the frequency of each word in the array of strings and find the word with the highest frequency.
Create a hashmap to store the frequency of each word
Iterate through the array of strings and update the frequency in the hashmap
Find the word with the highest frequency in the hashmap
Top trending discussions
I applied via campus placement at Maulana Azad National Institute of Technology (NIT), Bhopal and was interviewed in Jul 2024. There were 2 interview rounds.
3 questions easy-medium level leetcode problem I solved 2 completely and 3rd question partially (9/15 test cases passed) to move on to 2nd round
I applied via Company Website and was interviewed in Nov 2024. There was 1 interview round.
1. PEAK ELEMENT QUESTION.
2. COIN DENOMINATION
I applied via Approached by Company and was interviewed in Sep 2024. There was 1 interview round.
Create a pagination component using an API to display data for different pages.
Use API to fetch data for each page
Implement pagination logic to display data for each page
Allow users to navigate between pages
posted on 26 Aug 2024
I applied via Referral and was interviewed in Apr 2024. There was 1 interview round.
I applied via Referral and was interviewed in Oct 2023. There were 4 interview rounds.
So after Resume shortlisting you have Round 1 as Programming Test (60%) & Aptitude Test (40%) in which you will be asked 15 aptitude questions and 2 DSA problems. You will get 1 hour to write the test.
DSA problems:
1. Merge 2 sorted arrays
2. find the target sum in given array and return their indexes
Find the length of the longest substring with distinct characters in a given string.
Use a sliding window approach to keep track of the current substring.
Maintain a set to store the distinct characters in the current substring.
Update the maximum length of the substring whenever a longer substring is found.
The maximum sum of a subarray is to be found.
Use Kadane's algorithm to find the maximum sum of a subarray.
Initialize two variables: maxSum and currentSum.
Iterate through the array and update currentSum by adding the current element.
If currentSum becomes negative, reset it to 0.
If currentSum is greater than maxSum, update maxSum.
Return maxSum as the maximum sum of a subarray.
I applied via Referral and was interviewed in Mar 2024. There were 3 interview rounds.
Given some ant ui design to reacreate from scretch
Interview experience
based on 10 reviews
Rating in categories
Retail Associate
864
salaries
| ₹1.9 L/yr - ₹5 L/yr |
Evaluation Engineer
442
salaries
| ₹1.4 L/yr - ₹4.8 L/yr |
Retail Manager
427
salaries
| ₹2.4 L/yr - ₹7.2 L/yr |
Team Lead
419
salaries
| ₹2 L/yr - ₹10.3 L/yr |
Key Account Manager
379
salaries
| ₹2 L/yr - ₹6 L/yr |
Mahindra First Choice Wheels
Truebil
Udaan
Indiamart Intermesh