Zomato Software Developer Intern Interview Questions, Process, and Tips for Freshers

Q1. Design parking lot app
Ans. 
A parking lot app to help users find available parking spots and pay for parking.
• Include a map feature to show available parking spots in real-time

• Allow users to reserve parking spots in advance

• Integrate payment options for users to pay for parking

• Provide notifications for parking expiration or availability of nearby spots
Answered by AI
Add your answer
Q2. Design parking lot app for blind people
Ans. 
A parking lot app designed for blind people to easily navigate and find available parking spots.
• Include voice-guided navigation to direct users to available parking spots

• Use sensors to detect empty parking spaces and relay information to the app

• Provide audio alerts for obstacles or other vehicles in the parking lot

• Include a feature for users to easily locate their parked vehicle when returning
Answered by AI
Add your answer

It consists of aptitude and 2 easy coding questions

Q1. Tell about your project
Ans. 
Developed a web application for managing inventory
• Used HTML, CSS, and JavaScript for the frontend

• Implemented a RESTful API using Node.js and Express.js for the backend

• Utilized a PostgreSQL database for storing inventory data

• Implemented authentication and authorization using JSON Web Tokens (JWT)

• Implemented features like adding, updating, and deleting inventory items
Answered by AI
Add your answer
Q2. Some basic SQL question
Add your answer

Round duration - 60 minutes
Round difficulty - Medium

Q1. Add Linked Lists
Given two numbers represented by linked lists. Your task is find the sum list and return the head of the sum list.
The sum list is a linked list representation of addition of two numbers...read more
Ans. Recursive approach
One way is to recursively add the two linked lists. Keep the nodes in the recursion stack and add the last nodes first and then second last and so on. Initially, find the size of both the linked lists. If both the linked lists are of the same size, add them using recursion. Else if their sizes differ, move the head pointer of the larger linked list forward K times, where K is the difference between th...read more
Answered by CodingNinjas
View 1 more answer
Q2. Check if Linked List is Palindrome
You are given a Singly Linked List of integers. You have to find if the given linked list is palindrome or not.
A List is a palindrome if it reads the same from the lef...read more
Ans. Using Stack
The idea is to store the list values in a stack and then compare the values in the list with the values in the stack.
 
Algorithm:
1. Traverse the list from head to tail and push every node in the stack.
2. Make a pointer ‘cur’ which initially points to the head node.
3. If value at ‘cur’ is not equal to the top element of the stack, then the given list is not a palindrome
4. Else, move the ‘cur’ pointer to its next node...read more
Answered by CodingNinjas
View 2 more answers

Round duration - 60 minutes
Round difficulty - Medium

Q1. Square root (decimal)
You have been given two integers 'N' and 'D', Your task is to find the square root of the number 'N' with precision up to 'D' decimal places i.e. the d...read more
Ans. Bruteforce
• We will find the integer part and decimal part of the answer separately.
• First, we will find an integral part.
• We will declare the answer variable where we will store the answer.
• Your answer could be between 1 and N so we will iterate through all the numbers from 1 to N.
  • Let’s say we are currently at number i.
  • If i ^ 2 = N then i is the exact answer so we will return i.
  • If i ^ 2 < N then i could be a possible an...read more
Answered by CodingNinjas
View 1 more answer
Q2. Alien dictionary
You have been given a sorted (lexical order) dictionary of an alien language. Write a function that finds the order of characters in the alien language. This dictionary will be given to yo...read more
Ans. Permutations Approach
Approach:
• Find all the distinct characters present in all the words.
• Generate all permutations of these distinct characters.
• Treat each of the permutations as a correct sequence of alphabets. Now check if the given words are sorted according to this sequence. In order to do this, we will:-
  • For all words from 1 to n - 1, let the current word be ‘currWord’ and the next word be ‘nextWord’.
  • One by one compa...read more
Answered by CodingNinjas
View 1 more answer

Round duration - 90 minutes
Round difficulty - Easy

