Upload Button Icon Add office photos

Ola Cabs

Compare button icon Compare button icon Compare

Filter interviews by

Ola Cabs Software Developer Interview Questions, Process, and Tips

Updated 24 Oct 2024

Top Ola Cabs Software Developer Interview Questions and Answers

  • Q1. Problem: Permutations of a String Given a string STR consisting of lowercase English letters, your task is to return all permutations of the given string in lexicographi ...read more
  • Q2. Count Leaf Nodes in a Binary Tree Given a binary tree, your task is to count and return the number of leaf nodes present in it. A binary tree is a data structure where e ...read more
  • Q3. Diagonal Traversal of a Binary Tree Problem Statement Given a binary tree, your task is to determine the diagonal traversal of the tree. Example: Input: 1 2 3 4 -1 5 6 - ...read more
View all 11 questions

Ola Cabs Software Developer Interview Experiences

5 interviews found

Interview experience
4
Good
Difficulty level
-
Process Duration
-
Result
-
Round 1 - Technical 

(2 Questions)

  • Q1. What is Closure
  • Ans. 

    Closure is a function that captures the environment in which it was created, allowing it to access variables from that environment even after the function has finished executing.

    • Closure allows a function to access variables from its outer scope even after the function has finished executing.

    • It is created when a function is defined within another function and the inner function references variables from the outer functi...

  • Answered by AI
  • Q2. Flat nested array
Round 2 - Technical 

(2 Questions)

  • Q1. Machine coding questions
  • Q2. Das based questions
Round 3 - HR 

(2 Questions)

  • Q1. Simple questions
  • Q2. Simple questions one on one

Software Developer Interview Questions & Answers

user image BIDISHA MISRA

posted on 19 Oct 2024

Interview experience
5
Excellent
Difficulty level
-
Process Duration
-
Result
-
Round 1 - Coding Test 

One coding and other mcqs on CS concepts

Software Developer Interview Questions Asked at Other Companies

asked in Amazon
Q1. Maximum Subarray Sum Problem Statement Given an array of integers ... read more
asked in Amazon
Q2. Minimum Number of Platforms Needed Problem Statement You are give ... read more
asked in Rakuten
Q3. Merge Two Sorted Arrays Problem Statement Given two sorted intege ... read more
asked in Cognizant
Q4. Nth Fibonacci Number Problem Statement Calculate the Nth term in ... read more
Q5. Validate Binary Tree Nodes Problem You are provided with 'N' bina ... read more

I appeared for an interview in May 2021.

Round 1 - Video Call 

(2 Questions)

Round duration - 60 minutes
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. 

    Problem: Permutations of a String

    Given a string STR consisting of lowercase English letters, your task is to return all permutations of the given string in lexicographically increasing order.

    Explanatio...

  • Ans. 

    Return all permutations of a given string in lexicographically increasing order.

    • Use backtracking to generate all permutations of the string.

    • Sort the permutations to get them in lexicographically increasing order.

    • Ensure the string contains unique characters to avoid duplicate permutations.

  • 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 each element in the row.

    • Return the array containing the Kth row of Pascal's Triangle.

  • Answered by AI
Round 2 - Video Call 

Round duration - 90 minutes
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 - 60 minutes
Round difficulty - Easy

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

Interview Preparation Tips

Eligibility criteriaWork Experience of 1+ yearsOla 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

I appeared for an interview before May 2021.

Round 1 - Coding Test 

(3 Questions)

Round duration - 90 minutes
Round difficulty - Medium

It was in the morning, where there were 3 questions to answer.

  • Q1. 

    Number of Islands Problem Statement

    You are provided with a 2-dimensional matrix having N rows and M columns, containing only 1s (land) and 0s (water). Your goal is to determine the number of islands in t...

  • Ans. 

    Count the number of islands in a 2D matrix of 1s and 0s.

    • Use Depth First Search (DFS) or Breadth First Search (BFS) to traverse the matrix and identify connected groups of 1s.

    • Maintain a visited array to keep track of visited cells to avoid redundant traversal.

    • Increment the island count each time a new island is encountered.

    • Consider all eight possible directions for connectivity while traversing the matrix.

    • Handle edge ca...

  • Answered by AI
  • Q2. 

    Missing Numbers Problem Statement

    You are provided with an array called ARR, consisting of distinct positive integers. Your task is to identify all the numbers that fall within the range of the smallest a...

  • Ans. 

    Identify missing numbers within the range of smallest and largest elements in an array.

    • Find the smallest and largest elements in the array.

    • Generate a list of numbers within this range.

    • Filter out the numbers present in the array.

    • Return the missing numbers in sorted order.

  • Answered by AI
  • Q3. 

    Count Leaf Nodes in a Binary Tree

    Given a binary tree, your task is to count and return the number of leaf nodes present in it.

    A binary tree is a data structure where each node has at most two children,...

  • Ans. 

    Count and return the number of leaf nodes in a binary tree.

    • Traverse the binary tree and count nodes with both left and right children as NULL.

    • Use recursion to traverse the tree efficiently.

    • Leaf nodes have no children, so check for NULL left and right children to identify them.

  • Answered by AI
