SDE - Intern
Zomato
3 rounds | 5 Coding problems
0 views
Interview preparation journey
Preparation
Duration: 6 months
Topics: Data Structures, Pointers, OOPS, System Design, Algorithms, Dynamic Programming, java, OS
Tip

Tip 1 - Practice Atleast 250 Questions from geeks from geeks and coding ninjas
Tip 2 - Ex- Do atleast 2 good projects

Application process
Where: Campus
Eligibility: Above 7 CGPA
Resume tip

Tip 1 : Have some projects on resume.
Tip 2 : Do not put false things on resume and be confident.

Interview rounds
01
Round
Medium
Online Coding Test
Duration60 minutes
Interview date2 Nov 2021
Problems2
Unique Paths II

#### Given a ‘N’ * ’M’ maze with obstacles, count and return the...

view more
Problem approach

The most efficient solution to this problem can be achieved using dynamic programming. Like every dynamic problem concept, we will not recompute the subproblems. A temporary 2D matrix will be constructed and value will be stored using the top-down approach.

Allocate Books

#### You are the Librarian of the Ninja library. There are ‘N’ books available in the library and ‘B’ ...

view more
Problem approach

The idea is to use Binary Search. We fix a value for the number of pages as mid of current minimum and maximum. We initialize minimum and maximum as 0 and sum-of-all-pages respectively. If a current mid can be a solution, then we search on the lower half, else we search in higher half.

02
Round
Easy
Face to Face
Duration60 minutes
Interview date4 Nov 2021
Problems2
Partition String

#### Given a string S of lowercase English letters, your task is to partition the list in as many parts as possible such that each letter appears in at most one part, an...

view more
Largest rectangle in a histogram

#### You have been given an array/list 'HEIGHTS' of length ‘N. 'HEIGHTS' represents the histogram and each element of 'HEIGHTS' represents the height of the histogram ...

view more
Problem approach

By finding next smaller element and previous smaller element for every element in O(n) time complexity and O(n) auxiliary space .

03
Round
Medium
Face to Face
Duration60 minutes
Interview date19 Nov 2021
Problems1
LRU Cache Implementation

#### Design and implement a data structure for Least Recently Used (LRU) cache to support the following operations:

view more
Problem approach

When a page is referenced, the required page may be in the memory. If it is in the memory, we need to detach the node of the list and bring it to the front of the queue.
If the required page is not in memory, we bring that in memory. In simple words, we add a new node to the front of the queue and update the corresponding node address in the hash. If the queue is full, i.e. all the fra...

view more
Start a Discussion
Similar interview experiences
SDE - Intern
3 rounds | 6 problems
Interviewed by Zomato
1050 views
SDE - Intern
2 rounds | 6 problems
Interviewed by Zomato
0 views
SDE - 1
2 rounds | 0 problems
Interviewed by Zomato
1258 views
SDE - 1
2 rounds | 5 problems
Interviewed by Zomato
0 views
Companies with similar interview experiencs
SDE - Intern
2 rounds | 3 problems
Interviewed by Trilogy Innovations
16753 views