i
Delhivery
Filter interviews by
Clear (1)
Patch is used to update a specific part of a resource, while put is used to replace the entire resource.
Patch is used for partial updates, while put is used for full updates.
Patch is idempotent, meaning multiple identical patch requests will have the same effect as a single request, while put is not necessarily idempotent.
Example: Using patch to update the title of a blog post without affecting other fields, while usin...
Asked about schema for ecommerce and a coding question
OOPs concepts are the fundamental principles of object-oriented programming.
Encapsulation - binding data and functions together in a single unit
Inheritance - creating new classes from existing ones
Polymorphism - ability of objects to take on many forms
Abstraction - hiding implementation details from the user
Examples: class, object, inheritance, encapsulation, polymorphism, abstraction
Spring Boot is a framework for building standalone, production-grade Spring-based applications.
Spring Boot simplifies the process of creating and deploying Spring-based applications.
It provides a set of pre-configured dependencies and an embedded web server.
It also offers features like auto-configuration, which reduces the need for manual configuration.
Spring Boot is widely used for building microservices and RESTful A...
Delhivery interview questions for designations
I was interviewed before Sep 2020.
Round duration - 90 minutes
Round difficulty - Medium
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
You are given an undirected and disconnected graph G(V, E) with V vertices numbered from 0 to V-1 and E edges. Your task is to perform a BFS traversal starting from the 0...
Perform BFS traversal on an undirected and disconnected graph starting from vertex 0.
Implement BFS traversal algorithm starting from vertex 0
Use a queue to keep track of visited nodes and their neighbors
Print the traversal order in sorted order for each node's connected nodes
Given a non-decreasing sorted array ARR
of N
positive numbers, determine the smallest positive integer that cannot be expressed as the sum of elements from...
Find the smallest positive integer that cannot be expressed as the sum of elements from any proper subset of a non-decreasing sorted array of positive numbers.
Start with the smallest possible sum that can be represented, which is 1.
Iterate through the array and update the smallest sum that cannot be represented.
Return the final smallest sum that cannot be represented.
Given an undirected and disconnected graph G(V, E) where V vertices are numbered from 0 to V-1, and E represents edges, your task is to output the BFS traversal starting from the ...
BFS traversal of an undirected and disconnected graph starting from vertex 0.
Implement BFS algorithm to traverse the graph starting from vertex 0.
Use a queue to keep track of visited nodes and their neighbors.
Ensure to visit all connected components of the graph.
Print the BFS traversal sequence for each test case in a separate line.
Handle cases where not all vertices are reachable from vertex 0.
Round duration - 100 minutes
Round difficulty - Easy
Mostly technical and System Design questions were asked.
Design an LRU cache to store least recently used items efficiently.
Use a combination of a doubly linked list and a hashmap to store and retrieve items in O(1) time complexity.
When an item is accessed, move it to the front of the linked list to mark it as the most recently used.
If the cache is full, remove the least recently used item from the end of the linked list and the hashmap.
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
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
Get interview-ready with Top Delhivery Interview Questions
I applied via Campus Placement and was interviewed before Dec 2020. There were 4 interview rounds.
Design a stack that supports getmin in O(1) time and O(1) space complexities.
Use two stacks, one for storing the actual values and the other for storing the minimum values.
When pushing a new value, check if it is smaller than the current minimum value and push it to the minimum stack if it is.
When popping a value, check if it is the current minimum value and pop it from the minimum stack if it is.
To get the minimum val...
Binary tree traversal is the process of visiting each node in a binary tree exactly once in a specific order.
There are three main types of binary tree traversal: inorder, preorder, and postorder.
Inorder traversal visits the left subtree, then the root, then the right subtree.
Preorder traversal visits the root, then the left subtree, then the right subtree.
Postorder traversal visits the left subtree, then the right subt...
LRU cache is a data structure that stores the most recently used items and discards the least recently used items.
LRU stands for Least Recently Used
It has a fixed size and when the cache is full, the least recently used item is removed to make space for a new item
It uses a combination of a doubly linked list and a hash map to achieve O(1) time complexity for both insertion and deletion
Example: A web browser cache that ...
I applied via Recruitment Consultant and was interviewed in May 2020. There were 3 interview rounds.
Diameter of a binary tree is the longest path between any two leaf nodes.
Calculate the height of left and right subtrees recursively.
Calculate the diameter recursively using the formula max(left_height + right_height + 1, max(left_diameter, right_diameter)).
Return the maximum diameter.
To find interchanged terms from an AP series
Identify the common difference between terms
Swap the positions of adjacent terms
Check if the new series is also an AP
Repeat until no more interchanged terms can be found
Database indexing is a technique to improve the performance of database queries.
Indexing creates a data structure that allows for faster retrieval of data.
Indexes are created on one or more columns of a table.
Queries that use indexed columns can be executed faster.
Indexes can be clustered or non-clustered.
Clustered indexes determine the physical order of data in a table.
Non-clustered indexes create a separate structure...
Top trending discussions
posted on 19 Nov 2024
I applied via Referral and was interviewed before Nov 2023. There were 2 interview rounds.
The basic questions asked in an interview .
DP, graph, and array questions asked in 2nd round also asked my company project
I applied via Naukri.com and was interviewed in May 2024. There was 1 interview round.
Decorator in Python is a design pattern that allows adding new functionality to an existing object without modifying its structure.
Decorators are functions that take another function as an argument and extend its behavior without explicitly modifying it.
They are commonly used to add logging, timing, caching, or authentication to functions.
Syntax for using decorators in Python involves using the @ symbol followed by the...
yield is a keyword in Python used in generator functions to return a value without terminating the function
yield is used in generator functions to produce a series of values over time
When a generator function is called, it returns an iterator object but does not start execution immediately
Each time the yield statement is reached, the function's state is saved, and the value is returned to the caller
Execution of the fun...
posted on 23 Aug 2024
My name is John Smith.
Full name is John Smith
Common name in English-speaking countries
No middle name or initial
In my free time, I enjoy hiking, playing video games, and learning new programming languages.
Hiking in local trails and national parks
Playing video games like Overwatch and Minecraft
Learning new programming languages like Python and JavaScript
Some of the top questions asked at the Delhivery Software Developer interview -
based on 3 interviews
1 Interview rounds
based on 25 reviews
Rating in categories
Team Lead
1.4k
salaries
| ₹0 L/yr - ₹0 L/yr |
Executive
1.3k
salaries
| ₹0 L/yr - ₹0 L/yr |
Manager
723
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Executive
684
salaries
| ₹0 L/yr - ₹0 L/yr |
Assistant Manager
621
salaries
| ₹0 L/yr - ₹0 L/yr |
Blue Dart Express
Ecom Express
GATI-KWE
DTDC Express