Upload Button Icon Add office photos
Engaged Employer

i

This company page is being actively managed by OLX Team. If you also belong to the team, you can get access from here

OLX Verified Tick

Compare button icon Compare button icon Compare

Filter interviews by

OLX SDE-2 Interview Questions and Answers

Updated 3 May 2022

OLX SDE-2 Interview Experiences

1 interview found

SDE-2 Interview Questions & Answers

user image Anonymous

posted on 3 May 2022

Round 1 - One-on-one 

(1 Question)

  • Q1. Data structure related question
Round 2 - One-on-one 

(2 Questions)

  • Q1. Nodejs related questions
  • Q2. Promises Async Await Events emitter
  • Ans. 

    Promises, async/await, and event emitters are all ways to handle asynchronous operations in JavaScript.

    • Promises provide a way to handle asynchronous operations by returning a promise object that can be resolved or rejected.

    • Async/await is a syntax for working with promises that makes code easier to read and write.

    • Event emitters allow you to create custom events that can be triggered and listened for in your code.

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

(2 Questions)

  • Q1. System design related question
  • Q2. Design a system like facebook
  • Ans. 

    Design a system like Facebook

    • Create a user registration and login system

    • Implement a news feed for users to see updates from friends

    • Allow users to create and join groups

    • Include features like messaging, commenting, and liking posts

    • Implement privacy settings for users to control who can see their content

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

(1 Question)

  • Q1. System design and behavioral

Interview Preparation Tips

Interview preparation tips for other job seekers - Practise DSA easy and medium question
Practice some HLD questions
Microservices related conecpts

Skills evaluated in this interview

Interview questions from similar companies

SDE-2 Interview Questions & Answers

Amazon user image Anonymous

posted on 16 Sep 2021

I appeared for an interview in Oct 2020.

Round 1 - Face to Face 

(3 Questions)

Round duration - 60 mins
Round difficulty - Medium

3 Questions were asked : 2- Trees and 1- Stack.
Interviewer was not receptive at all, I think this was a stress interview.

  • Q1. 

    Validate Binary Search Tree Problem Statement

    Given a binary tree with 'N' nodes, determine if it is a Binary Search Tree (BST). Return true if the tree is a BST, otherwise return false.

    Example:

    Input:
    ...
  • Ans. 

    Validate if a given binary tree is a Binary Search Tree (BST) or not.

    • Check if the left subtree of a node contains only nodes with values less than the node's value.

    • Check if the right subtree of a node contains only nodes with values greater than the node's value.

    • Ensure that both the left and right subtrees are also binary search trees.

    • Traverse the tree in-order and check if the elements are in sorted order.

    • Use a recurs...

  • Answered by AI
  • Q2. 

    Binary Tree Conversion to Greater Tree

    Given a binary tree with 'N' nodes, transform it into a Greater Tree. In this transformation, each node's value should be updated to the sum of its original value and...

  • Ans. 

    Convert a binary tree into a Greater Tree by updating each node's value to the sum of its original value and the values of all nodes greater than or equal to it.

    • Traverse the tree in reverse inorder (right, root, left) to update the nodes' values.

    • Keep track of the sum of nodes visited so far to update each node's value.

    • Recursively update the node's value by adding the sum of greater nodes to it.

  • Answered by AI
  • Q3. 

    Check for Valid Parentheses

    You are given a string STR containing only the characters "{", "}", "(", ")", "[", and "]". Your task is to determine if the parentheses in the string are balanced.

    Input:

    Th...
  • Ans. 

    Check if the given string containing only parentheses is balanced or not.

    • Use a stack to keep track of opening parentheses.

    • Iterate through the string and push opening parentheses onto the stack.

    • When a closing parenthesis is encountered, pop from the stack and check if it matches the corresponding opening parenthesis.

    • If at the end the stack is empty, return 'YES' else return 'NO'.

  • Answered by AI
Round 2 - Face to Face 

(2 Questions)

Round duration - 60 mins
Round difficulty - Hard

