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

SDE - 1

Delhivery
upvote
share-icon
4 rounds | 4 Coding problems

Interview preparation journey

expand-icon
Preparation
Duration: 6 months
Topics: DSA , Array , String , Linkedlist , Tree, Graph , DP , JavaScript , Angular , HTML ,CSS
Tip
Tip

Tip 1 : If you are beginner start practising topic wise easy question . Then only move to medium level question . Practice 500 DSA questions on any famous platform ( interview bit , Geeksforgeeks ) . 
Tip 2 : You should have atleast one good project in frontend , fullstack or backend . For frontend roles prepare Javascript from Javascript.info , Namaste Javascript .
Tip 3 : Keep appearing for interview , keep learning from those interview till you get your dream job .

Application process
Where: Referral
Eligibility: No
Resume Tip
Resume tip

Tip 1 : Your resume should contain platform links where you practice DSA problems.
Tip 2 : Your contribution to project and techstack you used should be clearly mentioned .

Interview rounds

01
Round
Easy
Online Coding Interview
Duration45 minutes
Interview date10 Mar 2021
Coding problem1

2 Coding question 10 MCQs 
1. Array Easy level 
2. String Medium level ( Based on some counting of characters and palindrome check )

1. Rotated Array

Moderate
10m average time
90% success
0/80
Asked in companies
OlaPaytm (One97 Communications Limited)Amazon

You are given an array 'arr' of size 'n' having unique elements that has been sorted in ascending order and rotated between 1 and 'n' times which is unknown.


The rotation involves shifting every element to the right, with the last element moving to the first position. For example, if 'arr' = [1, 2, 3, 4] was rotated one time, it would become [4, 1, 2, 3].


Your task is to find the minimum number in this array.


Note :
All the elements in the array are distinct. 


Example :
Input: arr = [3,4,5,1,2]

Output: 1

Explanation: The original array was [1,2,3,4,5] and it was rotated 3 times.


Try solving now
02
Round
Medium
Video Call
Duration60 Minutes
Interview date11 Feb 2022
Coding problem1

Timing 3:00 PM - 4:00 PM 
Interviewer was girl , she was pretty cool , having patience .
Started with introduction .
Asked two coding question 
Interview went well .

1. Validate BST

Moderate
25m average time
0/80
Asked in companies
FacebookAmazonFreshworks

You have been given a binary tree of integers with N number of nodes. Your task is to check if that input tree is a BST (Binary Search Tree) or not.

A binary search tree (BST) is a binary tree data structure which has the following properties.

• The left subtree of a node contains only nodes with data less than the node’s data.
• The right subtree of a node contains only nodes with data greater than the node’s data.
• Both the left and right subtrees must also be binary search trees.
Example :

BST1

Answer :

Level 1: 

All the nodes in the left subtree of 4 (2, 1, 3) are smaller 
than 4, all the nodes in the right subtree of the 4 (5) are 
larger than 4.

Level 2 :

For node 2:
All the nodes in the left subtree of 2 (1) are smaller than 
2, all the nodes in the right subtree of the 2 (3) are larger than 2.
For node 5:
The left and right subtrees for node 5 are empty.

Level 3:

For node 1:
The left and right subtrees for node 1 are empty.
For node 3:
The left and right subtrees for node 3 are empty.

Because all the nodes follow the property of a binary search tree, the above tree is a binary search tree.
Try solving now
03
Round
Easy
Video Call
Duration60 Minutes
Interview date15 Mar 2021
Coding problem1

Timing 3:00 -4:00 PM 
Connected on google meet
Interviewer was again very polite and cool

1. System Design Question

Implement Flipkart search bar ,
Explain topics ; like promise , lexical enviroment ,closurs

Problem approach

Tip 1 : Questions like implement search bar , they want to check if you know use cases for debouching or not 
Tip 2 : For each topics like promise , function closure be prepared with one example of use case .
Tip 3 : Be familiar with codesandbox also , since may be you have to write code there also .

04
Round
Easy
Video Call
Duration60 Minutes
Interview date15 Feb 2022
Coding problem1

Managerial Round

1. Basic HR Questions

Why you want to join Delhivery?
What if some FAANG companies provide same compensation as us

Problem approach

Tip 1 : Do well research about compnay 
Tip 2 : Tell why you are excited to join that company

Here's your problem of the day

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

Skill covered: Programming

What is the purpose of the < title > tag in HTML?

Choose another skill to practice
Similar interview experiences
company logo
SDE - 1
3 rounds | 3 problems
Interviewed by Delhivery
987 views
0 comments
0 upvotes
company logo
SDE - 1
3 rounds | 5 problems
Interviewed by Delhivery
838 views
0 comments
0 upvotes
company logo
SDE - 1
3 rounds | 6 problems
Interviewed by Delhivery
942 views
0 comments
0 upvotes
company logo
SDE - 1
1 rounds | 3 problems
Interviewed by Delhivery
174 views
0 comments
0 upvotes
Companies with similar interview experiences
company logo
SDE - 1
1 rounds | 2 problems
Interviewed by Tata Consultancy Services (TCS)
0 views
0 comments
0 upvotes
company logo
SDE - 1
3 rounds | 4 problems
Interviewed by Tata Consultancy Services (TCS)
6339 views
0 comments
0 upvotes
company logo
SDE - 1
2 rounds | 3 problems
Interviewed by BNY Mellon
5575 views
3 comments
0 upvotes