New update is available. Click here to update.

Delhivery Interview Experience for Experienced SDE - 1, Aug 2020

Posted: 9 Jan 2021

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:

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.

Try Problem

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 find the sm...

Try Problem

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.

Try Problem

Preparation

Duration:

2 months

Topics:

DS, Algorithms, OOPS, Dynamic Programming, System Design, Java Spring

Preparation Tip

Tip 1 : Practice At least 300 questions
Tip 2 : Build Resume according to Job Description
Tip 3 : Working with Big Data/Distributed Systems is a Plus

Application Process

Where:

Other

Eligibility:

1+ year of Experience

Resume Tip

Tip 1 : Skills relevant to Job Description
Tip 2 : Do not put false things on a resume, in-depth of knowledge of everything there on the resume

22 upvotes

Have an interview experience that you want to contribute?

PreviousNext

Join the Discussion

2 replies

Mohit Bansal |Level 4

15 Jan 2021

package?

4 upvotes

1 reply

Victim |Level 2

3 Feb 2021

Comment Removed

0 upvotes

0 replies

Delhivery Mock Interviews

For college students & professionals looking to get into Delhivery

Similar Experiences

Delhivery | Experienced

Delhivery | Experienced

Delhivery | Experienced

Delhivery | Experienced

Categories:

Coding courses for beginners |

Web Development Courses |

Data Science & Machine Learning Courses |

Competitive Programming Course |

Android App Development Courses |

Courses for interview preparation

Popular Courses:

C++ Foundation with Data Structures |

Java Foundation with Data Structures |

Python Foundation with Data Structures |

Competitive Programming |

Full Stack Web Development

Career Tracks:

Ninja Competitive Programmer Track |

Ninja Android Developer Career Track |

Ninja Web Developer Career Track - NodeJS & ReactJs |

Ninja Web Developer Career Track - NodeJS |

Ninja Data Scientist Career Track |

Ninja Machine Learning Engineer Career Track

Delhivery Interview Experience for Experienced SDE - 1, Aug 2020

Interview Process

Video Call

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.

You are given an array 'ARR' consisting of 'N' positive numbers and sorted in non-decreasing order, and your task is to find the sm...

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.

Preparation

Application Process

Similar Experiences

Interested in Coding Ninjas Flagship Courses?