2 Coding Questions were asked, both were of Medium to Hard Difficulty.

  • Q1. 

    Flatten Multi-Level Linked List

    You are given a multi-level linked list containing 'N' nodes. Each node has 'next' and 'child' pointers that may or may not point to other nodes. Your task is to flatten th...

  • Ans. 

    Flatten a multi-level linked list into a single linked list by rearranging the pointers.

    • Traverse the linked list and whenever a node has a child, flatten the child list and append it after the current node.

    • Update the 'next' and 'child' pointers accordingly while flattening the list.

    • Continue this process until all nodes are rearranged into a single linked list.

  • Answered by AI
  • Q2. 

    Rain Water Trapping Problem Statement

    Given an array/list ARR of size N, representing an elevation map where each element ARR[i] denotes the elevation of the i-th bar. Your task is to calculate and print ...

  • Ans. 

    Calculate the total amount of rainwater that can be trapped between given elevations in an elevation map.

    • Use two-pointer approach to keep track of left and right boundaries.

    • Calculate the trapped water by finding the minimum of left_max and right_max for each bar.

    • Subtract the current bar's height from the minimum of left_max and right_max to get the trapped water.

    • Keep updating the left_max and right_max as you iterate t

  • Answered by AI
Round 3 - Face to Face 

Round duration - 90 minutes
Round difficulty - Medium

Timing : It was late night.
How the interviewer was? He was very tired and I had to lead the discussion.
1 System Design Question was asked, had to provide - HLD, LLD, APIs.

Round 4 - Telephonic Call 

(1 Question)

Round duration - 60 minutes
Round difficulty - Medium

Timing : Afternoon
How was the environment? Home
Interviewer : Hiring Manager

  • Q1. Hiring Manager Discussion

    Discussed about past Projects, challenges faced, disagreements with manager, why looking for job switch,  leadership principle questions were asked.

Round 5 - Telephonic Call 

Round duration - 60 minutes
Round difficulty - Medium

Timing - Afternoon
How was the environment? Home
How the interviewer was? Very Helpful Interviewer
Bar raiser Round - Coding + System Design + Leadership principle

Interview Preparation Tips

Professional and academic backgroundI applied for the job as SDE - 2 in HyderabadEligibility criteria3+ years ExperienceAmazon interview preparation:Topics to prepare for the interview - DS/Algo, System Design, HLD, LLD, Behavioral questionsTime required to prepare for the interview - 3 monthsInterview preparation tips for other job seekers

Tip 1 : 250 Leetcode ( Easy- 70, Medium- 150, Hard- 30) 
Tip 2 : Don't underestimate importance of good projects on your Resume.
Tip 3 : Be Confident.

Application resume tips for other job seekers

Tip 1: Resume should not be more than 1 page.
Tip 2: Have Keywords on Resume that match Job descriptions.

Final outcome of the interviewSelected

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

Uber user image Anonymous

posted on 15 Sep 2021

I appeared for an interview 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 appeared for an interview 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

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

I appeared for an interview 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

I appeared for an interview 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

I appeared for an interview in Mar 2022.

Round 1 - Video Call 

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

  • Answered by AI
Round 2 - Video Call 

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

  • Answered by AI
Round 3 - HR 

(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

Professional and academic backgroundI applied for the job as SDE - 2 in GurgaonEligibility criteriaAbove 1 years of experienceLenskart interview preparation:Topics to prepare for the interview - Data Structures, Algorithms, System Design, Aptitude, OOPSTime required to prepare for the interview - 2 monthsInterview preparation tips for other job seekers

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.

Application resume tips for other job seekers

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.

Final outcome of the interviewSelected

Skills evaluated in this interview

OLX Interview FAQs

How many rounds are there in OLX SDE-2 interview?
OLX interview process usually has 4 rounds. The most common rounds in the OLX interview process are One-on-one Round.
What are the top questions asked in OLX SDE-2 interview?

Some of the top questions asked at the OLX SDE-2 interview -

  1. Promises Async Await Events emit...read more
  2. Design a system like faceb...read more
  3. Data structure related quest...read more

Tell us how to improve this page.

SDE-2 Interview Questions from Similar Companies

Amazon SDE-2 Interview Questions
4.1
 • 14 Interviews
Flipkart SDE-2 Interview Questions
3.9
 • 4 Interviews
Ola Cabs SDE-2 Interview Questions
3.4
 • 3 Interviews
Uber SDE-2 Interview Questions
4.2
 • 2 Interviews
View all
Key Account Manager
149 salaries
unlock blur

₹3.2 L/yr - ₹8.6 L/yr

Dealer Success Manager
149 salaries
unlock blur

₹3 L/yr - ₹6.3 L/yr

Accounts Manager
109 salaries
unlock blur

₹2.7 L/yr - ₹6.8 L/yr

Senior Accounts Manager
70 salaries
unlock blur

₹3.9 L/yr - ₹8 L/yr

Retail Associate
65 salaries
unlock blur

₹2.9 L/yr - ₹6 L/yr

Explore more salaries
Compare OLX with

Quikr

3.7
Compare

eBay

3.8
Compare

Tokopedia

4.1
Compare

Amazon

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