Zomato SDE interview experience - 56 LPA (onCampus - FTE)

zomato logo
zomato
SDE Full-timeOn-campus
August 5, 20257 reads

Summary

I interviewed for an SDE Full-time role at Zomato on-campus. The process included an online assessment and an interview focused on backend concepts and three DSA questions. I was rejected after the first interview round, despite solving most questions.

Full Experience

I am from tier-1 NIT college and recently Zomato has visited our campus for sde full time roles. Below is the detail about my process:-

  • Online assessment - All students having CGPA of >= 8.0 were selected for it.
  • If you want to know about detail OA I can give you link for the leetcode discuss just comment it.
  • Out of all eligible students 18 students were selected for first round of interview and I was one of them.
  • Interview:-
  • Interviewer was IITian having lots of experience as he began his intro and then I quickly introduced myself.
  • Roughly half an was about my backend concepts as my resume includes all backend concepts. So you can expect 30 minutes resumes based questions.
  • Then, they asked three DSA questions. First one based on concept of B+ Tree, he went deep into B+ tree asked me complexity of insertion, and questions like what will happen If I increase the order of the node (i.e k). Then Why we are not storing sorted keys on just single array instead of B+ tree and many more questions.
  • Second Questions was modification of Deleting a node from BST having two children.
  • Last Questions was based on graph+DP concept. This are little bit harder. If you want full details of questions you can comment below. I was able to all questions but in last questions I stuck in between and then able to solve the questions by taking hints from the interviewer.

I was not selected for further round. I don't know the exact reason behind that but I think they want 100% accuracy from candidate in all 3 DSA question they asked me. If you know anything that could be the reason for my rejection you can comment it.

Result-> ❌ Rejected!

Interview Questions (2)

Q1
B+ Tree Concepts and Design Questions
Data Structures & Algorithms

The interviewer went deep into B+ Tree concepts, asking about the complexity of insertion, what happens if the order of the node (k) is increased, and why B+ Trees are preferred over a single sorted array for storing keys.

Q2
Modified Delete Node from BST with Two Children
Data Structures & Algorithms

A modification of the standard problem of deleting a node from a Binary Search Tree (BST) that has two children.

Discussion (0)

Share your thoughts and ask questions

Join the Discussion

Sign in with Google to share your thoughts and ask questions

No comments yet

Be the first to share your thoughts and start the discussion!