Ola interview experience Real time questions & tips from candidates to crack your interview
SDE - 2
Ola
3 rounds | 3 Coding
problems
Selected Interview preparation journey
Preparation
Duration: 5 months
Topics: Data Structure( Array, String, Linked list, Stack, Queue, Tree, Heap ), Algorithm ( Searching, Sliding Window, Greedy, Dynamic ), OOPS ( Inheritance, Polymorphism, Encapsulation, Abstraction ), High Level System Design ( AWS Solution Architect Associate Certification ), Low Level System Design ( Design patterns - Singleton, Factory, Strategy, Class Diagram, Activity Diagram )
Tip 1 : Practice at least 10 problem on each topic of DS and Algo from easy to hard.
Tip 2 : Cover all the topics with basic operation and with their time complexity.
Tip 3 : Read about System Design approach - it is equally important when you have 2+ year of experience.
Application process
Where: Linkedin
Eligibility: NA
Tip 1 : Have some certification in the resume.
Tip 2 : Mention the proper keyword as per the role you are applying.
Interview rounds
01
Round
Medium
Face to Face
Duration60 minutes
Interview date20 May 2021
Coding problem1
Overall the first round was for 1h. At start interviewer introduced himself and asked for my introduction. After that he directly jumped to coding question. Interviewer was friendly and he gave me suggestion whenever I got stuck somewhere.
1. Maximum Sum Path Of A Binary Tree.
Hard
25m average time
75% success
0/120
Asked in companies
You are given a binary tree having 'n' nodes. Each node of the tree has an integer value.
Your task is to find the maximum possible sum of a simple path between any two nodes (possibly the same) of the given tree.
A simple path is a path between any two nodes of a tree, such that no edge in the path is repeated twice. The sum of a simple path is defined as the summation of all node values in a path.
Problem approach
I used the recursion approach to solve this problem -
int maxSum;
public int maxPathSum(TreeNode root) {
maxSum = -1001;
int sum = maxPathSumUtilRecur(root);
return Math.max(maxSum, sum);
}
public int maxPathSumUtilRecur(TreeNode root) {
if(root == null ) return -1001;
int leftSum = maxPathSumUtilRecur(root.left);
int rightSum = maxPathSumUtilRecur(root.right);
int tempMax = Math.max(leftSum, rightSum);
maxSum = Math.max(maxSum, tempMax);
maxSum = Math.max(maxSum, root.val);
maxSum = Math.max(maxSum, leftSum + root.val + rightSum);
return Math.max( root.val, tempMax + root.val);
}
02
Round
Medium
Face to Face
Duration60 minutes
Interview date30 Jun 2021
Coding problem1
This was the system design round - Interview asked to Design LRU Cache and also current project architecture level discussion.
1. System Design Question
Design a data structure that follows the constraints of a Least Recently Used (LRU) cache.
Important - The functions get and put must each run in O(1) average time complexity.
Problem approach
Tip 1 : Solve designing question.
Tip 2 : Have good understanding of data structure basic operations
03
Round
Medium
HR Round
Duration30 minutes
Interview date2 Jul 2021
Coding problem1
This round was regarding the some behavioural question and at last Salary discussion.
1. Basic HR Questions
1. Tell me about yourself.
2. Why are you looking for a change?
3. Tell me about a time when you were worked under stressed and how did you handle it.
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 - 2
5 rounds | 6 problems
Interviewed by Ola
Selected 
0 views
0 comments
0 upvotes
SDE - 2
4 rounds | 5 problems
Interviewed by Ola
Selected 1611 views
0 comments
0 upvotes
SDE - 2
4 rounds | 5 problems
Interviewed by Ola
Selected 0 views
0 comments
0 upvotes
SDE - 2
3 rounds | 3 problems
Interviewed by Ola
Selected 1789 views
0 comments
0 upvotes
Companies with similar interview experiences
SDE - 2
5 rounds | 12 problems
Interviewed by Walmart
Selected 29892 views
8 comments
0 upvotes
SDE - 2
3 rounds | 5 problems
Interviewed by Amazon
Rejected
6765 views
1 comments
0 upvotes
SDE - 2
6 rounds | 8 problems
Interviewed by Amazon
Selected 5280 views
0 comments
0 upvotes