Delhivery Interview Experience for Experienced SDE - 1, Aug 2020
Posted: 9 Jan 2021
22
Selected
Interview Rounds 
Application Process Round 1
Round 2
Round 3
Interview Process
Video Call
Moderate
Duration:
90 minutes
Interview-Date:
22 Aug 2020
Problems:
3
This was a Data Structures round. Both questions were answered in optimal time complexity with clean code. Every other question was answered to the best of my knowledge
Rotting Oranges You are given an undirected and disconnected graph G(V, E) having V vertices numbered from 0 to V-1 and E edges. Your task is to print its BFS traversal starting from the 0th vertex.
View more
Find Smallest Integer You are given an array 'ARR' consisting of 'N' positive numbers and sorted in non-decreasing order, and your task is to...
View more
BFS in Graph You are given an undirected and disconnected graph G(V, E) having V vertices numbered from 0 to V-1 and E edges. Your task is to print its BFS traversal starting from the 0th vertex.
View more
Next
Round - 2 
PreviousNext
Join the Discussion
2 replies
Comment Removed
0 upvotes
Education :
Guru Gobind Singh Indraprastha University
Computer Science Engineering
•
8.4 CGPA
Delhivery Mock Interviews
For college students & professionals looking to get into Delhivery
package?