Code360 powered by Coding Ninjas X Naukri.com. Code360 powered by Coding
Ninjas X Naukri.com

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

Delhivery

4 rounds | 5 Coding
problems

Preparation

Duration: 3 months

Topics: DS, Algorithms, OOPS, Dynamic Programming, Data Base, Networking

Tip

Tip 1 : Mention some good projects on resume

Tip 2 : Be confident

Tip 3 : Good with computer science basics and ds and algo

Application process

Where: Campus

Eligibility: 7 CGPA

Resume tip

Tip 1 : Good Projects

Tip 2 : Having some achievements is plus point

01

Round

Easy

Online Coding Interview

Duration1 hour and 30 mins

Interview date4 Jan 2021

Coding problem0

10 MCQ each of 4 Marks and 3 Coding Questions in which 2 of them is of 20 marks and 1 of 50 Marks.

02

Round

Medium

Video Call

Duration60 minutes

Interview date5 Jan 2021

Coding problem2

Problem approach

It is a standard problem of DP

I first given him the recursive solution then optimized using dp

```
The width of each bar is the same and is equal to 1.
```

```
Input: â€˜nâ€™ = 6, â€˜arrâ€™ = [3, 0, 0, 2, 0, 4].
Output: 10
Explanation: Refer to the image for better comprehension:
```

```
You don't need to print anything. It has already been taken care of. Just implement the given function.
```

Problem approach

First I gave bruteforce solution then optimized

Approach: to find the highest bar on the left and right, array traversal is needed which reduces the efficiency of the solution. To make this efficient one must pre-compute the highest bar on the left and right of every bar in linear time. Then use these pre-computed values to find the amount of water in every array element.

03

Round

Medium

Video Call

Duration60 minutes

Interview date5 Jan 2021

Coding problem2

```
n = 4, ARR1 = {1, 2, 3, 4}, ARR2 = {-1, 3, 4, 2}
The maximum value of the expression is obtained when indexes â€˜i = 0â€™ and â€˜j = 3â€™. After evaluating the expression, we get:
|ARR1[0] - ARR2[3]| + |ARR2[0] - ARR2[3]| + |0 - 3| => |1 - 4| + |-1 - 2| + |-3| => |-3| + |-3| + 3 => 9
So the answer is 9.
```

Problem approach

first we can easily solve using two for loops

then we can optimize by removing mod operations, doing simple maths

```
Input:
2 4 5 -1
Output:
5 4 2 -1
Explanation: 2->4->5 is the initial linked list. If we reverse this, we get 5->4->2.
```

Problem approach

I gave recursive and iterative approaches then code it.

04

Round

Medium

HR Round

Duration30 minutes

Interview date5 Jan 2021

Coding problem1

This was just a formality round. Questions like Tell me about yourself, Why do you want to join etc

Here's your problem of the day

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

What does HTML stand for?

Choose another skill to practice

Start a Discussion

Similar interview experiences

Associate Software Engineer

4 rounds | 8 problems

Interviewed by Delhivery

785 views

0 comments

0 upvotes

SDE - Intern

3 rounds | 4 problems

Interviewed by Delhivery

789 views

0 comments

0 upvotes

SDE - 1

3 rounds | 4 problems

Interviewed by Delhivery

595 views

0 comments

0 upvotes

SDE - 1

3 rounds | 5 problems

Interviewed by Delhivery

652 views

0 comments

0 upvotes

Companies with similar interview experiences

SDE - Intern

2 rounds | 4 problems

Interviewed by Arcesium

3147 views

0 comments

0 upvotes

SDE - Intern

3 rounds | 5 problems

Interviewed by Arcesium

2117 views

0 comments

0 upvotes

SDE - Intern

3 rounds | 5 problems

Interviewed by BNY Mellon

1901 views

0 comments

0 upvotes