Zomato Software Development Engineer Interview Questions and Answers

Q1. Create an application like Spotify where playlists is recommended based some data.
Add your answer

1.5 hours long, platform was hackerearth.

Q1. Reverse a Linked List
Ans. 
Reverse a linked list by changing the pointers direction.
• Start with three pointers: current, previous, and next.

• Iterate through the linked list, updating the pointers to reverse the direction.

• Update the head pointer to the last node to complete the reversal.
Answered by AI
Add your answer

This round consisted of 30 questions which were to be solved in 60 mins. It comprises of three sections each consisting of 10 questions.

Q1. Second round was one to one technical interview. It went for a hour and I was asked to solve 4 coding questions on the code editor by sharing my screen. The difficulty level was from easy to medium and one...read more
Add your answer
Q2. Find a palindrome, longest possible palindrome, find remainder without using modulus operator
Ans. 
Answering questions on finding palindromes and remainders without modulus operator.
• To find a palindrome, compare the first and last characters of the string and move towards the center until they meet or the string is not a palindrome.

• To find the longest palindrome, iterate through all possible substrings and check if they are palindromes.

• To find remainder without modulus operator, use repeated subtraction until the di
Answered by AI
Add your answer

Q1. This round was also one to one technical interview. I was asked to solve a question based on strings and maps and were given 30 minutes.
Add your answer

Q1. This round was a technical+HR round. This was taken by one of the founder of company. This round was to test my general understanding of technology and was the toughest one.
Add your answer

Q1. Basic HR questions. Went for 10 minutes.
Add your answer

Q1. You are given a stream of numbers need to find the median at any point asked based on input
Add your answer
Q2. Need to find the nearest K integers in a Binary search Tree
Ans. 
Find the nearest K integers in a Binary Search Tree
• Perform an in-order traversal of the BST to get a sorted list of integers

• Use a priority queue to keep track of the K nearest integers

• Compare the absolute difference between the target integer and each node value to determine the nearest integers
Answered by AI
Add your answer

Q1. My previous project Experience
Ans. 
I have experience working on a project to develop a mobile application for tracking fitness goals.
• Developed user interface for inputting and tracking fitness data

• Integrated with wearable devices to automatically sync data

• Implemented gamification features to motivate users to achieve their goals
Answered by AI
Add your answer
Q2. Follow up question on Optimising the project
Add your answer