GFG App
Open App
Browser
Continue

# Zomato Interview Experience (1+ Year Experienced)

I applied for the SDE1 backend position. The overall interview experience was quite smooth and the interviewers were very kind.

Round 1: I was asked 2 coding questions.

• Maximum rectangular histogram area (Stack)
• Given a binary matrix, you can move up, left, down, and right. You have to convert every adjacent 0 of 1 to 1 in a minimum number of steps. Provide the number of steps to take.

Round 2 by Technical Lead Development: 3 coding questions were asked and 1 on system design.

1. Given two arrays, where if a value is present in both the array, you can switch b/w arrays, find the maximum sum.

Input: ar1[] = {2, 3, 7, 10, 12, 15, 30, 34} ar2[] = {1, 5, 7, 8, 10, 15, 16, 17}

Output: 122.

In the above input, since both arrays contain 7, at 7, you can switch from ar1- > ar2 and vice versa. Expectation: O(n) time and O(1) space

2. Given a sorted array of size n, depict whether an element having a frequency greater than n/2. If it doesn’t exist, give an indication. Expectation: O(log n) time

3. There are conversions with values given. You will be given input as 2 conversion metrics and you need to find the conversion value between the two.

Example:

“m” to “dm” is 10, “cm” to “m” is 100 and so on.

Input: from, to (“cm”, “dm”)

Output: value (1000)

My solution: Use a directed graph where 1 side edge weight is x and another side is 1/x. Do a BFS or DFS and multiply the edge weights of that path.

4. Design bitly: Bitly is a tinyurl service. Some cross-questioning was done. I referred to the channel named “coding simplified” on YouTube. It was quite helpful.

Result: Selected

My Personal Notes arrow_drop_up