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

Backend Intern

Delhivery
upvote
share-icon
2 rounds | 6 Coding problems

Interview preparation journey

expand-icon
Journey
When I started my BTech, I had no background in coding. It was only in my second year that I decided to begin from scratch and seriously work on improving myself. I started with the basics, practicing Data Structures and Algorithms, and slowly built my problem-solving skills through consistent effort and practice. The journey was not easy, but every day of learning made me more confident. Step by step, I turned my weakness into a strength. Finally, all the hard work paid off when I got the opportunity to interview with Delhivery—and I was able to crack it. This journey taught me that no matter where you start, with consistency, dedication, and the right mindset, you can achieve your goals.
Application story
I came across the opportunity through a link on LinkedIn and applied directly using that. After about a week, I received a call from the HR informing me that I had been shortlisted for the interview process. The process began with a interview conducted by their Team Lead, and finally an interview with the higher engineering manager. Overall, the application journey was smooth and well-structured, and it gave me the chance to showcase my skills at each stage.
Why selected/rejected for the role?
I was selected for this role because I was able to clear both rounds with confidence by showcasing my problem-solving skills and consistency in preparation. My biggest learning is that perseverance pays off—never give up and keep applying, because every effort adds up and one day it will reward you.
Preparation
Duration: 18 months
Topics: Data Structures, OOPS, DBMS, CN, System Design
Tip
Tip

Tip 1: Practice at least 250+ DSA questions to build strong problem-solving skills.
Tip 2: Work on 2-3 real-world projects to showcase practical knowledge.
Tip 3: Revise core CS fundamentals like OOPs, DBMS, and Operating Systems regularly.

Application process
Where: Linkedin
Eligibility: 7.5 CGPA, (Stipend: 25k per month)
Resume Tip
Resume tip

Tip 1: Add impactful and relevant projects to your resume.
Tip 2: Keep your resume updated and ATS-friendly.

Interview rounds

01
Round
Medium
Video Call
Duration60 minutes
Interview date20 May 2025
Coding problem3

It was in the afternoon around 2pm, and the interviewer was really friendly and the interview went well.

1. Computer Networks

What is OSI model? Explain all the layers? (Learn)

Problem approach

Tip 1: Have a good understanding of CS fundamentals.
Tip 2: Be prepared to explain functionality of each layer of OSI model.
Tip 3: Prepare TCP/IP Model as well.

2. SQL

Write a SQL query to print all Student details from Student table order by FIRST_NAME Ascending and MAJOR Subject descending.

Problem approach

Tip: Practice SQL queries thoroughly.

3. K-Distinct Character Substring

Moderate
0/80
Asked in company
Delhivery

You are given a string s consisting of lowercase English alphabets and an integer k. Your task is to find the length of the longest substring of s that contains exactly k distinct characters.


If no such substring exists, you should return -1.


Problem approach

1.Use a sliding window to traverse the string while keeping track of characters in the current window.
2.Maintain a hashmap to store character counts and ensure the number of unique characters ≤ k.
3.Expand or shrink the window accordingly and update the maximum length when exactly k unique characters are present.

Try solving now
02
Round
Medium
Video Call
Duration45 minutes
Interview date20 May 2025
Coding problem3

It was in the evening around 5pm and it was with higher Engineering Manager and the interviewer was really good.

1. Two Sum

Easy
15m average time
83% success
0/40
Asked in companies
DelhiveryErnst & Young (EY)Bank of New York Mellon (BNY Mellon)

Sam want to read exactly ‘TARGET’ number of pages.

He has an array ‘BOOK’ containing the number of pages for ‘N’ books.

Return YES/NO, if it is possible for him to read any 2 books and he can meet his ‘TARGET’ number of pages.

Example:
Input: ‘N’ = 5, ‘TARGET’ = 5
‘BOOK’ = [4, 1, 2, 3, 1] 

Output: YES
Explanation:
Sam can buy 4 pages book and 1 page book.
Problem approach

1.Use a HashSet to store numbers seen so far while iterating through the array.
2.For each element num, check if target - num exists in the set.
3.If found, return true; otherwise, add num to the set and continue until the end.

Try solving now

2. Operating System

What is Deadlock? Discuss Real-life scenarios. (Learn)

Problem approach

Tip 1: Be thorough with the concepts of OS.
Tip 2: Prepare real life situations for deadlock.

3. SQL

List all students and their scholarship amounts if they have received any. If a student has not received a scholarship, display NULL for the scholarship details.

Problem approach

Tip 1: Practice joins in SQL.
Tip 2: Practice as many queries as you can.

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
company logo
SDE - Intern
4 rounds | 5 problems
Interviewed by Delhivery
1450 views
0 comments
0 upvotes
company logo
Associate Software Engineer
4 rounds | 8 problems
Interviewed by Delhivery
1051 views
0 comments
0 upvotes
company logo
SDE - 1
3 rounds | 5 problems
Interviewed by Delhivery
1055 views
0 comments
0 upvotes
company logo
SDE - 1
1 rounds | 3 problems
Interviewed by Delhivery
411 views
0 comments
0 upvotes