Home/Experiences/Zomato/Single round: LeetCode-hard array DSA, progressively harder SQL, and DBMS/CN theory (indexing, B+ trees, OSI)
Zomato·SDE 1 · junior
Rejected

Single round: LeetCode-hard array DSA, progressively harder SQL, and DBMS/CN theory (indexing, B+ trees, OSI)

Jul 20250by Anonymous

Application

I applied through an employee referral. The process took 1 day. I interviewed at Zomato in May 2025

Interview

Round 1. - Leetcode hard DSA question from Array. (Present in Striver SDE sheet) - Bunch of SQL questions progressively getting tougher. (Leetcode SQL medium level) - Few questions on DBMS and CN. (Types of keys, B+ trees, Indexing, OSI model)

Interview questions [1]

Question 1

How does indexing work for simple keys and composite keys?

The loop · 1 round

technical

LC-hard array DSA + progressive SQL + DBMS/CN theory

Shared Jul 2026
LeaderboardSalary
Language
Account