Company OAsDSA SheetAll ProblemsPlacement DataInterview ExperiencesPremium
OAHelper

Built by students, for students — practice company-specific OAs, DSA sheets, and real interview experiences to land your dream role.

© 2026 OAHelper.in·Terms·Privacy·Refunds·Trust & Safety·Contact·
Ready to crack your next OA?

Practice company-specific questions trusted by thousands of students across India.

Start PracticingGo Premium
OA Practice·DSA·Placements

Disclaimer: OAHelper is an independent educational platform. We (oahelper.in) do not own the images or questions shown. Content is uploaded by users.

Z

Zomato

FTE (Software Development Engineer)

Interview Date

Aug-Dec 2023

Result

Hired

Difficulty

Medium-Hard

Rounds

3 rounds (after Online Assessment)

Drive Type

On-Campus, Full-Time

Topics asked

Data StructuresAlgorithms (Bit manipulationData Stream & ParsingBinary SearchDijkstra AlgorithmDFSBFS on gridMerge Sort)CryptographyCybersecurity (password hashing)ProjectsOSDBMSComputer NetworksCompilersSystem DesignCerrorsShuffling playlist

Detailed experience

Role: FTE (Software Development Engineer)

College: IIT (Not Specified)

Interview Date: Aug-Dec 2023

Interview Type: On-Campus, Full-Time

Result: Hired

Difficulty: Medium-Hard

Rounds: 3 rounds (after Online Assessment)

Topics Asked: Data Structures, Algorithms (Bit manipulation, Data Stream & Parsing, Binary Search, Dijkstra Algorithm, DFS/BFS on grid, Merge Sort), Cryptography, Cybersecurity (password hashing), Projects, OS, DBMS, Computer Networks, Compilers, System Design, C++ errors, Shuffling playlist

Experience:

This on-campus experience at an IIT for an FTE role in 2023 involved an initial shortlisting, an online assessment, and three interview rounds, ultimately leading to a successful hire.

Initial Shortlisting: Around 500 candidates were initially considered, with 164 shortlisted based on resumes, past internships, projects, and Competitive Programming (CP) scores.

Online Assessment (90 minutes): The online test consisted of three coding questions: one easy (related to Data Stream and Parsing), one medium (related to binary search), and one hard (on Dijkstra Algorithm). The candidate solved the easy question completely and partially solved the other two. 18 candidates were shortlisted for the final interview rounds.

Interview Round 1 (30 minutes): After a self-introduction, an ice-breaker question related to bit manipulation was asked. The interviewer then delved into the candidate's interest in cryptography and cybersecurity, asking basic questions about password hashing and a problem to decode a hashed string based on specific rules. The optimal approach was explained and coded on paper. A project explanation followed, and the candidate was asked to choose a tech topic to discuss and how they stay updated with tech trends.

Interview Round 2 (Technical - 45 minutes): This round began with a discussion of two projects, covering their logic, modules, and scalability. A DSA problem similar to "finding the number of islands" (using DFS/BFS on a grid) was posed, requiring discussion of time/space complexity, alternative approaches, and coding two solutions. Questions on C++ errors and Operating Systems were also asked. A problem on shuffling a playlist (playing each song once randomly) and implementing a "previous song" function (using maps/swapping) was discussed and the SHUFFLE function was coded.

Interview Round 3 (HR Round - 15 minutes): This was largely a formality round. The candidate was informed of their selection immediately after Round 2. The HR and a senior developer provided insights into Zomato's work culture. All three candidates who reached this stage were hired.

Preparation Tips: Strong knowledge of Data Structures & Algorithms, OS, DBMS, Computer Networks, Compilers, and System Design (with primary focus on OS and System Design) is crucial. Projects should be thoroughly understood and any point on the resume should be carefully crafted. Maintaining calmness and confidence during the interview process is also advised.

Submitted anonymously13 NOVEMBER 2025