Filter interviews by
I applied via Company Website and was interviewed in Aug 2024. There were 2 interview rounds.
Good round. simple questions
Object-oriented programming paradigm focusing on objects and classes for code organization and reusability.
Encapsulation: Bundling data and methods that operate on the data into a single unit (object)
Inheritance: Ability of a class to inherit properties and behavior from another class
Polymorphism: Ability to present the same interface for different data types
I applied via Company Website and was interviewed before Jan 2024. There were 2 interview rounds.
Normal maths and verbals
Basic c plus plus question
Top trending discussions
I applied via Approached by Company and was interviewed in Oct 2024. There were 2 interview rounds.
Find the longest sequence of ascending numbers in an array.
Iterate through the array and keep track of the current sequence length
Reset the sequence length when a number is not in ascending order
Return the longest sequence found
Find a pair of numbers in a list that subtract to a target value
Iterate through the list of numbers and store each number in a hashmap along with its index
For each number, check if the difference between the target and the number exists in the hashmap
Return the pair of numbers if found, otherwise return an empty array
Proper JSON format requires correct syntax, including quotes, commas, and brackets.
Ensure all keys are in double quotes: {"key": "value"}.
Use commas to separate key-value pairs: {"key1": "value1", "key2": "value2"}.
Arrays should be enclosed in brackets: ["item1", "item2"].
Strings must be in double quotes: "string".
No trailing commas are allowed after the last item.
Calculate mean, median, and sum of unique values from a JSON object.
Use a Set to filter unique values from the JSON array.
Calculate the sum using Array.reduce() method.
For mean, divide the sum by the count of unique values.
To find median, sort the unique values and find the middle value.
I applied via Recruitment Consultant and was interviewed in Jun 2021. There was 1 interview round.
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 Indeed and was interviewed in Oct 2023. There was 1 interview round.
I appeared for an interview in Apr 2025, where I was asked the following questions.
CI/CD pipeline automates software development processes, enabling continuous integration and delivery for faster, reliable releases.
Continuous Integration (CI) involves automatically testing and merging code changes into a shared repository.
Continuous Delivery (CD) ensures that code changes are automatically prepared for release to production.
Tools like Jenkins, GitLab CI, and CircleCI are commonly used to implement CI...
I applied via Approached by Company and was interviewed before Oct 2023. There were 2 interview rounds.
Dynamic Programming problem involving finding the maximum sum of non-adjacent elements in an array.
Use dynamic programming to keep track of the maximum sum at each index.
At each index, the maximum sum is either the current element plus the sum two indices back, or the sum at the previous index.
Example: For array [2, 4, 6, 2, 5], the maximum sum of non-adjacent elements is 13 (2 + 6 + 5).
Find the longest common prefix among an array of strings.
Iterate through the characters of the first string and compare with other strings
Return the prefix when characters don't match or reach end of any string
Example: Input - ['flower', 'flow', 'flight'], Output - 'fl'
LRU cache is a data structure that stores the most recently used items.
Use a doubly linked list to keep track of the order of items based on their usage.
Use a hashmap to quickly access items in the cache.
When a new item is accessed, move it to the front of the linked list.
If the cache is full, remove the least recently used item from the end of the linked list.
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...
based on 2 interview experiences
Difficulty level
Duration
Warehouse Manager
33
salaries
| ₹2.2 L/yr - ₹6.3 L/yr |
MIS Executive
17
salaries
| ₹1.1 L/yr - ₹3 L/yr |
Executive Accountant
15
salaries
| ₹1.8 L/yr - ₹3.5 L/yr |
Executive
13
salaries
| ₹1 L/yr - ₹2 L/yr |
Supervisor
11
salaries
| ₹2 L/yr - ₹3.3 L/yr |
Delhivery
Ecom Express
Maersk
DTDC Express