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

SDE - Intern

Delhivery
upvote
share-icon
4 rounds | 5 Coding problems

Interview preparation journey

expand-icon
Preparation
Duration: 3 months
Topics: DS, Algorithms, OOPS, Dynamic Programming, Data Base, Networking
Tip
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
Resume tip

Tip 1 : Good Projects
Tip 2 : Having some achievements is plus point

Interview rounds

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

1. 0-1 Knapsack Problem

Easy
15m average time
85% success
0/40
Asked in companies
PayPalIxigoSwiggy

A thief is robbing a store and can carry a maximal weight of W into his knapsack. There are N items and the ith item weighs wi and is of value vi. Considering the constraints of the maximum weight that a knapsack can carry, you have to find and return the maximum value that a thief can generate by stealing items.

Problem approach

It is a standard problem of DP
I first given him the recursive solution then optimized using dp

Try solving now

2. Trapping Rain Water

Moderate
15m average time
80% success
0/80
Asked in companies
SalesforcePayPalHexaware Technologies

You have been given a long type array/list 'arr’ of size 'n’.


It represents an elevation map wherein 'arr[i]’ denotes the elevation of the 'ith' bar.



Note :
The width of each bar is the same and is equal to 1.
Example:
Input: ‘n’ = 6, ‘arr’ = [3, 0, 0, 2, 0, 4].

Output: 10

Explanation: Refer to the image for better comprehension:

Alt Text

Note :
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.

Try solving now
03
Round
Medium
Video Call
Duration60 minutes
Interview date5 Jan 2021
Coding problem2

1. Maximum value of modulus expression

Moderate
10m average time
90% success
0/80
Asked in companies
GoogleDelhiveryPayPal

You are given two arrays ‘ARR1’ and ‘ARR2’ having equal length ‘N’. Your task is to return the maximum value of the expression:

|ARR1[ i ] - ARR1[ j ]| + |ARR2[ i ] - ARR2[ j ]| + |i - j|, where 0 <= i, j < n and ‘|A|’ represents the absolute (i.e., non-negative) value of ‘A’.

Example:
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

Try solving now

2. Reverse Linked List

Easy
15m average time
85% success
0/40
Asked in companies
AmazonSnapdealPaytm (One97 Communications Limited)


Example:

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.

Try solving now
04
Round
Medium
HR Round
Duration30 minutes
Interview date5 Jan 2021
Coding problem1

1. General Questions

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

Skill covered: Programming

What does HTML stand for?

Choose another skill to practice
Start a Discussion
Similar interview experiences
company logo
Associate Software Engineer
4 rounds | 8 problems
Interviewed by Delhivery
785 views
0 comments
0 upvotes
company logo
SDE - Intern
3 rounds | 4 problems
Interviewed by Delhivery
789 views
0 comments
0 upvotes
company logo
SDE - 1
3 rounds | 4 problems
Interviewed by Delhivery
595 views
0 comments
0 upvotes
company logo
SDE - 1
3 rounds | 5 problems
Interviewed by Delhivery
652 views
0 comments
0 upvotes
Companies with similar interview experiences
company logo
SDE - Intern
2 rounds | 4 problems
Interviewed by Arcesium
3147 views
0 comments
0 upvotes
company logo
SDE - Intern
3 rounds | 5 problems
Interviewed by Arcesium
2117 views
0 comments
0 upvotes
company logo
SDE - Intern
3 rounds | 5 problems
Interviewed by BNY Mellon
1901 views
0 comments
0 upvotes