Round 2 - Face to Face 

(1 Question)

Round duration - 20 minutes
Round difficulty - Medium

It was a system design round.

  • Q1. Can you describe the system design of the OLA app?
  • Ans. 

    OLA app system design involves multiple components like user interface, driver matching algorithm, payment processing, etc.

    • User interface for booking rides and tracking

    • Driver matching algorithm based on location and availability

    • Payment processing for seamless transactions

    • Real-time tracking of rides for both users and drivers

  • Answered by AI
Round 3 - Face to Face 

(2 Questions)

Round duration - 45 minutes
Round difficulty - Medium

It was a DS Algo round.

  • Q1. 

    Diagonal Traversal of a Binary Tree Problem Statement

    Given a binary tree, your task is to determine the diagonal traversal of the tree.

    Example:

    Input:
    1 2 3 4 -1 5 6 -1 7 -1 -1 -1 -1 -1 -1
    Output:
    ...
  • Ans. 

    Diagonal traversal of a binary tree involves traversing nodes diagonally from top to bottom and left to right.

    • Traverse the tree level by level, starting from the root node.

    • For each level, keep track of the diagonal nodes and their children.

    • Use a queue to store nodes at each level and traverse them accordingly.

    • Example: For input 1 2 3 4 -1 5 6 -1 7 -1 -1 -1 -1 -1 -1, the diagonal traversal is 1 3 6 2 5 4 7.

  • Answered by AI
  • Q2. 

    Minimum Number Of Taps To Water Garden Problem Statement

    You are required to determine the minimum number of taps that need to be opened to water an entire one-dimensional garden defined along the x-axis,...

  • Ans. 

    Find the minimum number of taps to water an entire garden along the x-axis.

    • Iterate over the taps and find the farthest point each tap can reach.

    • Sort the taps based on their starting points and use a greedy approach to select the taps.

    • Keep track of the farthest point reachable by the selected taps and the number of taps opened.

    • Return the minimum number of taps needed to water the entire garden or -1 if it's impossible.

  • Answered by AI
Round 4 - HR 

Round duration - 15 minutes
Round difficulty - Medium

HR Round

Interview Preparation Tips

Professional and academic backgroundI applied for the job as SDE - 1 in BangaloreEligibility criteriaAbove 7 CGPAOla interview preparation:Topics to prepare for the interview - Data Structures, OOPS, Algorithms, Puzzles, Binary Search, Dynamic Programming.Time required to prepare for the interview - 3 monthsInterview preparation tips for other job seekers

Tip 1 : Go through standard problems
Tip 2 : You should know about everything you have written on your resume

Application resume tips for other job seekers

Tip 1 : Keep it short not more than 1 page.
Tip 2 : Write more about figures and technicality on your resume.

Final outcome of the interviewSelected

Skills evaluated in this interview

Ola Cabs interview questions for designations

 Software Developer Intern

 (1)

 Developer

 (1)

 Software Engineer

 (4)

 Software Development Engineer

 (2)

 Senior Software Engineer 2

 (1)

 Developer Operations

 (2)

 SDE (Software Development Engineer)

 (1)

 Software Development Engineer Intern

 (1)

I appeared for an interview before Sep 2020.

Round 1 - Telephonic Call 

Round duration - 45 minutes
Round difficulty - Easy

This round was telephonic round. The interview lasted for approximately 45 minutes. The interviewer asked me three coding questions. I hustled a bit on 3rd question but after a hint was able to solve it.

Round 2 - Coding Test 

(1 Question)

Round duration - 120 minutes
Round difficulty - Easy

