udaan.com interview experience Real time questions & tips from candidates to crack your interview
SDE - Intern
udaan.com
2 rounds | 2 Coding
problems
Selected Interview preparation journey
Journey
In the last 6 months of on-campus processes, I gave more than 25-30 OAs and appeared for 7 interviews but unfortunately had no success. I then started looking for off-campus opportunities and eventually received this offer through a referral.
Application story
I reached out to one of the managers in the company and asked if there were any openings available. After two weeks, I received a call informing me that I would have two rounds of interviews: Round 1 -> DSA technical round, and Round 2 -> Hiring Manager round.
Why selected/rejected for the role?
Yes, I received the offer. Both of my rounds went well, and I was able to solve the DSA and design problems efficiently.
Preparation
Duration: 12 months
Topics: Data Structures, Algorithms, System Design, Backend Development
Tip 1: Have a strong command of DS topics, such as Graphs and related algorithms like Shortest Path Algorithms.
Tip 2: Acquire basic system design knowledge of common examples, such as the Ticket Booking System.
Application process
Where: Referral
Eligibility: No criteria (Salary: 37.5 LPA)
Tip 1: Showcase past internship experiences.
Tip 2: Have some impressive Full Stack projects.
Interview rounds
01
Round
Hard
Video Call
Duration60 minutes
Interview date2 Jan 2025
Coding problem1
It happened during the day (3 PM) on a Google Meet. I was asked to write the code on an online IDE.
1. Shortest Path In A Binary Maze
Moderate
30m average time
75% success
0/80
Asked in companies
Given a maze in the form of a binary rectangular matrix of size M*N, where each element can either be 0 or 1, the task is to find the length of the shortest path in a maze from a given source cell to a destination cell.
The path can only be created out of a cell if its value is 1 and at any given moment, we can only move one step in one of the four directions. The valid moves are:
Up: (x, y) -> (x - 1, y)
Left: (x, y) -> (x, y - 1)
Down: (x, y) -> (x + 1, y)
Right: (x, y) -> (x, y + 1)
If there is no path from a given source cell to a destination cell, return -1.
For example :
consider the binary matrix below. If source = (0, 0) and destination = (3, 4), the shortest path from source to destination has length 11.
Problem approach
- Initially, we return the path in the matrix, which is easy using the multisource BFS algorithm.
- To solve the modified problem, we used the same algorithm inside a binary search function, where I tried to maximize the distance from the monster.
02
Round
Medium
Video Call
Duration60 minutes
Interview date4 Jan 2025
Coding problem1
Online round on Google Meet around 3 PM.
1. System Design
I was asked about the design of the Ticket Booking System: BookMyShow.
Problem approach
Watch YouTube videos for similar ticket booking systems and their designs.
Here's your problem of the day 
Solving this problem will increase your chance to get selected in this company
Skill covered: Programming
How do you remove whitespace from the start of a string?
Choose another skill to practice
Similar interview experiences
SDE - 1
3 rounds | 7 problems
Interviewed by OYO
Selected 
4898 views
0 comments
0 upvotes
SDE - Intern
2 rounds | 3 problems
Interviewed by Amazon
Rejected
1043 views
0 comments
0 upvotes
SDE - 1
2 rounds | 5 problems
Interviewed by Meesho
Rejected
6638 views
0 comments
0 upvotes
SDE - 1
3 rounds | 9 problems
Interviewed by Salesforce
Selected 3639 views
0 comments
0 upvotes
Companies with similar interview experiences
SDE - Intern
3 rounds | 6 problems
Interviewed by Amazon
Rejected
15605 views
4 comments
0 upvotes
SDE - Intern
4 rounds | 7 problems
Interviewed by Microsoft
Selected 15499 views
1 comments
0 upvotes
SDE - Intern
2 rounds | 4 problems
Interviewed by Amazon
Selected 10216 views
2 comments
0 upvotes