Upload Button Icon Add office photos

Ola Cabs

Compare button icon Compare button icon Compare

Filter interviews by

Clear (1)

Ola Cabs SDE-2 Interview Questions, Process, and Tips

Updated 17 May 2022

Top Ola Cabs SDE-2 Interview Questions and Answers

  • Q1. 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 ...read more
  • Q2. 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: ...read more
  • Q3. 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 ...read more
View all 7 questions

Ola Cabs SDE-2 Interview Experiences

3 interviews found

SDE-2 Interview Questions & Answers

user image Anonymous

posted on 17 May 2022

I was interviewed in Jul 2021.

Round 1 - Coding Test 

(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

  • Answered by AI
Round 2 - Face to Face 

(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 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...

  • 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.

  • Answered by AI
  • Q2. 

    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 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

  • Answered by AI
Round 3 - Face to Face 

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.

Round 4 - Face to Face 

(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

  • Answered by AI

Interview Preparation Tips

Professional and academic backgroundI applied for the job as SDE - 2 in BangaloreEligibility criteriaNAOla interview preparation:Topics to prepare for the interview - Linked List, Stacks, Queues, Tree, Graph, System Design, Dynamic Programming.Time required to prepare for the interview - 2 monthsInterview preparation tips for other job seekers

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.

Application resume tips for other job seekers

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.

Final outcome of the interviewSelected

Skills evaluated in this interview

SDE-2 Interview Questions & Answers

user image Anonymous

posted on 16 Sep 2021

I was interviewed in Apr 2021.

Round 1 - Video Call 

(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.

  • Answered by AI
  • 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.

  • Answered by AI
Round 2 - Video Call 

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 3 - HR 

Round duration - 75 minutes
Round difficulty - Medium

This was the last round. This was HM round followed by the HR round.

Interview Preparation Tips

Professional and academic backgroundI completed Civil Engineering from Netaji Subhas University Of Technology. Eligibility criteriaPrior Work ExperienceOla interview preparation:Topics to prepare for the interview - Data Structures, OOPS, Algorithms, Dynamic Programming, Aptitude, Computer Netwroks and System ArchitectureTime required to prepare for the interview - 3 monthsInterview preparation tips for other job seekers

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.

Application resume tips for other job seekers

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

Final outcome of the interviewSelected

Skills evaluated in this interview

SDE-2 Interview Questions Asked at Other Companies

asked in Walmart
Q1. Maximum Frequency Number Problem Statement Given an array of inte ... read more
asked in Atlassian
Q2. K Most Frequent Words Problem Statement Given an array of N non-e ... read more
Q3. Reverse String Operations Problem Statement You are provided with ... read more
asked in KhataBook
Q4. Alien Dictionary Problem Statement Ninja is mastering an unusual ... read more
asked in Zoho
Q5. Make Palindrome Problem Statement You are provided with a string ... read more

SDE-2 Interview Questions & Answers

user image Anonymous

posted on 12 Nov 2021

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

  • Answered by AI

Interview Preparation Tips

Interview preparation tips for other job seekers - Prepare ds and algorithms

Skills evaluated in this interview

Interview questions from similar companies

SDE-2 Interview Questions & Answers

Amazon user image Anonymous

posted on 2 Apr 2015

Interview Questionnaire 

10 Questions

  • Q1. Find sum of all numbers that are formed from root to leaf path (code) expected time complexity O(n)
  • Ans. 

    Find sum of all numbers formed from root to leaf path in a binary tree

    • Traverse the binary tree using DFS

    • At each leaf node, add the number formed from root to leaf path to a sum variable

    • Return the sum variable

    • Time complexity: O(n)

    • Example: For a binary tree with root value 1, left child 2 and right child 3, the sum would be 12 + 13 = 25

  • Answered by AI
  • Q2. Given a string you need to print all possible strings that can be made by placing spaces (zero or one) in between them. For example : ABC -> A BC, AB C, ABC, A B C
  • Ans. 

    Given a string, print all possible strings that can be made by placing spaces (zero or one) in between them.

    • Use recursion to generate all possible combinations of spaces

    • For each recursive call, either add a space or don't add a space between the current character and the next character

    • Base case is when there are no more characters left to add spaces between

    • Time complexity is O(2^n) where n is the length of the string

  • Answered by AI
  • Q3. Preorder traversal without using recursion
  • Ans. 

    Preorder traversal without recursion

    • Use a stack to keep track of nodes

    • Push right child first and then left child onto stack

    • Pop top of stack and print value

    • Repeat until stack is empty

  • Answered by AI
  • Q4. There is a 12 km road and a contractor who is in-charge of repairing it. Contractor updates you about the work which is done in patches. Like “Road between 3.2 km to 7.9 km repaired ”, “Road between 1.21 k...
  • Ans. 

    Find longest continuous patch on a 12 km road with updates in patches

    • Maintain a variable to keep track of current patch length

    • Update the variable whenever a new patch is added

    • Maintain a variable to keep track of longest patch so far

    • Compare current patch length with longest patch length and update if necessary

    • Use a sorted data structure like a binary search tree to store the patches for efficient search

    • Time complexity: ...

  • Answered by AI
  • Q5. Several Questions were asked from my project
  • Q6. Find median of an unsorted array. (code
  • Ans. 

    Find median of an unsorted array.

    • Sort the array and find the middle element

    • Use quickselect algorithm to find the median in O(n) time

    • If the array is small, use brute force to find the median

  • Answered by AI
  • Q7. General discussion on heaps
  • Q8. A stream of characters is coming, at any moment you have to tell ‘k’ elements closest to a given number (code)
  • Ans. 

    Find 'k' elements closest to a given number from a stream of characters.

    • Use a priority queue to keep track of closest elements.

    • Update the queue as new characters come in.

    • Return the 'k' closest elements from the queue.

  • Answered by AI
  • Q9. Design data structure that supports insert(), remove(), find-max(), delete-max() operations. All operations should run in O(1) time. Lots of discussion was there, discussed many approaches.
  • Ans. 

    Design a data structure with O(1) insert, remove, find-max, and delete-max operations.

    • Use a doubly linked list to maintain the elements in sorted order.

    • Use a hash table to store the pointers to the nodes in the linked list.

    • Maintain a pointer to the maximum element in the hash table.

    • Update the pointers in the hash table when inserting or removing elements.

    • Update the maximum pointer when deleting or inserting the maximum

  • Answered by AI
  • Q10. Check whether given link list represents palindrome
  • Ans. 

    Check if a given linked list is a palindrome.

    • Traverse the linked list and store the values in an array.

    • Compare the first and last elements of the array, then move towards the center.

    • If all elements match, the linked list is a palindrome.

    • Alternatively, use two pointers to find the middle of the linked list and reverse the second half.

    • Compare the first half with the reversed second half to check for a palindrome.

  • Answered by AI

Interview Preparation Tips

Round: Technical Interview
Experience: Recently I attended Amazon Bangalore interview for SDE 2 position. All f2f and no phone/written screening as I had attended one before and cleared those. Total 4 rounds wer der. The first techh round dey asked mi questions listed above.
Tips: NA

Round: Technical Interview
Experience: ROUND 2 dey asked mi above questions
Tips: NA

Round: Technical Interview
Experience: Round 3 Above questions wer asked.

Round: Technical Interview
Experience: This was the last round. thy asked mi above questions

College Name: NA

Skills evaluated in this interview

SDE-2 Interview Questions & Answers

Amazon user image Anonymous

posted on 12 Apr 2022

I applied via Recruitment Consulltant and was interviewed before Apr 2021. There were 2 interview rounds.

Round 1 - Coding Test 

2 coding questions

Round 2 - Technical 

(1 Question)

  • Q1. Ds algo round 2 medium questions

Interview Preparation Tips

Interview preparation tips for other job seekers - Prepare well from leet code medium and few hard questions

SDE-2 Interview Questions & Answers

Amazon user image Anonymous

posted on 19 May 2022

I was interviewed before May 2021.

Round 1 - Face to Face 

(1 Question)

Round duration - 45 Minutes
Round difficulty - Easy

  • Q1. 

    Balanced Parentheses Combinations

    Given an integer N representing the number of pairs of parentheses, find all the possible combinations of balanced parentheses using the given number of pairs.

    Explanati...

  • Ans. 

    Generate all possible combinations of balanced parentheses for a given number of pairs.

    • Use recursion to generate all possible combinations of balanced parentheses.

    • Keep track of the number of open and close parentheses used in each combination.

    • Terminate recursion when the number of open and close parentheses used equals the given number of pairs.

  • Answered by AI
Round 2 - Face to Face 

(1 Question)

Round duration - 45 Minutes
Round difficulty - Easy

  • Q1. 

    Boundary Traversal of Binary Tree Problem Statement

    You are given a binary tree of integers. Your task is to print the boundary nodes of this binary tree in an anti-clockwise direction starting from the ro...

  • Ans. 

    Print the boundary nodes of a binary tree in an anti-clockwise direction starting from the root node.

    • Traverse the left boundary nodes from top to bottom

    • Traverse the leaf nodes from left to right

    • Traverse the right boundary nodes from bottom to top

    • Handle cases where nodes are null (-1)

    • Print the boundary nodes in the specified order

  • Answered by AI
Round 3 - Face to Face 

(1 Question)

Round duration - 45 Minutes
Round difficulty - Easy

  • Q1. 

    Bottom View of Binary Tree Problem Statement

    Given a binary tree, the task is to print its bottom view from left to right. Assume the left and the right child nodes make a 45-degree angle with their paren...

  • Ans. 

    The task is to print the bottom view of a binary tree from left to right.

    • Traverse the binary tree in level order and keep track of the horizontal distance of each node from the root.

    • For each horizontal distance, update the node value in a map to get the bottom view nodes.

    • Print the values of the map in sorted order of horizontal distance to get the bottom view sequence.

  • Answered by AI
Round 4 - Telephonic Call 

(1 Question)

Round duration - 45 minutes
Round difficulty - Easy

Bar raiser

  • Q1. Can you design a parking lot using low-level design (LLD) and a tiny URL service using high-level design (HLD)?
  • Ans. 

    Yes, I can design a parking lot using LLD and a tiny URL service using HLD.

    • For designing a parking lot using LLD, we can create classes like ParkingLot, ParkingSpot, Vehicle, etc. with their respective attributes and methods.

    • For designing a tiny URL service using HLD, we can focus on scalability, fault tolerance, and performance. We can use techniques like sharding, caching, load balancing, etc.

    • In the parking lot LLD, ...

  • Answered by AI

Interview Preparation Tips

Professional and academic backgroundI applied for the job as SDE - 2 in BangaloreEligibility criteriaNoAmazon interview preparation:Topics to prepare for the interview - DS Algos: Binary Trees, Topological Sort, Tries, Linked List, Arrays, StringsTime required to prepare for the interview - 6 monthsInterview preparation tips for other job seekers

Tip 1 : Prepare 1-2 examples for each Leadership Principles 
Tip 2 : Prepare questions from the latest interview experiences

Application resume tips for other job seekers

Tip 1 : Concise, without errors
Tip 2 : Highlight years of experience

Final outcome of the interviewSelected

Skills evaluated in this interview

SDE-2 Interview Questions & Answers

Uber user image Anonymous

posted on 15 Sep 2021

I was interviewed before Sep 2020.

Round 1 - Coding Test 

(1 Question)

Round duration - 60 minutes
Round difficulty - Easy

Timing: evening
Environment: Online round took at home

  • Q1. 

    Smallest Subarray with K Distinct Elements Problem

    Given an array A consisting of N integers, find the smallest subarray of A that contains exactly K distinct integers.

    Input:

    The first line contains tw...
  • Ans. 

    Find the smallest subarray with exactly K distinct integers in an array.

    • Use a sliding window approach to keep track of the subarray with K distinct integers.

    • Use a hashmap to store the frequency of each integer in the current window.

    • Update the window size based on the number of distinct integers found.

    • Keep track of the smallest subarray meeting the criteria.

    • Return the starting and ending indices of the smallest subarray

  • Answered by AI
Round 2 - Face to Face 

Round duration - 90 minutes
Round difficulty - Medium

Machine coding round

Round 3 - Face to Face 

(1 Question)

Round duration - 60 minutes
Round difficulty - Medium

  • Q1. 

    Rat In a Maze Problem Statement

    Given a N * N maze with a rat placed at position MAZE[0][0], find and print all possible paths for the rat to reach its destination at MAZE[N-1][N-1]. The rat is allowed to...

  • Ans. 

    The problem involves finding all possible paths for a rat to reach its destination in a maze.

    • Use backtracking to explore all possible paths in the maze.

    • Mark visited cells to avoid revisiting them.

    • Return the path once the destination is reached.

    • Handle edge cases like blocked cells and out-of-bounds movements.

  • Answered by AI
Round 4 - Face to Face 

Round duration - 60-90 minutes
Round difficulty - Medium

Round 5 - HR 

Round duration - 60 minutes
Round difficulty - Medium

Hiring Manager round

Interview Preparation Tips

Professional and academic backgroundI applied for the job as SDE - 2 in BangaloreEligibility criteriaNone as such. Only eligible criteria for SDE-2 role is that one should have prior experience working as SDEUber interview preparation:Topics to prepare for the interview - Data structures and algorithms, Design patterns, System design, DatabasesTime required to prepare for the interview - 1 monthInterview preparation tips for other job seekers

Tip 1 : Do some basic research about the interview process and types of rounds while appearing for a company interview. Narrow down the topics and draft a realistic plan afterwards.
Tip 2 : Try to solve as many problems as possible as this is primarily what you will be doing in live interview rounds.

Application resume tips for other job seekers

Tip 1 : Tailor your resume as per expectations from the role you are applying for.
Tip 2 : Order your experiences and skills by relevance.
Tip 3 : Try to fit the content in a single page.

Final outcome of the interviewRejected

Skills evaluated in this interview

SDE-2 Interview Questions & Answers

Uber user image Anonymous

posted on 15 Sep 2021

I was interviewed before Sep 2020.

Round 1 - Telephonic Call 

(1 Question)

Round duration - 60 minutes
Round difficulty - Medium

It was a telephonic interview at 10 in the morning. Interviewer seemed cool.

  • Q1. 

    Best Insert Position for a Target in a Sorted Array

    You are provided with a sorted array A of length N consisting of distinct integers and a target integer M. Your task is to determine the position where ...

  • Ans. 

    Find the best insert position for a target in a sorted array to maintain order.

    • Use binary search to find the correct position for the target integer in the sorted array.

    • If the target is already present in the array, return its index.

    • Maintain the sorted order of the array after inserting the target integer.

    • Handle edge cases like empty array or target being smaller than the first element or larger than the last element.

  • Answered by AI
Round 2 - Face to Face 

(1 Question)

Round duration - 60 minutes
Round difficulty - Medium

The interview was in the morning at 10 AM in the office meeting room.

  • Q1. 

    House Robber Problem Statement

    Mr. X is a professional robber with a plan to rob houses arranged in a circular street. Each house has a certain amount of money hidden, separated by a security system that ...

  • Ans. 

    House Robber problem - find maximum amount of money Mr. X can rob without triggering alarm in circular street.

    • Use dynamic programming to keep track of maximum money robbed at each house.

    • Consider two cases - robbing the first house and not robbing the first house.

    • Handle circular arrangement by considering the first and last houses separately.

    • Return the maximum amount of money that can be robbed without triggering the al

  • Answered by AI
Round 3 - Face to Face 

(1 Question)

Round duration - 60 minutes
Round difficulty - Medium

The interview was at 11 AM in the meeting office.

  • Q1. 

    Running Median Problem

    Given a stream of integers, calculate and print the median after each new integer is added to the stream.

    Output only the integer part of the median.

    Example:

    Input:
    N = 5  
    Stre...
  • Ans. 

    Calculate and print the median after each new integer is added to the stream.

    • Use a min heap to store the larger half of the numbers and a max heap to store the smaller half of the numbers.

    • Keep the two heaps balanced by ensuring the size difference is at most 1.

    • If the total number of elements is odd, the median is the top element of the larger heap. If even, it's the average of the tops of both heaps.

  • Answered by AI
Round 4 - Face to Face 

Round duration - 60 minutes
Round difficulty - Medium

The interview was at 1 AM.

Round 5 - Face to Face 

Round duration - 60 minutes
Round difficulty - Easy

The meeting was at 2 PM in the office meeting room.

Round 6 - Telephonic Call 

(1 Question)

Round duration - 60 minutes
Round difficulty - Easy

10 AM

  • Q1. Can you provide a deeper discussion about all the projects you completed in your previous company?

Interview Preparation Tips

Professional and academic backgroundI applied for the job as SDE - 2 in HyderabadEligibility criteriaNoUber interview preparation:Topics to prepare for the interview - Data Structures, Algorithms, Graphs, Dynamic programming, Trees, stack, queue, System DesignTime required to prepare for the interview - 3 monthsInterview preparation tips for other job seekers

Tip 1 : Be consistent in the preparation. Practice atleast one question everyday
Tip 2 : Make relevant notes that you can go through on the day before the interview
Tip 3 :Try to note your progress by giving timed contests

Application resume tips for other job seekers

Tip 1 : Clearly mention the details of the projects that are relevant to the company that you are applying for
Tip 2 : Ensure that there are no grammatical mistakes and that you have highlighted the important keywords in your resume

Final outcome of the interviewSelected

Skills evaluated in this interview

Interview experience
5
Excellent
Difficulty level
Moderate
Process Duration
-
Result
Not Selected

I applied via Referral and was interviewed in Jan 2023. There were 3 interview rounds.

Round 1 - Resume Shortlist 
Pro Tip by AmbitionBox:
Keep your resume crisp and to the point. A recruiter looks at your resume for an average of 6 seconds, make sure to leave the best impression.
View all Resume tips
Round 2 - Assignment 

This was a machine coding round in which we have to implement an online cab booking service.

Round 3 - Coding Test 

Standard problem solving round consists of two questions on tree and dp.

Interview Preparation Tips

Interview preparation tips for other job seekers - 1.Do not take input as given,focus on implementing the services first.Take comma separated input also.
Interview experience
4
Good
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
Selected Selected

I applied via Recruitment Consulltant and was interviewed in Aug 2022. There were 5 interview rounds.

Round 1 - Resume Shortlist 
Pro Tip by AmbitionBox:
Keep your resume crisp and to the point. A recruiter looks at your resume for an average of 6 seconds, make sure to leave the best impression.
View all Resume tips
Round 2 - Coding Test 

2 Coding questions both easy-medium level.
1. Based on the Sliding Window
2. Graph Question

Round 3 - Assignment 

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.

Round 4 - One-on-one 

(4 Questions)

  • Q1. Basic discussion around the project & past experience.
  • Q2. Design a 2/3rd Winning game.
  • Ans. 

    Design a 2/3rd Winning game.

    • The game should have a clear win condition

    • The win condition should be achievable in 2/3rd of the total game time

    • The game should have a balanced difficulty level

    • The game should have a clear feedback system for the player

    • Examples: Chess, Tic Tac Toe, Connect Four

  • Answered by AI
  • Q3. Discussion around how would you scale a application.
  • Q4. NoSQL vs SQL difference
  • Ans. 

    NoSQL is non-relational and schema-less while SQL is relational and has a fixed schema.

    • NoSQL databases are horizontally scalable and can handle large amounts of unstructured data.

    • SQL databases are vertically scalable and are better suited for structured data with complex relationships.

    • NoSQL databases are often used in web applications, while SQL databases are commonly used in enterprise applications.

    • Examples of NoSQL d...

  • Answered by AI
Round 5 - One-on-one 

(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

Topics to prepare for Flipkart SDE-2 interview:
  • Data Structures
  • Algorithms
  • System Design
  • Microservices
  • Java
  • Spring Boot
Interview preparation tips for other job seekers - Prepare well for Data structures & Algorithms.
Along with that, you should be well-versed in System design concepts.

Skills evaluated in this interview

Contribute & help others!
anonymous
You can choose to be anonymous

Recently Viewed

INTERVIEWS

Alibaba Group

No Interviews

DESIGNATION

SALARIES

HyperVerge

SALARIES

Ola Cabs

INTERVIEWS

Cashkaro.com

No Interviews

SALARIES

Ola Cabs

DESIGNATION

INTERVIEWS

91Squarefeet

No Interviews

SALARIES

Ola Cabs

SALARIES

Perch Technologies

No Salaries

Tell us how to improve this page.

SDE-2 Interview Questions from Similar Companies

Amazon SDE-2 Interview Questions
4.1
 • 16 Interviews
Flipkart SDE-2 Interview Questions
4.0
 • 5 Interviews
Uber SDE-2 Interview Questions
4.2
 • 2 Interviews
Paytm SDE-2 Interview Questions
3.3
 • 1 Interview
OLX SDE-2 Interview Questions
3.8
 • 1 Interview
View all
Ola Cabs SDE-2 Salary
based on 15 salaries
₹18.2 L/yr - ₹33 L/yr
21% less than the average SDE-2 Salary in India
View more details

Ola Cabs SDE-2 Reviews and Ratings

based on 2 reviews

1.6/5

Rating in categories

2.9

Skill development

1.6

Work-life balance

3.0

Salary

1.6

Job security

1.6

Company culture

2.3

Promotions

2.9

Work satisfaction

Explore 2 Reviews and Ratings
Driver
748 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

CAR Driver
572 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Program Manager
247 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Assistant Manager
246 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Business Development Executive
241 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Explore more salaries
Compare Ola Cabs with

Uber

4.2
Compare

Meru cabs

3.8
Compare

Zoomcar

3.6
Compare

Rapido

3.8
Compare
Did you find this page helpful?
Yes No
write
Share an Interview