This round was Online Test on Hackerrank for 120 minutes, it contained 3 questions.

  • Q1. 

    LRU Cache Design Question

    Design a data structure for a Least Recently Used (LRU) cache that supports the following operations:

    1. get(key) - Return the value of the key if it exists in the cache; otherw...

  • Ans. 

    Design a Least Recently Used (LRU) cache data structure that supports get and put operations with capacity constraint.

    • Use a combination of hashmap and doubly linked list to implement the LRU cache.

    • Keep track of the least recently used item and evict it when the cache reaches its capacity.

    • Update the position of an item in the cache whenever it is accessed or updated.

    • Handle both get and put operations efficiently to main...

  • Answered by AI
Round 3 - Face to Face 

Round duration - 60 minutes
Round difficulty - Easy

This round was face to face Interview at Ola Campus and lasted for 1 hour.

Round 4 - Face to Face 

Round duration - 35 minutes
Round difficulty - Easy

This round was again a face to face technical interview, I was just asked one question in this round.

Round 5 - Face to Face 

(1 Question)

Round duration - 30 minutes
Round difficulty - Easy

Only a question of System Design was asked

  • Q1. Design a toll booth system for Ola cabs and explain the necessary functions and data structures used in it.
  • Ans. 

    Design a toll booth system for Ola cabs with necessary functions and data structures.

    • Use a queue data structure to manage the order of vehicles waiting at the toll booth.

    • Implement functions for vehicle entry, toll calculation, and exit.

    • Store vehicle information such as license plate number, type of vehicle, and toll amount in a hash map.

    • Utilize a priority queue to handle VIP or premium customers efficiently.

    • Include a f...

  • Answered by AI
Round 6 - HR 

Round duration - 30 minutes
Round difficulty - Easy

Very general HR questions were asked

Interview Preparation Tips

Professional and academic backgroundI applied for the job as SDE - 1 in New DelhiOla interview preparation:Topics to prepare for the interview - DSA, Operating systems, Databases, System design, Networking Time required to prepare for the interview - 4.5 monthsInterview preparation tips for other job seekers

Tip 1 : Be confident in the projects you have mentioned in your resume.
Tip 2 : Always discuss your approach with the interviewer first for any problem.
Tip 3 : Always start with a basic solution and then discuss further optimisations.

Application resume tips for other job seekers

Tip 1 : Good projects showing your skills (Be clear in what you achieved from those projects)
Tip 2 : Internship experience at the top (It gives you an edge over others)

Final outcome of the interviewSelected

Skills evaluated in this interview

Get interview-ready with Top Ola Cabs Interview Questions

Interview questions from similar companies

Interview Questionnaire 

1 Question

  • Q1. They asked 3 Coding questions and 5 MCQ all of them were very simple. One was related to fibbonaci. Another one was like there was 2d array and at i,j sum till row i and sum till j was given and all the el...

Interview Preparation Tips

Interview preparation tips for other job seekers - I got all three questions correct and also I got a call from recruiter saying that be prepared for interview at tuesday but when i tried calling, He wasn't picking it up. Overall, It was a pathetic experience.

I applied via Campus Placement and was interviewed in Jan 2021. There was 1 interview round.

Interview Questionnaire 

1 Question

  • Q1. Heavily focused on DSA with emphasis on DP

Interview Preparation Tips

Interview preparation tips for other job seekers - PrepLook at previous years Flipkart Questions on GFG. Questions don't repeat but you will see the tyes of questions they will ask

I appeared for an interview before Jan 2021.

Round 1 - Coding Test 

(2 Questions)

Round duration - 60 minutes
Round difficulty - Easy

Two coding questions were given in the first round to be solved in 60 minutes.

  • Q1. 

    Rearrange Array Elements Problem Statement

    Given an array A containing 'N' integers and an integer m, rearrange the elements of the array such that the differences between the array elements and m are sor...

  • Ans. 

    Rearrange array elements based on their differences from a given integer.

    • Calculate the differences between each element and the given integer.

    • Sort the elements based on their differences while maintaining the original order for elements with the same difference.

    • Implement a function to rearrange the array elements as per the given criteria.

  • Answered by AI
  • Q2. 

    Print Nodes at Distance K from a Given Node

    Given an arbitrary binary tree, a node of the tree, and an integer 'K', find all nodes that are at a distance K from the specified node, and return a list of th...

  • Ans. 

    The task is to find all nodes in a binary tree that are at a distance K from a given node.

    • Traverse the binary tree to find the given node

    • From the given node, perform a depth-first search to find all nodes at distance K

    • Use a list to store the values of the nodes at distance K

    • Return the list of values in any order

  • Answered by AI
