OLA Interview Experience | Set 12
Last Updated : 14 Aug, 2024
Round 1:
Hackerearth online coding round.
Round 2: (1 hrs 15 minutes)
Left View of a binary tree
Explain Binary search and it’s complexity.
How does a hash map work? What is the difference between a hash map and an array?
Given an acyclic graph and a function f(x) that return the best path between two nodes. Find a function g(x) that returns the second best path.
Follow up: What if the graph is cyclic?
ACID properties of Database.
Given a graph with different edge weights. Create a new edge in the graph between the given nodes such that this is the best path between these nodes.
Given a dictionary of words and a string pattern. Output the count of words that match the string pattern in the dictionary.
Eg. Dictionary: [cat, rat, mat, apple, boy, bat]
String pattern: ?at
Output: 4 (because cat, rat, mat, bat matches the string pattern)
The interviewer asked me to dry run all of my codes. Also, you must know how to write code on paper.
Round 3: (1 hrs 30 minutes)
A T20 match is going on. You’re in Team B. First innings is over, they have scored “teamARuns” runs. Your team has scored “teamBRuns” runs at the end of “balls” balls. A ball can have multiple possibilities like [0, 1, 2, 3, 4, 5, 6, Wicket, No ball, Wide ball]. What is the probability that your team (Team B) will win?
I was asked to write the code for this as well once I had explained my approach.
I wrote a recursive code for this one. He then asked me to improve the time complexity. So I used DP to memoize the solution to sub problems.
Given two customers – C1 & C2 and two restaurants – R1 & R2. You’re a delivery boy and travel at constant speed. Your distance from each of them is given. R1 takes t1 time and R2 takes t2 time to prepare the food. What will be your trajectory so as to get food to both customers in minimum time. I was asked to consider all the test cases and explain them.
What would happen if in a certain situation, we were at an equal distance from both the destinations. How would you decide which route to take next.
The interviewer was checking how I will approach the questions and whether I can write decent code or not. He mainly wanted to see how many corner cases could I cover int the second question.
Round 4: (1 hour)
This round was with the Director of Engineering.
It started with a normal discussion about my college and my present company.
What are the technologies you’re working on currently.
Discussion about my current projects.
Spiral traversal of a binary tree
Given a string “s” and another string “patt”. Find the character in “patt” that is present at the minimum index in s. I was asked to optimise my solution to use minimum time and space possible.
I was asked to write the codes on a white board and explain them for edge cases.
Why do I want to leave my present company?
Similar Reads
Ola Interview Experience
I was part of a recruitment drive in Ola's headquarters in Bangalore. The first row was a Hackerrank test which consisted of a DS question, a SQL statement and a small script to consume a RESTful API. Those who cleared this round proceeded for the face to face interviews. Round 1 1. Given an array a
3 min read
PayPal Interview Experience SE 2
I got the opportunity to attend the interview through one of my closest friends' referral for a vacant position in his team. Round 1(1 hour): This was a DS and Algorithms round conducted by one of the SDE3s. Remove nth duplicate element from the given linked list. Eg: 1 -> 2 -> 3 -> 1 ->
2 min read
MphRx Interview Experience | Set 2
Round-1(Telephonic) 1. What are immutable classes? 2. How to make any class immutable? 3. How will you find the intersection of two lists/arrays in most optimized way?(I have given the solution to do it in O(n) time) 4. What is the difference between binary search and elastic search? 5. Project disc
2 min read
Ola Interview Experience | Set 13 (For SDE 2)
Round 1:- Hacker Rank [online test] Question 1 :- count the path in the 2d Matrix, only right and down move is allowed. Slight change is 1, 0 is there in the matrix. 0 means no path and 1 means path. Question 2 :- Count the number of the cavity in the 2d matrix and mark it to X, a cavity is defined
2 min read
OLA Interview Experience | Set 6 (For SDE-1)
Last month i was interviewed by Ola for SDE 1 post. Here is my experience. Round 1 a. Inorder predecessor and successor for a given key in BST - b. String matching where one string contains wildcard characters Round 2 a. A Boolean Matrix Question b. Print Left View of a Binary Tree c. Find the numbe
1 min read
OLA Interview Experience | Set 7 (For SDE-1)
I was recently interviewed by OLA, I could not make it after the last round. All rounds I had were telephonic, in the last round I was asked to code on collabedit. Round 1 (around 35 min): 1. Given a matrix containing 0's and 1's. Find all the rows which are having 1's at same position. Give all set
3 min read
OYO Room Interview Experience | SDE-1
Recently, I was interviewed for an on-site role in OYO Rooms. Finally, I got selected for a Summer Long Internship role. The interview experience was quite comfortable and smooth. The company mostly conducts 1 online coding round and 2–3 back to back PI rounds and all of them mainly focus on technic
2 min read
Intuit Interview Experience | Set 6
Experience - 1.8years Round-1:(Technical-1:10 min) 1. Introduce yourself. 2. Deep discussion on the current project which I'm working on.(project high level architecture, questions on design, frameworks used etc.,) 3. Write a clean code to find the median of incoming stream of integers(I started wit
3 min read
Paytm Interview Experience 2018
Round 1: Coding Round 2 coding questions both from strings : To find no of distinct years from the given paragraph.(paragraph consists of 2 or more dates in dd-mm-yyyy format) To reverse a sentence and check whether the reversed string is equal to the original one.(do not remember the question exact
1 min read
Paytm Interview Experience
Preparation:I prepared rigorously for this interview over two months. My preparation included studying Data Structures, Algorithms, Object-Oriented Programming concepts, and System Design principles, and practicing coding problems on platforms like LeetCode and GeeksforGeeks. Interview Rounds:Techni
2 min read