i
Ecom Express
Filter interviews by
Clear (1)
posted on 22 Jun 2024
I applied via Campus Placement and was interviewed before Jun 2023. There were 2 interview rounds.
Aptitude as well as CS funda mental questions and output questions were there
Top trending discussions
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...
posted on 22 Jul 2023
I applied via Recruitment Consulltant and was interviewed in Jun 2023. There were 4 interview rounds.
It was a normal aptitude test with mathematical questions.
It was a techno-coding test where I had to code while sharing my screen on a live conversation with the interviewer.
I would analyze the current approach, identify the root cause of the issue, brainstorm alternative solutions, and collaborate with the team to implement and test them.
Analyze the current approach to identify weaknesses
Brainstorm alternative solutions with the team
Implement and test the new solutions
Regularly communicate and collaborate with team members
I applied via Hirist and was interviewed in Apr 2024. There were 2 interview rounds.
I applied via Walk-in and was interviewed before Jan 2021. There were 4 interview rounds.
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 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 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 Recruitment Consulltant and was interviewed before Feb 2022. There were 3 interview rounds.
Find the longest palindromic substring in a given string.
Use dynamic programming to solve the problem efficiently.
Start with the base cases of single characters and two characters.
For longer substrings, check if the first and last characters match and if the substring between them is also a palindrome.
Keep track of the longest palindrome seen so far.
Time complexity: O(n^2), space complexity: O(n^2).
Developing a real-time data processing system for a high-traffic website.
Designing a scalable architecture to handle the high volume of incoming data.
Optimizing the data processing algorithms to minimize latency.
Ensuring data consistency and accuracy in a distributed system.
Implementing fault-tolerant mechanisms to handle system failures.
Testing and debugging the system under various load conditions.
based on 1 interview
Interview experience
Supervisor
498
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Executive
386
salaries
| ₹0 L/yr - ₹0 L/yr |
Operations Executive
360
salaries
| ₹0 L/yr - ₹0 L/yr |
Assistant Manager
309
salaries
| ₹0 L/yr - ₹0 L/yr |
Executive
258
salaries
| ₹0 L/yr - ₹0 L/yr |
Delhivery
Blue Dart Express
DTDC Express
GATI-KWE