Zoomcar Software Developer Interview Questions and Answers

Q1. It was regarding the tools and technologies we worked on. AWS services we worked on. How deployment happens.
Add your answer
Q2. What was the project you worked on.
Add your answer

Round duration - 120 Minutes
Round difficulty - Medium

Machine Coding Round
2 Hours in Total
15 Mins for Question Explaination and Doubts
1.5 Hours for coding
15 mins to discuss the approach 

Timing - 3 to 5 pm (They are flexible)
Interviewer was very patient and helped me understand the question

Round duration - 60 Minutes
Round difficulty - Medium

2 Data Strucutre Questions
Timing 5-6 pm (They are flexible)
Google Meet
Online IDE

Q1. 
Unique Binary Search Trees Problem Statement
Given an integer 'N', your task is to compute the number of structurally unique BSTs (binary search trees) that can be formed using an exact number of 'N' uniq...read more
Ans. 
The task is to compute the number of structurally unique BSTs that can be formed using an exact number of unique values.
• Use dynamic programming to solve the problem efficiently.

• The number of structurally unique BSTs can be calculated using Catalan numbers.

• For N nodes, the number of structurally unique BSTs is given by the Nth Catalan number.

• Example: For N=3, the number of structurally unique BSTs is 5.
Answered by AI
Add your answer
Q2. 
Subsequences of String Problem Statement
You are provided with a string 'STR' that consists of lowercase English letters ranging from 'a' to 'z'. Your task is to determine all non-empty possible subsequen...read more
Ans. 
Generate all possible subsequences of a given string.
• Use recursion to generate all possible subsequences by including or excluding each character in the string.

• Maintain a current index to keep track of the characters being considered.

• Append the current character to each subsequence generated so far.

• Recursively call the function with the next index to include or exclude the next character.

• Base case: When the current ind...read more
Answered by AI
Add your answer

Round duration - 60 Minutes
Round difficulty - Easy

HIRING MANAGER ROUND

Discussion about the organisation now questions

Round duration - 150 Minutes
Round difficulty - Medium

3 coding questions and 20 mcq's

Q1. 
Maximum Sum of Two Non-Overlapping Subarrays
Given an integer array ARR and a positive integer K, your task is to determine two non-overlapping subarrays of length K that yield the maximum combined sum.
...read more
Ans. 
The task is to find two non-overlapping subarrays of length K in an array, such that their sum is maximum.
• Iterate through the array and calculate the sum of each subarray of length K

• Store the maximum sum obtained from the first subarray

• Iterate again and calculate the sum of each subarray of length K, excluding the previous subarray

• Store the maximum sum obtained from the second subarray

• Return the sum of the two maximum
Answered by AI
Add your answer
Q2. 
Distinct Subsequences Problem Statement
You are given a string 'S' of length 'N' which may include duplicate alphabets. Your goal is to calculate the number of distinct subsequences in the string.
Exampl...read more
Ans. 
The task is to find the count of distinct subsequences in a given string.
• Use dynamic programming to solve the problem.

• Create a 2D array to store the count of distinct subsequences for each prefix of the string.

• Initialize the first row of the array with 1, as there is only one subsequence of an empty string.

• For each character in the string, calculate the count of distinct subsequences by considering two cases: including...read more
Answered by AI
Add your answer
Q3. 
Array Intersection Problem Statement
Given two integer arrays/ lists ARR1 and ARR2 of sizes N and M respectively, you are required to determine their intersection. An intersection is defined as the set of...read more
Ans. 
The task is to find the intersection of two integer arrays/lists.
• Read the number of test cases

• For each test case, read the size and elements of the first array/list

• Read the size and elements of the second array/list

• Find the intersection of the two arrays/lists

• Print the intersection elements in the order they appear in the first array/list
Answered by AI
View 2 more answers

Round duration - 120 Minutes
Round difficulty - Medium

Online video call based round, Timing was 10-11 AM
Interview started with basic greetings, post that i explained by projects in brief and then we jumped right into dsa questoins.

Q1. 
Number of Islands Problem Statement
You are given a non-empty grid that consists of only 0s and 1s. Your task is to determine the number of islands in this grid.
An island is defined as a group of 1s (re...read more
Ans. 
The task is to find the number of islands in a grid consisting of 0s and 1s.
• An island is a group of 1s connected horizontally, vertically, or diagonally

• The grid is surrounded by 0s on all four edges

• Use a depth-first search (DFS) or breadth-first search (BFS) algorithm to traverse the grid and count the number of islands

• Initialize a visited array to keep track of visited cells

• For each unvisited cell with a value of 1, p...read more
Answered by AI
Add your answer
Q2. 
Arrangement Problem Statement
Determine the number of permutations of list A = [1, 2, ..., N] such that for every index i, either A[i] is divisible by i or i is divisible by A[i].
Input:
The input start...read more
Ans. 
The goal is to find the number of permutations of a list satisfying certain conditions.
• Iterate through all permutations of the list

• Check if each permutation satisfies the given conditions

• Count the number of permutations that satisfy the conditions

• Return the count for each test case
Answered by AI
Add your answer
Q3. 
Idempotent Matrix Verification
Determine if a given N * N matrix is an idempotent matrix. A matrix is considered idempotent if it satisfies the following condition:
M * M = M
Input:
The first line cont...read more
Ans. 
An idempotent matrix is a square matrix that remains unchanged when multiplied by itself.
• Check if the given matrix satisfies the property M*M = M

• Iterate through each element of the matrix and perform the matrix multiplication

• Compare the result with the original matrix

• If they are equal, return true; otherwise, return false
Answered by AI
Add your answer

Round duration - 120 Minutes
Round difficulty - Easy

This was EM round, started with me explaining my projects in deep and facing some counter questions on that, proceeded to os, dbms basic questions and some low level designing and lastly a puzzle to end interview.

Q1. Can you design an attendance management system?
Ans. 
Design attendance management system
• Create a database to store employee information

• Implement a user interface for employees to mark their attendance

• Develop a system to track and record attendance data

• Generate reports and analytics based on attendance data
Answered by AI
Add your answer

Round duration - 20 Minutes
Round difficulty - Easy

This was formality round, HR came and explained what meesho does and told my joining dates and compensation details.

2 medium - question 1 array and 1 dp
1 med to hard - dynamic programming

Q1. System design LLD - Polling System
Add your answer
Q2. How to implement Concurrency in it.
Ans. 
Concurrency in software development allows multiple tasks to run simultaneously, improving performance and responsiveness.
• Use multithreading to execute multiple tasks concurrently

• Implement asynchronous programming to handle tasks that may take longer to complete

• Use synchronization techniques like locks and semaphores to manage access to shared resources

• Consider using thread pools to manage and reuse threads efficiently
Answered by AI
Add your answer

3 Medium level dsa questions

Q1. Lld of cab booking system
Ans. 
The Low Level Design (LLD) of a cab booking system involves detailing the system architecture and components at a lower level of abstraction.
• Identify the main components of the system such as user interface, booking engine, payment gateway, and driver allocation algorithm.

• Define the interactions between these components and how data flows between them.

• Specify the data structures and algorithms used for efficient bookin...read more
Answered by AI
Add your answer
Q2. Discussion about online assesment
Add your answer

3 coding question
2 medium 1 hard

Q1. Online polling system based on OOPs
Add your answer
Q2. Explaining the above code
Add your answer

HAckerrank based test

There were 2 questions.
1. Knapsack
2. Median in an array

Q1. LLD(machine coding) of Google meet
Add your answer

Q1. In depth discussion on my projects and resume
Add your answer