AmbitionBox
Interview Questions
- Reviews
- Salaries
- Interview Questions
- About Company
- Benefits
- Jobs
- Office Photos
- Community
Add office photos
Filter interviews by
Ola Cabs SDE-2 Interview Questions and Answers
7 Interview questions
Find sum of least closest element to left and highest element to right for each element of an array
Iterate through array and find least closest element to left and highest element to right for each element
Calculate sum of these two elements for each element
Return array of sums
Different types of joins in SQL and calculating average of values from a table.
Types of joins: INNER JOIN, LEFT JOIN, RIGHT JOIN, FULL JOIN
To calculate average: Use AVG() function in SQL
Example: SELECT AVG(column_name) FROM table_name
Job Sequencing Problem Statement
You are provided with a N x 2 2-D array called Jobs consisting of N jobs. In this array, Jobs[i][0] represents the deadline of the i-th job, while Jobs[i][1] indicates the ...
Maximize profit by scheduling jobs within their deadlines.
Sort the jobs based on their profits in descending order.
Iterate through the sorted jobs and schedule them based on their deadlines.
Keep track of the maximum profit achievable by scheduling jobs within their deadlines.
Partition Equal Subset Sum Problem
Given an array ARR consisting of 'N' positive integers, determine if it is possible to partition the array into two subsets such that the sum of the elements in both subs...
The problem is to determine if it is possible to partition an array into two subsets with equal sum.
Use dynamic programming to solve this problem efficiently.
Create a 2D array to store the subset sum possibilities.
Check if the total sum of the array is even before attempting to partition.
Iterate through the array and update the subset sum array accordingly.
Return true if the subset sum array contains a sum equal t...
Find Distinct Palindromic Substrings
Given a string 'S', identify and print all distinct palindromic substrings within it. A palindrome reads the same forwards and backwards. For example, 'bccb' is a palin...
Given a string, find and print all distinct palindromic substrings within it.
Iterate through all possible substrings of the input string
Check if each substring is a palindrome
Store distinct palindromic substrings in a set and then sort them before printing
Print Permutations - String Problem Statement
Given an input string 'S', you are tasked with finding and returning all possible permutations of the input string.
Input:
The first and only line of input c...
Return all possible permutations of a given input string.
Use recursion to generate all possible permutations of the input string.
Swap characters at different positions to generate permutations.
Handle duplicate characters by skipping swapping if the characters are the same.
Find the Kth Row of Pascal's Triangle Problem Statement
Given a non-negative integer 'K', determine the Kth row of Pascal’s Triangle.
Example:
Input:
K = 2
Output:
1 1
Input:
K = 4
Output:
1 4 6 4...
The task is to find the Kth row of Pascal's Triangle given a non-negative integer K.
Create an array to store the elements of the Kth row of Pascal's Triangle.
Use the formula C(n, k) = C(n-1, k-1) + C(n-1, k) to calculate the elements.
Return the array as the output.
Ola Cabs SDE-2 Interview Experiences
3 interviews found
Anonymous
I appeared for an interview in Jul 2021.
(1 Question)
Round duration - 60 minutes
Round difficulty - Medium
It was a problem solving round where a hackerrank link was given containing 2 questions.
You have to solve them within 90 minutes.
I was asked to solve it within a week.
- Q1.
Find Distinct Palindromic Substrings
Given a string 'S', identify and print all distinct palindromic substrings within it. A palindrome reads the same forwards and backwards. For example, 'bccb' is a pali...
- Ans.
Given a string, find and print all distinct palindromic substrings within it.
Iterate through all possible substrings of the input string
Check if each substring is a palindrome
Store distinct palindromic substrings in a set and then sort them before printing
(2 Questions)
Round duration - 60 minutes
Round difficulty - Easy
2 questions was asked by the interviewer. You have to clearly explain your approach and write a working solution. He even asked me to run on some additional test cases
- Q1.
Job Sequencing Problem Statement
You are provided with a N x 2 2-D array called
Jobsconsisting ofNjobs. In this array,Jobs[i][0]represents the deadline of the i-th job, whileJobs[i][1]indicates the... - Ans.
Maximize profit by scheduling jobs within their deadlines.
Sort the jobs based on their profits in descending order.
Iterate through the sorted jobs and schedule them based on their deadlines.
Keep track of the maximum profit achievable by scheduling jobs within their deadlines.
- Q2.
Partition Equal Subset Sum Problem
Given an array
ARRconsisting of 'N' positive integers, determine if it is possible to partition the array into two subsets such that the sum of the elements in both sub... - Ans.
The problem is to determine if it is possible to partition an array into two subsets with equal sum.
Use dynamic programming to solve this problem efficiently.
Create a 2D array to store the subset sum possibilities.
Check if the total sum of the array is even before attempting to partition.
Iterate through the array and update the subset sum array accordingly.
Return true if the subset sum array contains a sum equal to hal...
Round duration - 60 minutes
Round difficulty - Easy
I was asked 1 system design question. The question was to design an online multiplayer game which can be scaled for more than 10 million users.
The interviewer helped me to collect requirement and also helped me in choosing different low latency protocol to communicate between client and server.
(1 Question)
Round duration - 60 minutes
Round difficulty - Medium
The interviewer asked few sql based questions and asked me to write the solution.
He also gave 1 problem solving question.
- Q1. Can you explain the different types of joins in SQL and how to calculate the average of all values from a given table?
- Ans.
Different types of joins in SQL and calculating average of values from a table.
Types of joins: INNER JOIN, LEFT JOIN, RIGHT JOIN, FULL JOIN
To calculate average: Use AVG() function in SQL
Example: SELECT AVG(column_name) FROM table_name
Interview Preparation Tips
Tip 1 : Prepare Data Structures topic by topic and also solve at least 10 interview questions from each topic. The have a list of excellent questions.
Tip 2 : For system design try to take few questions by yourself and think of what different scenarios can arise considering it as a distributed system. There are multiple topics like Consistent Hashing, Partition tolerance, Availability, Sharing etc which needs special attention. The interviewers will dig them deep and will try to see how much of it you actually understand.
Tip 3 : Also please do focus on LLD. Sometimes they can ask you to write sample code for problems. Try solving 4-5 problems.
Tip 4 : You should do and prepare properly 2 -3 projects and try deploying it. You will face a lot of new challenges which you do not face in normal day to day usage.
Tip 1 : You can go for 1 page resume, though it is not necessary. Mention about your projects, your actual contribution, languages that you have used in that project etc.
Tip 2 : You should always put your academic achievements. Sometimes it gains interviewers attention.
Tip 3 : Make it a little bit colourful rather than plain white.
Skills evaluated in this interview
I appeared for an interview in Apr 2021.
(2 Questions)
Round duration - 1 hour
Round difficulty - Medium
This was coding round and was conducted on Google meet with code link shared. Their were 2 interviewers that gave questions and later ran code on sample test cases.
- Q1.
Print Permutations - String Problem Statement
Given an input string 'S', you are tasked with finding and returning all possible permutations of the input string.
Input:
The first and only line of input ...
- Ans.
Return all possible permutations of a given input string.
Use recursion to generate all possible permutations of the input string.
Swap characters at different positions to generate permutations.
Handle duplicate characters by skipping swapping if the characters are the same.
- Q2.
Find the Kth Row of Pascal's Triangle Problem Statement
Given a non-negative integer 'K', determine the Kth row of Pascal’s Triangle.
Example:
Input:
K = 2
Output:
1 1
Input:
K = 4
Output:
1 4 6 ...
- Ans.
The task is to find the Kth row of Pascal's Triangle given a non-negative integer K.
Create an array to store the elements of the Kth row of Pascal's Triangle.
Use the formula C(n, k) = C(n-1, k-1) + C(n-1, k) to calculate the elements.
Return the array as the output.
Round duration - 2 hours
Round difficulty - Medium
This was a Machine Coding Round/LLD round followed by HLD round which was taken by Video Conferencing and Screen Sharing.
Round duration - 75 minutes
Round difficulty - Medium
This was the last round. This was HM round followed by the HR round.
Interview Preparation Tips
Tip 1 : Solve previously asked questions. It tells you about the level of questions that the company asks. Check glass-door reviews it will help you to know what kind of questions company ask
Tip 2 : Be real during the interview and don’t show off.
Tip 3 : Prepare for theory subjects like Object-Oriented Programming System, Database Management System, Computer networks, etc.
Tip 1 : Keep your resume simple with all work experience mentioned.
Tip 2 : Any unwanted information on the resume leaves a bad impact on the interviewer.
Tip 3 : You should be prepared to explain anything that’s written on your resume.
Tip 4 : Keep it of 1 page or 2 pages only
Skills evaluated in this interview
I applied via LinkedIn and was interviewed in May 2021. There was 1 interview round.
Interview Questionnaire
1 Question
- Q1. Find the sum of the least closest element to the left and the highest element to the right for each element of a array
- Ans.
Find sum of least closest element to left and highest element to right for each element of an array
Iterate through array and find least closest element to left and highest element to right for each element
Calculate sum of these two elements for each element
Return array of sums
Interview Preparation Tips
Skills evaluated in this interview
Top trending discussions
Interview questions from similar companies
I appeared for an interview before Sep 2020.
(1 Question)
Round duration - 1hour
Round difficulty - Hard
- Q1.
Snake and Ladder Problem Statement
Given a 'Snake and Ladder' board with N rows and N columns, where positions are numbered from 1 to (N*N) starting from the bottom left, alternating direction each row, f...
- Ans.
Find the minimum number of dice throws required to reach the last cell on a 'Snake and Ladder' board.
Use Breadth First Search (BFS) algorithm to find the shortest path from start to end cell.
Keep track of visited cells and the number of dice throws required to reach each cell.
Consider the presence of snakes and ladders while calculating the next possible moves.
Return the minimum number of dice throws to reach the last ...
(1 Question)
Round duration - 1hour
Round difficulty - Hard
- Q1. Stack using queue
Mvvm architecture
- Ans.
Implement a stack using a queue in MVVM architecture
Use two queues to simulate a stack
Push operation: Enqueue the element to queue 1
Pop operation: Dequeue all elements from queue 1 to queue 2, dequeue the last element from queue 2 (which is the top of the stack)
Ensure proper synchronization between the two queues
Example: Push(1), Push(2), Pop() should return 2
Round duration - 1hour
Round difficulty - Easy
Interview Preparation Tips
Tip 1 : be confident
Tip 2 : always say truth about your experience
Tip 3 : don't be nervous
Tip 1 : mentioned project u worked on
Tip 2 : technical skills
Skills evaluated in this interview
Shubham Jain
Selected
I applied via Recruitment Consulltant and was interviewed in Aug 2022. There were 5 interview rounds.
2 Coding questions both easy-medium level.
1. Based on the Sliding Window
2. Graph Question
A simple feed platform, which supports some basic functionality. The main point of this round was to see how well a candidate architect the application.
(4 Questions)
- Q1. Basic discussion around the project & past experience.
- Q2. Design a 2/3rd Winning game.
- Q3. Discussion around how would you scale a application.
- Ans.
Scaling an application involves optimizing performance, managing load, and ensuring reliability as user demand increases.
Horizontal scaling: Add more machines to distribute load (e.g., using load balancers).
Vertical scaling: Upgrade existing machines with more resources (CPU, RAM).
Database sharding: Split databases into smaller, more manageable pieces to improve performance.
Caching strategies: Use caching layers (e.g.,...
- Q4. NoSQL vs SQL difference
(3 Questions)
- Q1. Hiring Manager round
- Q2. Basic discussions around past work, past processes, what are your future aspirations etc.
- Q3. This round was mainly for seeing the culture fitment of a candidate.
Interview Preparation Tips
- Data Structures
- Algorithms
- System Design
- Microservices
- Java
- Spring Boot
Along with that, you should be well-versed in System design concepts.
Skills evaluated in this interview
I appeared for an interview in May 2021.
Round duration - 120 minutes
Round difficulty - Medium
it was morning 10AM-12
friendly environment given by the interviewer
It was machine coding round, the problem statement was to create a online food ordering system with various features.
interviewer was good and supportive
(2 Questions)
Round duration - 60 Minutes
Round difficulty - Medium
timing noon 3-4Pm
good interviewer
interviwer was giving hints if required and all
- Q1.
Problem: Sort an Array of 0s, 1s, and 2s
Given an array/list
ARRconsisting of integers where each element is either 0, 1, or 2, your task is to sort this array in increasing order.Input:
The input sta...
- Ans.
Sort an array of 0s, 1s, and 2s in increasing order.
Use a three-pointer approach to sort the array in a single pass.
Initialize three pointers for 0, 1, and 2 values and iterate through the array.
Swap elements based on the values encountered to achieve the sorted array.
Example: Input array [0, 2, 1, 1] should be sorted as [0, 1, 1, 2].
- Q2.
Maximum Path Sum Problem Statement
You are given an n-ary tree consisting of 'N' nodes. Your task is to determine the maximum sum of the path from the root to any leaf node.
Example:
Input:
For the giv...
- Ans.
Find the maximum sum of the path from the root to any leaf node in an n-ary tree.
Traverse the tree from root to leaf nodes, keeping track of the sum along the path.
At each node, calculate the sum of the path from the root to that node and update the maximum sum found so far.
Consider using depth-first search (DFS) to traverse the tree efficiently.
Handle cases where nodes are absent (-1) by appropriately updating the pat...
(1 Question)
Round duration - 90 Minutes
Round difficulty - Easy
evening 4-5:30PM
interviewer was good
very supportive and giving hints
- Q1. Design a system for BookMyShow to allow users to book movie tickets.
- Ans.
Design a system for BookMyShow to allow users to book movie tickets.
Create a user-friendly website and mobile app for users to browse movies and showtimes.
Implement a secure payment gateway for users to purchase tickets online.
Develop a database to store movie information, showtimes, and user bookings.
Include features like seat selection, ticket confirmation, and booking history for users.
Integrate with cinema partners...
(2 Questions)
Round duration - 40 Minutes
Round difficulty - Easy
4-5 PM
Interviewer was good
- Q1. Why should we hire you?
- Q2. Why are you considering a switch in your job?
- Ans.
I'm seeking new challenges and opportunities for growth that align with my career goals and aspirations.
Desire for professional growth: I'm looking for a role that offers more responsibilities and opportunities to lead projects.
Interest in new technologies: I want to work with cutting-edge technologies that can enhance my skills and knowledge.
Cultural fit: I'm seeking a company culture that aligns more closely with my ...
Interview Preparation Tips
Tip 1 : Practice Atleast 200 Questions
Tip 2 : Practice company specific interview question
Tip 3 : Prepare resume nicely
Tip 1 : Prepare resume very nicely.
Tip 2 : don't mention any tech stack you are confident of.
Skills evaluated in this interview
ankur kumar
I applied via Referral and was interviewed in Jan 2023. There were 3 interview rounds.
This was a machine coding round in which we have to implement an online cab booking service.
Standard problem solving round consists of two questions on tree and dp.
Interview Preparation Tips
I applied via LinkedIn and was interviewed in Apr 2024. There was 1 interview round.
That is machine coding round, where one problem will be given and you have to implement proper functionality with correct test cases.
I appeared for an interview in Mar 2022.
(1 Question)
Round duration - 60 minutes
Round difficulty - Medium
1 Medium/Easy DSA questions were asked similar to Leetcode.
I was expected to come up with the most optimal solution for the same. I completed the code and explained in 45 mins.
In the remaining time, I was asked questions from Computer Science fundamentals and Java
- Q1.
Unique Element In Sorted Array
Nobita wants to impress Shizuka by correctly guessing her lucky number. Shizuka provides a sorted list where every number appears twice, except for her lucky number, which a...
- Ans.
Find the unique element in a sorted array where all other elements appear twice.
Use XOR operation to find the unique element in the sorted array.
Iterate through the array and XOR all elements, the result will be the unique element.
Time complexity of O(n) can be achieved by iterating through the array once.
(1 Question)
Round duration - 60 minutes
Round difficulty - Easy
Low-level system design round.
Expected to come up with a running code.
- Q1.
LRU Cache Implementation Problem
Design and implement a Least Recently Used (LRU) cache data structure. This cache must support the following operations efficiently:
get(key): Return the value associate...
- Ans.
Implement a Least Recently Used (LRU) cache data structure that supports get and put operations efficiently.
Design a data structure that maintains a cache with a specified capacity.
Implement get(key) function to return value associated with key or -1 if key doesn't exist.
Implement put(key, value) function to insert/update key-value pair in cache.
Invalidate least recently used item when cache reaches its capacity.
Handle...
(1 Question)
Round duration - 30 minutes
Round difficulty - Easy
Standard behavioural questions by HR
- Q1. Can you describe your past work experiences and projects from your previous company?
Interview Preparation Tips
Tip 1 : Break down the total topics based on your comfort and ease and try and master one topic at a time
Tip 2 : Try and up solve
Tip 3 : Always try and come up with multiple solutions for a DSA question starting from brute force to optimal solution.
Tip 1 : Try to keep it short and crisp.
Tip 2 : Always make the entries chronological with the most recent experiences coming first followed by past experiences.
Skills evaluated in this interview
I appeared for an interview in Nov 2020.
Interview Questionnaire
1 Question
- Q1. Mainly about sql, previous job role
Tell us how to improve this page.
Ola Cabs Interviews By Designations
- Ola Cabs Business Analyst Interview Questions
- Ola Cabs Management Trainee Interview Questions
- Ola Cabs Software Developer Interview Questions
- Ola Cabs Assistant Manager Finance Interview Questions
- Ola Cabs Analyst Interview Questions
- Ola Cabs Software Engineer Interview Questions
- Ola Cabs SDE-2 Interview Questions
- Ola Cabs Customer Support Executive Interview Questions
- Show more
SDE-2 Interview Questions from Similar Companies
Ola Cabs SDE-2 Reviews and Ratings
based on 2 reviews
Rating in categories
|
Driver
777
salaries
|  ₹1 L/yr - ₹6 L/yr |
|
CAR Driver
502
salaries
| ₹1.5 L/yr - ₹5 L/yr |
|
Assistant Manager
271
salaries
| ₹5.1 L/yr - ₹18.7 L/yr |
|
Team Lead
197
salaries
| ₹2.3 L/yr - ₹8 L/yr |
|
Business Analyst
194
salaries
| ₹6 L/yr - ₹19 L/yr |
Uber
Meru cabs
Flipkart
Indiamart Intermesh
- Home >
- Interviews >
- Ola Cabs Interview Questions