Round 2 - Face to Face 

(4 Questions)

Round duration - 60 minutes
Round difficulty - Easy

This was a technical round with questions based on DSA, DBMS, Computer Networking and project based questions.

  • Q1. 

    Triangle of Numbers Pattern

    Ninja is tasked with printing a triangle pattern based on a given number 'N' for any test case.

    Example:

    Input:
    N = 4
    Output:
       1
    232
    34545
    4567654

    Explanation:

    The pat...

  • Ans. 

    Print a triangle pattern of numbers based on a given number 'N'.

    • Iterate through each row and print the numbers accordingly

    • Use spaces to center-align the numbers in each row

    • Increment the numbers in each row as per the pattern

  • Answered by AI
  • Q2. What is the difference between a web server and an application server?
  • Ans. 

    Web server serves static content over HTTP, while application server runs dynamic content and business logic.

    • Web server handles HTTP requests and responses, serving static content like HTML, images, and CSS.

    • Application server executes business logic, runs dynamic content, and interacts with databases.

    • Web server examples include Apache, Nginx, while application server examples include Tomcat, JBoss.

    • Web server focuses on...

  • Answered by AI
  • Q3. How does the internet work?
  • Ans. 

    The internet is a global network of interconnected computers that communicate using standardized protocols.

    • The internet is made up of a vast number of interconnected networks of computers.

    • Data is transmitted over the internet using protocols such as TCP/IP.

    • Websites are hosted on servers connected to the internet, and users access them using web browsers.

    • Internet Service Providers (ISPs) provide access to the internet f...

  • Answered by AI
  • Q4. Write a SQL query to find the nth highest salary.
  • Ans. 

    SQL query to find the nth highest salary

    • Use the 'SELECT DISTINCT' statement to get unique salary values

    • Order the salaries in descending order using 'ORDER BY' clause

    • Use 'LIMIT' and 'OFFSET' to get the nth highest salary

  • Answered by AI
Round 3 - HR 

Round duration - 30 minutes
Round difficulty - Easy

Typical HR round with behavioral problems.

Interview Preparation Tips

Professional and academic backgroundI completed Information Technology from Chitkara University. Eligibility criteriaAbove 7 CGPAInfo Edge India (Naukri.com) interview preparation:Topics to prepare for the interview - Data Structures, Algorithms, System Design, Aptitude, OOPSTime required to prepare for the interview - 4 monthsInterview preparation tips for other job seekers

Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 3 : Do at-least 2 good projects and you must know every bit of them.

Application resume tips for other job seekers

Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects and experiences more.

Final outcome of the interviewSelected

Skills evaluated in this interview

I appeared for an interview before Dec 2020.

Round 1 - Face to Face 

(2 Questions)

Round duration - 60 Minutes
Round difficulty - Medium

This round was purely based on Data Structures and Algorithms . One has to be fairly comfortable in solving Algorithmic problems to pass this round . Both the questions asked were quite common and luckily I had already prepared them from CodeStudio and LeetCode.

  • Q1. 

    Binary Tree Traversals Problem Statement

    Given a Binary Tree with 'N' nodes, where each node holds an integer value, your task is to compute the In-Order, Pre-Order, and Post-Order traversals of the binar...

  • Ans. 

    Compute the In-Order, Pre-Order, and Post-Order traversals of a Binary Tree given in level-order format.

    • Implement functions to perform In-Order, Pre-Order, and Post-Order traversals of a Binary Tree.

    • Use level-order input to construct the Binary Tree.

    • Traverse the Binary Tree recursively to generate the required traversals.

    • Ensure proper handling of null nodes represented by -1 in the input.

    • Return the three traversals as

  • Answered by AI
  • Q2. 

    Reverse Linked List Problem Statement

    Given a Singly Linked List of integers, your task is to reverse the Linked List by altering the links between the nodes.

    Input:

    The first line of input is an intege...
  • Ans. 

    Reverse a singly linked list by altering the links between nodes.

    • Iterate through the linked list and reverse the links between nodes

    • Use three pointers to keep track of the current, previous, and next nodes

    • Update the links between nodes to reverse the list

    • Return the head of the reversed linked list

  • Answered by AI
