Filter interviews by
I appeared for an interview in Jul 2024.
Simplification,profit and loss,some of questions form database
Joins in database are used to combine rows from two or more tables based on a related column between them.
Joins are used to retrieve data from multiple tables based on a related column.
Common types of joins include INNER JOIN, LEFT JOIN, RIGHT JOIN, and FULL JOIN.
Example: SELECT * FROM table1 INNER JOIN table2 ON table1.column = table2.column;
I applied via Campus Placement and was interviewed before Nov 2021. There were 2 interview rounds.
A ship is a vessel that floats on water and is propelled by engines or sails.
Ships are designed to displace water and stay afloat.
They are powered by engines or sails, which provide the necessary thrust to move the ship forward.
Ships have various systems for navigation, communication, and safety, such as radar, GPS, radio, and lifeboats.
They can carry cargo, passengers, or both, and are used for transportation, trade, ...
Top trending discussions
I applied via Recruitment Consultant and was interviewed in Jun 2021. There was 1 interview round.
DHCP is a protocol that assigns IP addresses to devices on a network. DNS is a system that translates domain names to IP addresses.
DHCP assigns IP addresses to devices on a network
DNS translates domain names to IP addresses
DHCP reduces the need for manual IP address configuration
DNS allows users to access websites using domain names instead of IP addresses
I applied via Naukri.com and was interviewed in Mar 2021. There was 1 interview round.
I appeared for an interview 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
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 Campus Placement and was interviewed before Sep 2020. There were 4 interview rounds.
I applied via Walk-in and was interviewed before Dec 2021. There were 4 interview rounds.
based on 1 interview
Interview experience
based on 33 reviews
Rating in categories
Executive
16
salaries
| ₹2 L/yr - ₹4.5 L/yr |
Executive Accountant
9
salaries
| ₹2 L/yr - ₹4.2 L/yr |
Senior Executive
8
salaries
| ₹3.5 L/yr - ₹6.5 L/yr |
Assistant Manager
5
salaries
| ₹4.8 L/yr - ₹19.5 L/yr |
Accountant
5
salaries
| ₹6 L/yr - ₹8.5 L/yr |
Delhivery
Ecom Express
Maersk
DTDC Express