Filter interviews by
I applied via LinkedIn and was interviewed in Jun 2024. There were 2 interview rounds.
I applied via Referral and was interviewed in Apr 2024. There were 2 interview rounds.
Normal general knowledge
I appeared for an interview in Oct 2024.
I applied via LinkedIn and was interviewed in Mar 2022. There was 1 interview round.
MIS stands for Management Information System.
MIS is a computer-based system that provides managers with the tools to organize, evaluate and efficiently manage departments within an organization.
It helps in decision-making, problem-solving, and provides real-time information.
MIS includes hardware, software, and personnel to process and analyze data.
Examples of MIS include inventory management systems, sales tracking sys...
3PL stands for Third Party Logistics.
3PL refers to outsourcing logistics and supply chain management to a third-party provider.
It includes services like warehousing, transportation, inventory management, and order fulfillment.
Examples of 3PL providers include DHL, FedEx Supply Chain, and UPS Supply Chain Solutions.
I applied via Walk-in and was interviewed before Feb 2023. There was 1 interview round.
I applied via Company Website and was interviewed in Jan 2022. There were 2 interview rounds.
18/2/2022
I appeared for an interview before Dec 2020.
Round duration - 60 Minutes
Round difficulty - Medium
This round was purely based on Data Structures and Algorithms . One has to be fairly comfortable in solving Algorithmic problems to pass this round . Both the questions asked were quite common and luckily I had already prepared them from CodeStudio and LeetCode.
Given a Binary Tree with 'N' nodes, where each node holds an integer value, your task is to compute the In-Order, Pre-Order, and Post-Order traversals of the binar...
Compute the In-Order, Pre-Order, and Post-Order traversals of a Binary Tree given in level-order format.
Implement functions to perform In-Order, Pre-Order, and Post-Order traversals of a Binary Tree.
Use level-order input to construct the Binary Tree.
Traverse the Binary Tree recursively to generate the required traversals.
Ensure proper handling of null nodes represented by -1 in the input.
Return the three traversals as
Given a Singly Linked List of integers, your task is to reverse the Linked List by altering the links between the nodes.
The first line of input is an intege...
Reverse a singly linked list by altering the links between nodes.
Iterate through the linked list and reverse the links between nodes
Use three pointers to keep track of the current, previous, and next nodes
Update the links between nodes to reverse the list
Return the head of the reversed linked list
Round duration - 45 Minutes
Round difficulty - Medium
This round basically tested some concepts from Data Structures and File Manipulation .
Given two arrays A
and B
with sizes N
and M
respectively, both sorted in non-decreasing order, determine their intersection.
The intersection of two arrays in...
The problem involves finding the intersection of two sorted arrays efficiently.
Use two pointers to iterate through both arrays simultaneously.
Compare elements at the pointers and move the pointers accordingly.
Handle cases where elements are equal and update the intersection array.
Return the intersection array as the result.
Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 3 : Do at-least 2 good projects and you must know every bit of them.
Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects and experiences more.
based on 5 interviews
Interview experience
Area Sales Manager
7
salaries
| ₹4.7 L/yr - ₹6.6 L/yr |
Assistant Manager
5
salaries
| ₹3.6 L/yr - ₹6 L/yr |
Backend Developer
5
salaries
| ₹5 L/yr - ₹8.4 L/yr |
Sales Executive
5
salaries
| ₹1.5 L/yr - ₹3 L/yr |
MIS Analyst
5
salaries
| ₹3 L/yr - ₹4 L/yr |
Flipkart
Amazon
Snapdeal
Paytm