Round 2 - Face to Face 

(1 Question)

Round duration - 45 Minutes
Round difficulty - Medium

This round basically tested some concepts from Data Structures and File Manipulation .

  • Q1. 

    Intersection of Two Arrays Problem Statement

    Given two arrays A and B with sizes N and M respectively, both sorted in non-decreasing order, determine their intersection.

    The intersection of two arrays in...

  • Ans. 

    The problem involves finding the intersection of two sorted arrays efficiently.

    • Use two pointers to iterate through both arrays simultaneously.

    • Compare elements at the pointers and move the pointers accordingly.

    • Handle cases where elements are equal and update the intersection array.

    • Return the intersection array as the result.

  • Answered by AI

Interview Preparation Tips

Eligibility criteriaAbove 7 CGPABig Basket interview preparation:Topics to prepare for the interview - Data Structures, Algorithms, Operating Systems, Aptitude, OOPSTime required to prepare for the interview - 3 monthsInterview preparation tips for other job seekers

Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 3 : Do at-least 2 good projects and you must know every bit of them.

Application resume tips for other job seekers

Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects and experiences more.

Final outcome of the interviewSelected

Skills evaluated in this interview

I appeared for an interview before Apr 2021.

Round 1 - Telephonic Call 

(2 Questions)

Round duration - 45 Minutes
Round difficulty - Medium

It was in the mid day and since I applied for a Frontend role the discussion was majorly around data structure and bit of Javascript.
The interviewer was helping and good listener.

  • Q1. 

    Merge Two Sorted Linked Lists Problem Statement

    You are provided with two sorted linked lists. Your task is to merge them into a single sorted linked list and return the head of the combined linked list.

    ...
  • Ans. 

    Merge two sorted linked lists into a single sorted linked list without using additional space.

    • Create a dummy node to start the merged list

    • Compare the values of the two linked lists and add the smaller value to the merged list

    • Move the pointer of the merged list and the pointer of the smaller value list

    • Continue this process until one of the lists is fully traversed

    • Append the remaining elements of the other list to the me

  • Answered by AI
  • Q2. 

    Sort 0 1 2 Problem Statement

    Given an integer array arr of size 'N' containing only 0s, 1s, and 2s, write an algorithm to sort the array.

    Input:

    The first line contains an integer 'T' representing the n...
  • Ans. 

    Sort an array of 0s, 1s, and 2s in linear time complexity.

    • Use three pointers to keep track of 0s, 1s, and 2s while traversing the array.

    • Swap elements based on the values encountered to sort the array in-place.

    • Time complexity should be O(N) and space complexity should be O(1).

  • Answered by AI
Round 2 - Face to Face 

(3 Questions)

Round duration - 60 Minutes
Round difficulty - Medium

It was more of a in depth round on the framework I'm working on and problem solving.

  • Q1. What is the event loop and what is its significance?
  • Ans. 

    The event loop is a mechanism in programming that allows for asynchronous execution of code.

    • The event loop is a key component in JavaScript's runtime environment, responsible for handling asynchronous operations.

    • It continuously checks the call stack for any pending tasks and executes them in a non-blocking manner.

    • The event loop ensures that the program remains responsive by allowing other code to run while waiting for ...

  • Answered by AI
  • Q2. Can you provide examples of output-based questions in JavaScript that utilize browser APIs?
  • Ans. 

    Output-based questions in JavaScript using browser APIs

    • Example 1: Write a script that uses the Geolocation API to display the user's current location on a map

    • Example 2: Create a program that uses the Web Audio API to play a sound when a button is clicked

    • Example 3: Develop a web page that uses the Canvas API to draw a simple animation

  • Answered by AI
  • Q3. How would you design a system to support localization in a mobile app?
  • Ans. 

    Designing a system to support localization in a mobile app

    • Use resource files to store localized strings for different languages

    • Implement a language selection feature for users to choose their preferred language

    • Utilize localization libraries or frameworks to streamline the process

    • Consider cultural differences when localizing content, such as date formats and currency symbols

  • Answered by AI
Round 3 - Face to Face 

(3 Questions)

Round duration - 75 Minutes
Round difficulty - Hard

