Ola Cabs SDE (Software Development Engineer) Interview Questions and Answers

Q1. Java core, spring boot
Add your answer
Q2. DBMS concepts
Add your answer

Q1. Stack based question Medium Difficulty DSA.
Add your answer
Q2. Theory questions related Java, Spring, OOPs
Add your answer

Q1. Medium-hard DSA question.
Add your answer
Q2. Project related questions
Add your answer
Q3. Design Patterns
Add your answer

Q1. Company fit questions
Add your answer

It was a medium-level DSA round

This was also a DSA round

This again a DSA round

Q1. Can't disclose the question because of NDA signed but it was a design round
Add your answer

Q1. This was a project discussion round
Add your answer

Implement your own state management in React and integrate it into a React application.

Coding conecpt, apti

Q1. Basic dsa, puzzles
Add your answer

Q1. Basic dsa, dbms
Add your answer

Q1. Introduction about yourself and expectation
Add your answer

Q1. IOS questions and architecture question about modularisation. From resume.
Add your answer
Q2. Question Asked about memory management
Add your answer
Q3. Question about modularisation and interface design
Add your answer

Q1. On call interview
Add your answer
Q2. Basic javascript questions and all depends on the team lead for which you are being hired
Add your answer

Round duration - 60 minutes
Round difficulty - Medium

This round was easy for me because this round only has Basic Math, OS, Programming and English Grammar questions.
There were also two easy coding problems.

Q1. 
Prime Numbers within a Range
Given an integer N, determine and print all the prime numbers between 2 and N, inclusive.
Input:
Integer N
Output:
Prime numbers printed on separate lines
Example:
Input...read more
Ans. 
Step 1 : Run a for loop from 2 to N
Step 2 : check each number if it is prime or not
Step 3 : if prime then print
Answered Anonymously
Add your answer
Q2. 
Form a Triangle Problem Statement
You are given an array of integers ARR with a length of N. Your task is to determine whether it's possible to construct at least one non-degenerate triangle using the val...read more
Ans. 
Step 1 : We will Iterate through the array and pivot each element as the first side of the triangle. Let’s say we are at ‘I’ th index, So we will pivot ‘I’th index as our first side of the triangle.
 
Step 2 : And for the second side of the triangle, we will start exploring from the next index of ‘I’ and pivot each element from (I+1) till the end as the second side of the triangle. Let’s say we are at the ‘J’th inde...read more
Answered Anonymously
Add your answer

Round duration - 45 minutes
Round difficulty - Medium

This was interview round where one indiamart senior lead engineer was interviewer. Initially I was nervous but interviewer was very gentle so I was very comfortable at the middle of interview. Interview was based on my resume and some basic problem solving questions.

Q1. 
Remove Character from String Task
Given a string str and a character X, your task is to create a function that removes all occurrences of X from the given string.
If the character X is not found in the s...read more
Ans. 
string remove_duplicate(string str) 
{
   	int v[256];
   	for (int i = 0; i < 256; i++) {
		v[i] = 0;
	}
	string ans = "";
	for (int i = 0; i < str.length(); i++) {
		int asc = int(str[i]);
		if (v[asc] == 0) {
			ans.push_back(str[i]);
			v[asc] = 1;
		}
	}
	return ans;
}
Answered Anonymously
Add your answer