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

Interview experience
4
Good
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
No response

I applied via LinkedIn and was interviewed in Apr 2024. There was 1 interview round.

Round 1 - Coding Test 

That is machine coding round, where one problem will be given and you have to implement proper functionality with correct test cases.

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

Interview Questionnaire 

1 Question

  • Q1. All algorithms and system design

SDE-2 Interview Questions & Answers

Amazon user image Anonymous

posted on 16 Sep 2021

I was interviewed in Oct 2020.

Round 1 - Coding Test 

(2 Questions)

Round duration - 90 minutes
Round difficulty - Easy

I got a call from an Amazon recruiter regarding the schedule of the test . She sent me the coding test link which I had to complete within a week. we can attempt the online test anytime, when we have time for a period of 90 minutes at a stretch.Once I completed the test, I got a call to schedule the interviews in two weeks.

  • Q1. 

    Shopping Options Problem Statement

    Given arrays representing the costs of pants, shirts, shoes, and skirts, and a budget amount 'X', determine the total number of valid combinations that can be purchased ...

  • Ans. 

    Determine total number of valid shopping combinations within budget

    • Iterate through all possible combinations of items from each array

    • Check if the total cost of the combination is within the budget

    • Return the count of valid combinations

  • Answered by AI
  • Q2. 

    Max Submatrix Problem Statement

    You are provided with a matrix MAT consisting of integers, with dimensions N x M (i.e., N rows and M columns). Your objective is to determine the maximum sum submatrix with...

  • Ans. 

    Find the maximum sum submatrix in a given matrix.

    • Iterate over all possible submatrices and calculate their sums

    • Use Kadane's algorithm to find the maximum sum subarray in each row

    • Combine the sums of rows to find the maximum sum submatrix

  • Answered by AI
Round 2 - Video Call 

(2 Questions)

Round duration - 60 minutes
Round difficulty - Medium

Virtual interview occured in amazon chime.The interviewer gave his introduction, asked me a bit on the kind of projects I’ve worked on. Then he started with a data structure problem.

  • Q1. 

    Clone a Binary Tree with Random Pointers

    Given a binary tree where each node has pointers to its left, right, and a random node, create a deep copy of the binary tree.

    Input:

    The first line contains an ...
  • Ans. 

    Clone a binary tree with random pointers and verify if cloning was successful by printing inorder traversal.

    • Create a deep copy of the binary tree with random pointers.

    • Print the inorder traversal of the cloned binary tree.

    • Verify cloning success by printing '1' if successful, '0' otherwise.

  • Answered by AI
  • Q2. 

    The Ninja Port Problem

    Ninja is in a city with 'N' colonies, where each colony contains 'K' houses. He starts at house number "sourceHouse" in colony number "sourceColony" and wants to reach house number ...

  • Ans. 

    The Ninja Port Problem involves finding the minimum time for a ninja to travel between colonies and houses using secret paths and teleportation.

    • Calculate the minimum time considering teleportation within colonies, traveling between colonies, and secret paths.

    • Keep track of the number of secret paths used and ensure they are one-way.

    • Consider the constraints provided to optimize the solution.

    • Example: N=2, K=3, S=1, P=1, s...

  • Answered by AI
Round 3 - Video Call 

Round duration - 75 Minutes
Round difficulty - Easy

This was taken by an engineering manager who asked me regarding my projects for around 10-15 mins and then we moved to a system design problem. He asked me to design Slack messenger.
I started by listing the functional and non-functional requirements(on which he questioned me a bit), then I moved to draw the high-level architecture. The components which I drew were the clients, gateway service(LB + authentication, etc), Messaging Service, User Service, Web Socket Manager service, Fan Out service(I added this for the group messages thing, but he didn’t interrogate much on that).

He asked me what would be the schema of my messages table and the scenarios in which the recipient user is online/offline.Also asked about the partitioning key and primary key of the 2-3 tables which I had made

Round 4 - Video Call 

(2 Questions)

Round duration - 60 minutes
Round difficulty - Hard

BarRaiser Round

This was again taken by an engineering manager who discussed my projects in depth for around 20-25 mins. In the remaining time he asked me 2 dsa questions. (Yes I too was surprised that he didn’t ask anything regarding design).

