i
Delhivery
Filter interviews by
Clear (1)
I was interviewed in Jan 2021.
Round duration - 120 minutes
Round difficulty - Medium
Due to pandemic placement process went virtual. Test was conducted at 10 A.M.
Your task is to decode a given encoded string back to its original form.
An encoded string format is <count>[encoded_string], where the 'encoded_string...
The task is to decode an encoded string back to its original form by repeating the encoded string 'count' times.
Parse the input string to extract the count and the encoded string within the brackets
Use recursion to decode the encoded string by repeating it 'count' times
Handle nested encoded strings by recursively decoding them
Output the decoded string for each test case
For a given singly linked list, identify if a loop exists and remove it, adjusting the linked list in place. Return the modified linked list.
A...
Detect and remove loop in a singly linked list in place with O(n) time complexity and O(1) space complexity.
Use Floyd's Cycle Detection Algorithm to identify the loop in the linked list.
Once the loop is detected, use two pointers approach to find the start of the loop.
Adjust the pointers to remove the loop and return the modified linked list.
Example: For input 5 2 and 1 2 3 4 5, output should be 1 2 3 4 5.
You are provided with a string EXP
which represents a valid infix expression. Your task is to convert this given infix expression into a postfix expression.
An i...
Convert a given infix expression to postfix expression.
Use a stack to keep track of operators and operands.
Follow the rules of precedence for operators (*, / have higher precedence than +, -).
Handle parentheses by pushing them onto the stack and popping when closing parenthesis is encountered.
Round duration - 30 minutes
Round difficulty - Medium
Due to pandemic placement process went virtual. Test was conducted at 2 P.M.
Given a string 'STR' composed of lowercase English letters, identify the character that repeats first in terms of its initial occurrence.
STR =...
The task is to find the first repeated character in a given string of lowercase English letters.
Iterate through the string and keep track of characters seen so far in a set.
If a character is already in the set, return it as the first repeated character.
If no repeated character is found, return '%'.
Round duration - 45 minutes
Round difficulty - Medium
Video Call interview where the interview happened for around 45 minutes.
You are provided with a binary tree consisting of N
nodes where each node has an integer value. The task is to determine the maximum sum achievable by a...
Find the maximum sum achievable by a simple path between any two nodes in a binary tree.
Traverse the binary tree to find all possible paths and calculate their sums.
Keep track of the maximum sum encountered during traversal.
Consider paths that may include the same node twice.
Implement a recursive function to explore all paths in the tree.
Optimize the solution to avoid redundant calculations.
Round duration - 30 minutes
Round difficulty - Easy
Video Call interview where the interview happened for around 30 minutes.
Tip 1 : Practise 5 problems daily from websites like hackerrank, codechef, codeforces
Tip 2 : Participate in codechef, codeforces contest.
Tip 3 : Attend mock interviews and should have good communication skills.
Tip 1 : Maintain atleast 2 different projects, write powerful summary statement.
Tip 2 : Maintain skills relevant to job description, include relevant experience.
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
I applied via Indeed and was interviewed in Oct 2023. There was 1 interview round.
I applied via Company Website and was interviewed in Apr 2024. There was 1 interview round.
I am a software developer with 5 years of experience in Java and Python.
Experienced in Java and Python programming languages
Worked on various projects involving web development and data analysis
Familiar with Agile methodologies and version control systems like Git
posted on 13 Mar 2024
I was interviewed before Mar 2023.
Use a greedy algorithm to send the office bus to all locations in the city efficiently.
Start from the office location and pick the nearest location to visit next.
Continue picking the nearest unvisited location until all locations are covered.
Repeat the process until all locations are visited.
Consider using Dijkstra's algorithm or a similar approach for finding the nearest location.
Optimize the route by considering traf
I applied via Approached by Company and was interviewed in Apr 2022. There were 4 interview rounds.
The current project follows a microservices architecture.
The project is divided into multiple small services that communicate with each other through APIs.
Each service is responsible for a specific functionality.
The services are deployed independently and can be scaled as per the demand.
The project uses Docker containers for easy deployment and management.
The communication between services is secured using HTTPS protoc...
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