Delhivery interview experience Real time questions & tips from candidates to crack your interview
SDE - 1
Delhivery
1 rounds | 3 Coding
problems
Selected Interview preparation journey
Journey
I began by understanding what a programming language is and started learning C/C++ in my first year of college. Gradually, I learned Java, DSA basics, and Web Development in my second year. During this time, I also interned with Pepcoding, where I wrote articles for their DSA courses. In my third year, I honed my skills using various coding platforms. As a result, I successfully cracked the SDE-1 role at Chaayos (off-campus) in my third year and later secured an offer from Delhivery, which was the first company to visit my campus.
Application story
Simply applied in on campus where we were asked to put our resumes. There was no such CGPA criteria for application. Initial process just involved submitting our resumes.
Why selected/rejected for the role?
I first cleared the written(coding) round and then was able to answer all the questions in my interview with confidence.
Preparation
Duration: 12 months
Topics: Dynamic Programming, Graphs, Binary Search, HashMap and Heaps, Stacks and Queues, Linked Lists, Greedy Algorithms, OOPS, DBMS, OS, Computer Networking
Tip 1: First, understand the basic working (at the memory level) of the data structures you are studying. Focus on understanding the basic CRUD operations for that data structure. Once you have a clear understanding, move on to solving related questions.
Tip 2: Don’t just watch course videos and copy the solutions. Try to come up with solutions on your own, even if they are slightly less optimized. Later, you can watch the videos to learn the most optimized approach.
Application process
Where: Campus
Eligibility: Above 7 CGPA (Salary package: 11 LPA)
Tip 1: Mention only the skills you are confident in, so that if the interviewer asks questions about them, you can answer effectively.
Tip 2: Keep your resume short, precise, and to the point. Avoid adding anything unrelated to the role you are applying for.
Interview rounds
01
Round
Medium
Video Call
Duration60 minutes
Interview date19 Jun 2023
Coding problem3
The interview was at 10:15 am in the morning.
The interviewer was very friendly and first he made sure that I was comfortable and he helped me cool down my nerves.
1. Sort An Array of 0s, 1s and 2s
Easy
10m average time
90% success
0/40
Asked in companies
Given an array nums with n objects coloured red, white, or blue, sort them in-place so that objects of the same colour are adjacent, with the colours in the order red, white, and blue.
We will use the integers 0, 1, and 2 to represent the colour red, white, and blue, respectively.
You must solve this problem without using the library's sort function.
Problem approach
1. First I told the normal solution, where we iterate the array once and count all the 0s, 1s and 2s, and then in the second iteration we fill the array with those many numbers of 0s, 1s and 2s respectively. The interviewer asked me to solve it in 1 iteration.
2. Then I spent some time in thinking and gave him the optimised approach which is to sort this array using DNF sort algorithm. I explained the DNF sort approach and then he gave me the time to code it. Interviewer was satisfied with the approach.
2. System Design
What is diamond of death problem in OOPS? Can this problem arise in your programming language? (Learn)
Problem approach
Tip 1: First discuss what the interviewer exactly wants to know.
Tip 2: Give the answer in as much detail as possible. This helps in building the trust of the interviewer that you know the answer really well and you have studied well, also this helps in taking up the interview time so that less time remains for the questions that the interviewer might ask next and you might not know the answer to them.
3. Minimum Coins
Moderate
30m average time
70% success
0/80
Asked in companies
You are given an integer array ‘coins’ representing coins of different denominations and an integer amount representing a total amount of money. Return the fewest number of coins that you need to make up that amount. If that amount of money cannot be made up by any combination of the coins, return -1. You may assume that you have an infinite number of each kind of coin.
Problem approach
1. First gave the brute force (recursive) solution of this problem which tries all possible solutions. This was jut discussed orally and interviewer asked me not to code this, but optimise the approach.
2. Then I told him that this can be optimised using Dynamic Programming (DP. I gave the memoization approach and coded it, the interviewer ran approx 20 test cases with me on this and all of them gave correct answer. I then told him that I can further go into tabulation to solve this, he listened the approach and asked me not to code it.
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 recursion?
Choose another skill to practice
Similar interview experiences
SDE - 1
3 rounds | 4 problems
Interviewed by Delhivery
Selected 
1465 views
0 comments
0 upvotes
SDE - 1
3 rounds | 3 problems
Interviewed by Delhivery
Selected 1326 views
0 comments
0 upvotes
SDE - 1
3 rounds | 5 problems
Interviewed by Delhivery
Selected 1055 views
0 comments
0 upvotes
SDE - 1
3 rounds | 6 problems
Interviewed by Delhivery
Selected 1228 views
0 comments
0 upvotes
Companies with similar interview experiences
SDE - 1
2 rounds | 3 problems
Interviewed by BNY Mellon
Selected 6261 views
3 comments
0 upvotes
SDE - 1
3 rounds | 6 problems
Interviewed by BNY Mellon
Selected 0 views
0 comments
0 upvotes
SDE - 1
3 rounds | 5 problems
Interviewed by CIS - Cyber Infrastructure
Selected 2159 views
0 comments
0 upvotes