In almost all the rounds, I was asked questions related to Amazon Leadership principles, so do make sure you go through those before sitting for the interview process. You can refer to this link(https://www.codingninjas.com/codestudio/problem-lists/top-amazon-coding-interview-questions) for practicing the same, I found it useful. 
In the design rounds, interviewer doesn’t expect the most ideal answer from you and unless your choice of technology is outrageously wrong, he won’t pinpoint that.

  • Q1. 

    Group Anagrams Together

    Given an array/list of strings STR_LIST, group the anagrams together and return each group as a list of strings. Each group must contain strings that are anagrams of each other.

    E...

  • Ans. 

    Group anagrams together in a list of strings.

    • Iterate through the list of strings and sort each string to group anagrams together.

    • Use a hashmap to store the sorted string as key and the original string as value.

    • Return the values of the hashmap as the grouped anagrams.

  • Answered by AI
  • Q2. 

    Add Two Numbers Represented by Linked Lists

    Your task is to find the sum list of two numbers represented by linked lists and return the head of the sum list.

    Explanation:

    The sum list should be a linked...

  • Ans. 

    Add two numbers represented by linked lists and return the head of the sum list.

    • Traverse both linked lists simultaneously while keeping track of carry from previous sum

    • Create a new linked list to store the sum of the two numbers

    • Handle cases where one linked list is longer than the other by padding with zeros

    • Update the sum and carry values accordingly while iterating through the linked lists

  • Answered by AI

Interview Preparation Tips

Professional and academic backgroundI completed Computer Science Engineering from Sathyabama Institute Of Science And Technology. I applied for the job as SDE - 2 in HyderabadEligibility criteriaNo CGPA criteriaAmazon interview preparation:Topics to prepare for the interview - Data Structures and Algorithms, OOPS concepts, cpp, operating systems, dbmsTime required to prepare for the interview - 3 monthsInterview preparation tips for other job seekers

Tip 1 : Expect questions related to Amazon Leadership principles in all rounds, so go through those thoroughly before sitting for the interview process.
Tip 2 : In the design rounds, interviewer doesn’t expect the most ideal answer from you and unless your choice of technology is outrageously wrong, he won’t pinpoint that.
Tip 3 : Data Structures questions are a must in all rounds, so try to master them thoroughly

Application resume tips for other job seekers

Tip 1 : Make sure you know everything you mention in your resume
Tip 2 : Have some hands on with hackathons and contests ,which brings an added value to your resume

Final outcome of the interviewRejected

Skills evaluated in this interview

SDE-2 Interview Questions & Answers

Amazon user image Anonymous

posted on 16 Sep 2021

I was interviewed before Sep 2020.

Round 1 - Coding Test 

(2 Questions)

Round duration - 90 minutes
Round difficulty - Medium

  • Q1. 

    Number of Islands Problem Statement

    You are provided with a 2D array or list containing 'N' rows and 'M' columns, filled with 1s and 0s. Here, 1 indicates land, and 0 indicates water.

    Your task is to ide...

  • Ans. 

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

    • Iterate through the matrix and perform depth-first search (DFS) to find connected islands.

    • Use a visited array to keep track of visited cells to avoid redundant calculations.

    • Increment the island count whenever a new island is encountered.

    • Consider all eight directions (horizontal, vertical, and diagonal) while exploring the island.

    • Handle edge cases like out

  • Answered by AI
  • Q2. 

    Add First and Second Half Problem Statement

    You are provided with a Singly Linked List having 'N' nodes, where each node contains a single digit.

    Your task is to return a node 'X', which serves as the he...

  • Ans. 

    Return a node representing the head of a new Linked List with the sum of the 1st and 2nd half of the given Linked List.

    • Split the Linked List into two halves

    • Reverse the 2nd half of the Linked List

    • Add the corresponding digits from both halves while considering carry

    • Create a new Linked List with the sum digits

  • Answered by AI
Round 2 - Video Call 

(1 Question)

Round duration - 60 minutes
Round difficulty - Medium

  • Q1. 

    Next Greater Element Problem Statement

    You are given an array arr of length N. For each element in the array, find the next greater element (NGE) that appears to the right. If there is no such greater ele...

  • Ans. 

    The task is to find the next greater element for each element in an array to its right, if no greater element exists, return -1.

    • Use a stack to keep track of elements for which the next greater element is not found yet.

    • Iterate through the array from right to left, popping elements from the stack until a greater element is found.

    • Store the next greater element for each element in a separate array.

    • If the stack is empty aft...

  • Answered by AI
Round 3 - Video Call 

(2 Questions)

Round duration - 60 Minutes
Round difficulty - Hard

  • Q1. 

    Word Break Problem Statement

    You are given a non-empty string without spaces, referred to as 'sentence', and a list of non-empty strings representing a dictionary. Your task is to construct and return all...

  • Ans. 

    Given a sentence and a dictionary, construct and return all possible sentences by inserting spaces to form words from the dictionary.

    • Use backtracking to generate all possible combinations of words from the dictionary to form sentences.

    • Check if a substring of the sentence matches any word in the dictionary, if so, recursively call the function with the remaining substring.

    • Continue this process until the entire sentence ...

  • Answered by AI
  • Q2. 

    Valid Parenthesis Problem Statement

    Given a string str composed solely of the characters "{", "}", "(", ")", "[", and "]", determine whether the parentheses are balanced.

    Input:

    The first line contains ...
  • Ans. 

    Check if given string of parentheses is balanced or not.

    • Use a stack to keep track of opening parentheses and pop when a closing parenthesis is encountered.

    • If stack is empty at the end and all parentheses are matched, the string is balanced.

    • If stack is not empty at the end or mismatched parentheses are encountered, the string is not balanced.

  • Answered by AI
Round 4 - Video Call 

(1 Question)

Round duration - 60 minutes
Round difficulty - Easy

  • Q1. Design a local transport system similar to BMTC.
  • Ans. 

    Design a local transport system similar to BMTC

    • Introduce a fleet of buses covering various routes within the city

    • Implement a smart card system for easy payment and tracking

    • Include different types of buses like regular, AC, and Volvo for passenger comfort

    • Have designated bus stops with real-time information on bus arrivals

    • Offer discounted fares for students and senior citizens

  • Answered by AI
Round 5 - Video Call 

Round duration - 60 minutes
Round difficulty - Easy

Interview Preparation Tips

Professional and academic backgroundI applied for the job as SDE - 2 in BangaloreEligibility criteriaNAAmazon interview preparation:Topics to prepare for the interview - Graph , Dynamic Programming, Array, String, System DesignTime required to prepare for the interview - 2 monthsInterview preparation tips for other job seekers

Tip 1 : Practice a lot.
Tip 2 : Focus on system design 
Tip 3 : Focus on amazon Leadership principles.

Application resume tips for other job seekers

Tip 1: Mention relevant details for job you are applying. 
Tip 2: Be objective and concise.

Final outcome of the interviewRejected

Skills evaluated in this interview

SDE-2 Interview Questions & Answers

Amazon user image Anonymous

posted on 16 Sep 2021

I was interviewed in Apr 2021.

Round 1 - Telephonic Call 

(2 Questions)

Round duration - 60 minutes
Round difficulty - Easy

Started with brief intro(5 mins) about interviewer.
Problem solving question, question was already there in the codelink shared by the interviewer. He explained the problem again with sample testcase. 
The Interviewer was friendly.

  • Q1. 

    Course Schedule II Problem Statement

    You are provided with a number of courses 'N', some of which have prerequisites. There is a matrix named 'PREREQUISITES' of size 'M' x 2. This matrix indicates that fo...

  • Ans. 

    Given courses with prerequisites, determine a valid order to complete all courses.

    • Create a graph with courses as nodes and prerequisites as edges.

    • Use topological sorting to find a valid order to complete all courses.

    • Return an empty list if it's impossible to complete all courses.

  • Answered by AI
  • Q2. Design a live video broadcast platform.
  • Ans. 

    Design a live video broadcast platform.

    • Implement video streaming functionality using protocols like RTMP or WebRTC

    • Include features for live chat, reactions, and audience engagement

    • Ensure scalability and reliability by using cloud services like AWS or Azure

    • Provide analytics for viewership data and user engagement

    • Integrate monetization options such as ads or subscriptions

  • Answered by AI
Round 2 - Video Call 

(2 Questions)

Round duration - 90 minutes
Round difficulty - Medium

There were 2 interviewers(India HM and Seattle HM), India HM was just shadowing and didn't ask any questions. Started with intro, he asked in detail about what I do at current company(10 mins). Again, jumped into LP's(25 mins).

  • Q1. 

    Distance Between Two Nodes in a Binary Tree

    Given a binary tree and the values of two distinct nodes, determine the distance between these two nodes in the tree. The distance is defined as the minimum num...

  • Ans. 

    Calculate the distance between two nodes in a binary tree.

    • Traverse the tree to find the paths from the root to each node

    • Find the lowest common ancestor of the two nodes

    • Calculate the distance by summing the distances from each node to the common ancestor

  • Answered by AI
  • Q2. 

    Median in a Stream Problem Statement

    Your task is to determine the median of integers as they are read from a data stream. The median is the middle value in the ordered list of numbers. If the list length...

  • Ans. 

    Find median of integers in a data stream as they are read.

    • Use two heaps - max heap for lower half of numbers and min heap for upper half.

    • Keep the size of two heaps balanced to find the median efficiently.

    • Handle even and odd number of elements separately to calculate median.

    • Return vector of medians after each element is read from the stream.

  • Answered by AI
Round 3 - Telephonic Call 

Round duration - 60 minutes
Round difficulty - Medium

There was only 1 interviewer in this round and We had no video sharing in this round so it was becoming difficult to understand each other.

Interview Preparation Tips

Professional and academic backgroundI applied for the job as SDE - 2 in SeattleEligibility criteriaNAAmazon interview preparation:Topics to prepare for the interview - Data Structures - Trie, HashMap, Sets, Priority Queue, Stack, Advanced Topics like Fenwick Tree, Segment Trees, Game Theory, Dynamic Programming, Union Find,Graph Algorithms, BitmaskingTime required to prepare for the interview - 3 monthsInterview preparation tips for other job seekers

Tip 1 : Bookmark the GFG Amazon Archives. It helped me a lot during my preparations. Reading other’s interview experiences is one of the best ways to get yourselves ready for the next job interview. Practice daily atleast 5 questions.
Tip 2 : Most commonly asked topics in Amazon Interviews ( as per the mail I received from my recruiter ) :
BFS/DFS/Flood fill, Binary Search, Tree traversals, Hash tables, Linked list, stacks, queues, two pointers/sliding window
Binary heaps, Ad hoc/string manipulations.
Tip 3 : Highly recommended sites for practicing questions ( usually practice medium and hard level questions) :
Leetcode (highly encouraged)
Geeksforgeeks (highly encouraged)
CodeZen( highly encouraged)
Codeforces
Tip 4 : This is a great bigocheatsheet that could be of great help https://www.bigocheatsheet.com/

Application resume tips for other job seekers

Tip 1 : Mention past working experience in detail as how you were important to your previous company.
Tip 2 : Try to keep your resume to 1 page if work experience < 5 years
Tip 3 : Update your resume according to role you are applying for and never put false things on resume.

Final outcome of the interviewRejected

Skills evaluated in this interview

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

Amazon user image Anonymous

posted on 18 Apr 2022

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 tips
Round 2 - One-on-one 

(1 Question)

  • Q1. Behavioural questions related to leadership principle.

Interview Preparation Tips

Interview preparation tips for other job seekers - Nothing specific, respond back based on your experience

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
4.0
 • 4 Interviews
Ola Cabs SDE-2 Interview Questions
3.4
 • 3 Interviews
Uber SDE-2 Interview Questions
4.2
 • 2 Interviews
View all
Dealer Success Manager
152 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Key Account Manager
141 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Accounts Manager
119 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Senior Accounts Manager
70 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Retail Associate
65 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Explore more salaries
Compare OLX with

Quikr

3.7
Compare

eBay

3.8
Compare

Tokopedia

4.0
Compare

Flipkart

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