OLX Group interview experience Real time questions & tips from candidates to crack your interview

SDE - Intern

OLX Group
upvote
share-icon
3 rounds | 5 Coding problems

Interview preparation journey

expand-icon
Journey
It was the first company in which I applied through on-campus placements in the second week of august month. My all hard work for placement preparation paid off and fortunately I recieved an offer for SDE intern role
Application story
I applied to OLX through on-campus in second week of august month . This was the 1st company in which I appied
Why selected/rejected for the role?
I was selected to this role because I gave all the interviews rounds with confidence and almost gave answers to all the questions asked by the interviewer in all rounds and also I was very interactive througout the interviews
Preparation
Duration: 6 months
Topics: I prepared Data Structures and Algorithms and problem solving through many coding platforms like Leetcode, Codeforces, Codechef etc. I also prepared for computer science fundamentals like Operating System, DBMS, Computer Networks, OOPs and basics of system design (LLD and HLD)
Tip
Tip

Tip 1 : Prepare data structures and algorithms along with problem solving 
Tip 2 : Prepare atleast two projects to have some knowledge of development
Tip 3 : Be confident while giving the interviews

Application process
Where: Campus
Eligibility: above 7 CGPA
Resume Tip
Resume tip

Tip 1 : Don't put irrelevant information in your resume for the sake of filling the page 
Tip 2 : Have 2 or 3 good projects and put only the technologies and programming languages to which you are really confident

Interview rounds

01
Round
Medium
Online Coding Test
Duration60 minutes
Interview date12 Aug 2022
Coding problem2

Timming was around 2 PM
This was mainly a technical round. Interviewer asked some conding questions and CS fundamentals questions

1. Reverse Linked List

Moderate
15m average time
85% success
0/80
Asked in companies
WalmartHCL TechnologiesInfo Edge India (Naukri.com)

Given a singly linked list of integers. Your task is to return the head of the reversed linked list.

For example:
The given linked list is 1 -> 2 -> 3 -> 4-> NULL. Then the reverse linked list is 4 -> 3 -> 2 -> 1 -> NULL and the head of the reversed linked list will be 4.
Follow Up :
Can you solve this problem in O(N) time and O(1) space complexity?
Problem approach

The idea is to use three pointers curr, prev, and next to keep track of nodes to update reverse links.
Step-1 : First break the link of 'curr' node and point it to 'prev'(i.e. NULL) 
Step-2 : Now before moving 'curr' on to next node make sure to point 
Step-3 : prev' pointer at 'curr' (It is neccessary to do so otherwise we might lose track of rest of the linkedlist) and then make curr = next node

Try solving now

2. Jump Game

Moderate
15m average time
85% success
0/80
Asked in companies
Deutsche BankGoldman SachsAmazon

You have been given an array 'ARR' of ‘N’ integers. You have to return the minimum number of jumps needed to reach the last index of the array i.e ‘N - 1’.


From index ‘i’, we can jump to an index ‘i + k’ such that 1<= ‘k’ <= ARR[i] .


'ARR[i]' represents the maximum distance you can jump from the current index.


If it is not possible to reach the last index, return -1.


Note:
Consider 0-based indexing.
Example:
Consider the array 1, 2, 3, 4, 5, 6 
We can Jump from index 0 to index 1
Then we jump from index 1 to index 2
Then finally make a jump of 3 to reach index N-1

There is also another path where
We can Jump from index 0 to index 1
Then we jump from index 1 to index 3
Then finally make a jump of 2 to reach index N-1

So multiple paths may exist but we need to return the minimum number of jumps in a path to end which here is 3.
Problem approach

Step-1 : Initialize a variable reach to 0, which represents the farthest index that can be reached so far.
Step-2 : Loop through the array nums and for each index i, do the following:
a. If i is greater than reach or reach is greater than or equal to nums.length - 1, break the loop as it means 
reaching the last index is not possible.
b. Update the value of reach as the maximum of reach and i + nums[i].
Step-3 : Return reach >= nums.length - 1, which means that the last index can be reached or not.

Try solving now
02
Round
Medium
Video Call
Duration60 minutes
Interview date13 Aug 2022
Coding problem2

This was also a technical round focused mainly on problem solving and data structures

1. Sort An Array of 0s, 1s and 2s

Easy
10m average time
90% success
0/40
Asked in companies
IBMSamsungDirecti

You have been given an array/list 'arr' consisting of 'n' elements.


Each element in the array is either 0, 1 or 2.


Sort this array/list in increasing order.


Do not make a new array/list. Make changes in the given array/list.


Example :
Input: 'arr' = [2, 2, 2, 2, 0, 0, 1, 0]

Output: Final 'arr' = [0, 0, 0, 1, 2, 2, 2, 2]

Explanation: The array is sorted in increasing order.
Try solving now

2. Product of Array Except Self

Easy
26m average time
0/40
Asked in companies
IntuitQualcommFacebook

You have been given an integer array/list (ARR) of size N. You have to return an array/list PRODUCT such that PRODUCT[i] is equal to the product of all the elements of ARR except ARR[i]

 Note :
Each product can cross the integer limits, so we should take modulo of the operation. 

Take MOD = 10^9 + 7 to always stay in the limits.
Follow up :
Can you try solving the problem in O(1) space?
Problem approach

Step-1 : We are required to solve this problem without using the division operator. We can do this by calculating two arrays pre and suf where pre[i] contains product of all nums[j] such that j <= i, and suf[i] contains product of all nums[j] such that j >= i.
Step-2 : Finally, the resulting array ans can be calculated as ans[i] = pre[i-1] * suf[i+1] which is product of all elements with index less than i multiplied by product of all elements with index greater than i. This is essentially equal to product of array except self at each index.

Try solving now
03
Round
Medium
HR Round
Duration30 minutes
Interview date14 Aug 2022
Coding problem1

This was final HR round.
Interviewer was very humble and supportive

1. Basic HR Questions

Tell me about yourself other than the things in resume

Why do you want to work for our company?

Why should we hire you?

Problem approach

Tip 1 : Do not ask the interviewer what he wants to know about you. 
Tip 2 : Introduce yourself by including certain adjectives like problem-solving, innovation and tech-savvy, 
creative, quick learner, etc. that best describe you in your professional life to boost your chances.
Tip 3 : Be confident and tell about extra curricular activities and achievements

Here's your problem of the day

Solving this problem will increase your chance to get selected in this company

Skill covered: Programming

How do you remove whitespace from the start of a string?

Choose another skill to practice
Similar interview experiences
company logo
SDE - 1
3 rounds | 6 problems
Interviewed by OLX Group
793 views
0 comments
0 upvotes
company logo
SDE - 1
3 rounds | 6 problems
Interviewed by OLX Group
803 views
0 comments
0 upvotes
company logo
SDE - 1
3 rounds | 6 problems
Interviewed by OLX Group
708 views
0 comments
0 upvotes
company logo
System Engineer
3 rounds | 6 problems
Interviewed by OLX Group
613 views
0 comments
0 upvotes
Companies with similar interview experiences
company logo
SDE - Intern
3 rounds | 6 problems
Interviewed by Amazon
15605 views
4 comments
0 upvotes
company logo
SDE - Intern
4 rounds | 7 problems
Interviewed by Microsoft
15499 views
1 comments
0 upvotes
company logo
SDE - Intern
2 rounds | 4 problems
Interviewed by Amazon
10216 views
2 comments
0 upvotes