It was more of a fitment/managerial round.
Didn't had any coding questions, but was asked more on approaches and optimisations.
Discussions on the project you have worked on.

  • Q1. You need to find the fastest 3 horses out of a group, given that you can only race 5 horses at a time. How would you approach this problem?
  • Ans. 

    To find the fastest 3 horses out of a group with 5 horses racing at a time, we can use a tournament style approach.

    • Divide the horses into groups of 5 and race them against each other. This will give you the fastest horse in each group.

    • Take the winners from each group and race them against each other. The top 3 horses in this final race will be the fastest 3 overall.

    • Keep track of the results and compare the timings to d

  • Answered by AI
  • Q2. How do you debug the root cause of lag on a screen?
  • Ans. 

    To debug lag on a screen, analyze code, check for memory leaks, optimize rendering, and use profiling tools.

    • Analyze code to identify any inefficient algorithms or operations causing lag.

    • Check for memory leaks that could be impacting performance.

    • Optimize rendering by reducing the number of draw calls, optimizing shaders, and minimizing overdraw.

    • Use profiling tools like Xcode Instruments or Android Profiler to identify p

  • Answered by AI
  • Q3. Can you explain the architecture of the app you have recently worked on?
  • Ans. 

    The app I recently worked on is a social media platform for sharing photos and connecting with friends.

    • The app follows a client-server architecture, with the client being the mobile app and the server handling data storage and processing.

    • The client side is built using React Native for cross-platform compatibility.

    • The server side is implemented using Node.js with a MongoDB database for storing user data and photos.

    • The a...

  • Answered by AI

Interview Preparation Tips

Professional and academic backgroundI applied for the job as SDE - 1 in GurgaonEligibility criteriaNo criteriaCars24 interview preparation:Topics to prepare for the interview - Data Structures Algorithms, Javascript, System DesignTime required to prepare for the interview - 1 MonthInterview preparation tips for other job seekers

Tip 1 : Get your JS fundamentals right (if applying for a Frontend role, https://javascript.info/ is a good start)
Tip 2 : Apart from preparing data structures, practise on the communication skills as well (prepare your introduction, be a good listener and on spot improvisation plays key roles)

Application resume tips for other job seekers

Tip 1 : highlight projects related to the job profile in your resume and mention what was your contribution in them precisely in 1/2 lines.
Tip 2 : Include URLs to applications/projects that you have build and your achievements/blog (if any)

Final outcome of the interviewSelected

Skills evaluated in this interview

Ola Cabs Interview FAQs

How many rounds are there in Ola Cabs Software Developer interview?
Ola Cabs interview process usually has 2 rounds. The most common rounds in the Ola Cabs interview process are Technical, Coding Test and HR.
How to prepare for Ola Cabs Software Developer interview?
Go through your CV in detail and study all the technologies mentioned in your CV. Prepare at least two technologies or languages in depth if you are appearing for a technical interview at Ola Cabs. The most common topics and skills that interviewers at Ola Cabs expect are Automotive, Communication Protocols, Embedded Software, Ethernet and MATLAB.
What are the top questions asked in Ola Cabs Software Developer interview?

Some of the top questions asked at the Ola Cabs Software Developer interview -

  1. What is Clos...read more
  2. Machine coding questi...read more
  3. Simple questions one on ...read more

Tell us how to improve this page.

Ola Cabs Software Developer Interview Process

based on 5 interviews

Interview experience

3.4
  
Average
View more
Ola Cabs Software Developer Salary
based on 70 salaries
₹8.2 L/yr - ₹26.5 L/yr
92% more than the average Software Developer Salary in India
View more details

Ola Cabs Software Developer Reviews and Ratings

based on 12 reviews

2.7/5

Rating in categories

3.5

Skill development

2.5

Work-life balance

3.0

Salary

2.5

Job security

2.6

Company culture

2.5

Promotions

3.3

Work satisfaction

Explore 12 Reviews and Ratings
Driver
748 salaries
unlock blur

₹1 L/yr - ₹6 L/yr

CAR Driver
461 salaries
unlock blur

₹1 L/yr - ₹6 L/yr

Program Manager
247 salaries
unlock blur

₹9.5 L/yr - ₹34 L/yr

Business Development Executive
241 salaries
unlock blur

₹1.8 L/yr - ₹5 L/yr

Assistant Manager
235 salaries
unlock blur

₹4.2 L/yr - ₹17.5 L/yr

Explore more salaries
Compare Ola Cabs with

Uber

4.2
Compare

Meru cabs

3.8
Compare

Flipkart

3.9
Compare

Udaan

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