This round had 2 coding problems and we had to code it on hackerearth only.
The use of Outside IDE was forbidden.
The timing of test was 12:00 PM to 1:30 PM.

Q1. Meeting
Ninja is organizing a meeting in an office that starts at a time ‘0’ and will end at a time ‘LAST’. There are ‘N’ presentations that are going to take place in that meeting whose start and end time...read more
Ans. Brute Force Approach
Algorithm:
 
• The idea here is to find the maximum sum subarray of size ‘K+1’, where the array will contain empty slots.
• First, we create an array named emptySlots[], to store the time duration in which there is no presentation.
• Run a loop to traverse all presentations, and in each iteration, add START[i] - END[i-1] (which gives a free slot between the ith presentation) into the array emptySlots[].
• N...read more
Answered by CodingNinjas
View 1 more answer
Q2. Total Unique Paths
You are present at point ‘A’ which is the top-left cell of an M X N matrix, your destination is point ‘B’, which is the bottom-right cell of the same matrix. Your task is to find the tot...read more
Ans. Recursive Approach
We can easily count the total number of paths by making a recursive algorithm.
 
The steps are as follows:
 
1. We are given a function UNIQUEPATHS(), which takes two integers ‘M’ and ‘N’ as parameters and returns a single integer. This will be the definition of our recursive function too.
2. As our base condition, we will check if our number of rows (‘M’) or a number of columns (‘N’) is equal to 1. If...read more
Answered by CodingNinjas
View 3 more answers

Round duration - 90 minutes
Round difficulty - Medium

This round was coding round with discussion .
The interviewer tried to trick the questions and wanted to test how we respond if something is asked out of preparation.
The code we ran on Google Docs was checked on Online IDE if it ran for sample inputs.
Timing : 12:00 PM to 1:30 PM

Q1. Number of operations to make Graph connected
You have been given a graph consisting of ‘N’ vertices numbered from 1 to ‘N’. The graph has ‘M’ edges. In an operation, you can shift an edge between two direc...read more
Ans. Breadth First Search.
For a graph with ‘N’ vertices to be connected, there must be at least ‘N’ - 1 edges in the graph. If a graph has less than ‘N' - 1 edges it is impossible to make the graph connected. Otherwise, it is always possible to make graph connected. As we need to find the minimum number of operations to make the graph connected we will think greedily. We will find the total number of connected components in...read more
Answered by CodingNinjas
View 1 more answer
Q2. Snake and Ladder
You have been given a Snake and Ladder Board with 'N' rows and 'N' columns with the numbers written from 1 to (N*N) starting from the bottom left of the board, and alternat...read more
Ans. BFS
We will use Breadth-First Search to find the shortest path from cellNumber 1 to cellNumber N*N.
1. We will maintain a queue of cellNumber where the front of the queue will always contain a cell which can be reached by minimum dice throw from starting cell (cellNumber = 1).
2. Create a minDiceThrow array of size N*N initialise it with the maximum value (INT_MAX)
3. Start with pushing cellNumber 1 and updating minDiceThrow[1] = 0...read more
Answered by CodingNinjas
Add your answer

Round duration - 75 minutes
Round difficulty - Hard

This was a problem solving round and lasted for 75 minutes. The interviewer gave me a very complicated question.
The round was held on Google Meet and I was supposed to tell him the approach and write code on shared Google Docs.

Q1. XOR Query
Assume you initially have an empty array say ‘ARR’.
You need to return the updated array provided that some ‘Q’ number of queries were performed on this array.
The queries are of two types:
...read more
Ans. Brute Force
Approach:
• It is a brute force approach where we will create an empty array initially of size 10^5 + 1.
• Now, whenever we have a query of type 1 we will insert the value of VAL in the array. And when the query of type 2 comes then we will iterate through our array and perform an XOR operation with VAL to every value present in our array.
• Finally, we will return our array.
 
Algorithm:
• Create an array ans.
• Now it...read more
Answered by CodingNinjas
View 2 more answers