Ola interview experience Real time questions & tips from candidates to crack your interview

SDE

Ola
upvote
share-icon
2 rounds | 6 Coding problems

Interview preparation journey

expand-icon
Preparation
Duration: 2 months
Topics: OOPS, JAVA, C Programming, Aptitude, Reasoning
Tip
Tip

Tip 1 : Give mock interiviews.
Tip 2 : Practice by RS aggarwal

Application process
Where: Naukri
Eligibility: No criteria
Resume Tip
Resume tip

Tip 1 : Add Keywords from the Job Posting
Tip 2 : Don’t Forget the Cover Letter

Interview rounds

01
Round
Medium
Online Coding Interview
Duration90 minutes
Interview date1 Jul 2021
Coding problem5

- Morning time
- Environment was good.
- No
- Interviewer was not soo good

1. DBMS Question

Ques- 
Assume a relation X (M, N, O, P, Q) that has the following functional dependencies:

MNO -> PQ and
P -> MN

The total number of superkeys of X would be:

Problem approach

Tip 1 : Practice DBMS Questions
Answer : Answer is 10

2. Count Triplets

Easy
15m average time
85% success
0/40
Asked in companies
AmazonPayPalDunzo

You have been given an integer ‘X’ and a non-decreasing sorted doubly linked list with distinct nodes.

Your task is to return the number of triplets in the list that sum up to the value ‘X’.

Problem approach

Step 1 -> In the first test case, we have . The 2 triples 

Step 2 ->In the second test case, we have . The 5 triples

Step 3 -> In both above samples, it is easy to verify that all 3 conditions hold and there are no other triples satisfying the conditions.

Try solving now

3. Ninja And His Exam

Easy
15m average time
90% success
0/40
Asked in company
Ola

Ninja has an exam tomorrow. He has not studied well for it. So, he decided to get only the passing marks. Ninja knows that the exam will consist of three types of questions, having marks 2, 5 and 7 respectively. He needs to find the number of ways he can achieve passing marks in the exam by attempting those questions. He asked you to help him with this as he is busy preparing. So, you need to find out the number of ways he can score the passing marks.

Example :
Let us suppose the passing marks is: 10
So, the number of ways Ninja can score 10 marks are (2, 2, 2, 2, 2) and (5, 5), so you need to print 2.
Note :
Keep in mind that a particular test has infinite questions of each type.
Keep in mind that the ninja does not want more than the passing marks.
Please note that (2, 5) and (5, 2) are the same and you need to take them as a single way.
Problem approach

s1 - Order should be [2,1,3,4,5], initially cutoff is zero.

s2 - Second student has more marks than cutoff, he will pass and cutoff will now be one as bound for second student is 1.

s3 - First student has marks equal to cutoff, he will also pass and cutoff will be 1+3=4.

s4 -Third student has marks equal to cutoff , he will also pass and cutoff will be 4+7=11.

s5 - Now fourth and fifth students will fail because both of them have marks less than 11.

Try solving now

4. Count Substrings With K Ones

Moderate
23m average time
0/80
Asked in companies
OlaMedia.netAmazon

You are given a binary array 'arr' of length 'N' and an integer 'k'. Return the number of subarrays having the count of 1's equal to ‘k’.


Example :
Let the array 'arr' be: [1, 0, 1].
Let ‘k’ be: 1

Then the subarrays having the number of ones equal to ‘k’ will be: [1], [1,0], [0,1], [1].
Problem approach

step 1 - First Test Case: String 2 and 3 have character 0 in common

step 2 - Second test case: All strings have 1 in common so answer is number of pairs, which is 10

Try solving now

5. Good Arrays

Moderate
20m average time
85% success
0/80
Asked in companies
AdobeOlaCapegemini Consulting India Private Limited

You are given an array ‘A’ of length ‘N’, you have to choose an element from any index in this array and delete it. After deleting the element you will get a new array of length ‘N’-1. Your task is to find the number of such arrays of length ‘N’-1 which are good.

Note :

An array is called good if the sum of elements in odd indexes is equal to the sum of elements in even indexes.

For Example :

In array A= [1 2 4 3 6], if we delete A[4]=6, we will get new array B= [1 2 4 3], where B[0] + B[2] = B[1] + B[3] = 5, which means array B is good.
Problem approach

s1 - According to the defination: 1 should have exactly one or zero occurence, 2 should have two or zero occurences and 3 should have three or zero occurences.

s2 - So for three, we have two options, either we remove both occurences or add one occurence, it will be optimal to add one occurence.

Try solving now
02
Round
Medium
HR Round
Duration20 minutes
Interview date12 Jan 2022
Coding problem1

- Morning time
- Environment was good.
- No
- Interviewer was moody

1. Basic HR Questions

1 - Tell me about yourself. 

2- Why are you leaving your current job? 

3- Why are you interested in this position? 

4- Why do you want to work here? 

5- What are you passionate about? 

6- Where do you see yourself in five, 10 and 15 years?

Problem approach

Tip 1 : Practice by online sites 
Tip 2 : Refer reading books
Tip 3 : Speak in front of others

I approach because daily i speak English at home

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
company logo
SDE - 1
4 rounds | 5 problems
Interviewed by Ola
1703 views
0 comments
0 upvotes
company logo
SDE - 2
4 rounds | 5 problems
Interviewed by Ola
1611 views
0 comments
0 upvotes
company logo
SDE
2 rounds | 6 problems
Interviewed by Ola
1284 views
0 comments
0 upvotes
company logo
SDE-3
3 rounds | 6 problems
Interviewed by Ola
1268 views
0 comments
0 upvotes
Companies with similar interview experiences
company logo
SDE
3 rounds | 6 problems
Interviewed by PhonePe
0 views
0 comments
0 upvotes
company logo
SDE
5 rounds | 8 problems
Interviewed by Mathworks
1222 views
0 comments
0 upvotes
company logo
SDE
4 rounds | 7 problems
Interviewed by PhonePe
0 views
0 comments
0 upvotes