Filter interviews by
I appeared for an interview in Aug 2024.
Experienced warehouse manager with a proven track record of optimizing operations and maximizing efficiency.
Over 5 years of experience in warehouse management
Implemented inventory control systems resulting in 20% reduction in stock loss
Led a team of 20+ staff members to achieve daily targets
Proficient in using warehouse management software such as WMS and ERP systems
Effective inventory management involves proper forecasting, accurate tracking, efficient storage, and regular audits.
Utilize inventory management software for real-time tracking and forecasting.
Implement ABC analysis to prioritize items based on value and turnover rate.
Establish clear inventory control policies and procedures to minimize errors and discrepancies.
Regularly conduct physical inventory counts and audits to...
Best practices for managing inventory and conducting audits in a warehouse setting
Implement a robust inventory management system to track stock levels and movements
Regularly conduct physical counts of inventory to ensure accuracy
Utilize barcode scanning or RFID technology for efficient tracking
Establish clear procedures for receiving, storing, and picking inventory
Train staff on proper inventory management practices to...
The purpose of a warehouse is to store goods and materials efficiently and safely until they are needed.
Store goods and materials
Facilitate efficient inventory management
Ensure safe storage and handling of products
Enable timely distribution of goods
Reduce transportation costs by consolidating shipments
Closed Circuit Television
CCTV stands for Closed Circuit Television
Used for surveillance and security purposes
Commonly used in public areas, businesses, and homes
Examples include monitoring traffic, preventing theft, and ensuring safety
I applied via Referral and was interviewed before Jan 2021. There was 1 interview round.
I applied via Campus Placement and was interviewed before May 2021. There were 2 interview rounds.
Numerical ability and logical reasoning followed by some coding mcqs
Printing 1 to 100 without for loop
Use recursion to print numbers from 1 to 99
Print 100 outside the recursion
Use a base case to stop recursion at 100
I applied via Campus Placement and was interviewed before Jun 2021. There were 2 interview rounds.
Simple aptitude test
I applied via Recruitment Consultant and was interviewed before Jul 2020. There was 1 interview round.
I applied via Naukri.com
I applied via Newspaper Ad and was interviewed before Jun 2021. There were 3 interview rounds.
I appeared for an interview in Aug 2017.
Merge Sort is a divide and conquer algorithm that sorts an array by dividing it into two halves, sorting them separately, and then merging the sorted halves.
Divide the array into two halves
Recursively sort the two halves
Merge the sorted halves
Find pairs of integers in a BST whose sum is equal to a given number.
Traverse the BST and store the values in a hash set.
For each node, check if (X - node.value) exists in the hash set.
If yes, add the pair (node.value, X - node.value) to the result.
Continue traversal until all nodes are processed.
Merge overlapping time intervals into mutually exclusive intervals.
Sort the intervals based on their start time.
Iterate through the intervals and merge overlapping intervals.
Output the mutually exclusive intervals.
Example: [(1,3), (2,6), (8,10), (15,18)] -> [(1,6), (8,10), (15,18)]
Different types of hashing and alternative for Linear Chaining
Different types of hashing include division, multiplication, and universal hashing
Alternative for Linear Chaining is Open Addressing
Open Addressing includes Linear Probing, Quadratic Probing, and Double Hashing
An AVL tree is a self-balancing binary search tree where the heights of the left and right subtrees differ by at most one.
AVL tree is a binary search tree with additional balance factor for each node.
The balance factor is the difference between the heights of the left and right subtrees.
Insertion and deletion operations in AVL tree maintain the balance factor to ensure the tree remains balanced.
Rotations are performed ...
Find the minimum number of squares whose sum equals to a given number n.
Use dynamic programming to solve the problem efficiently.
Start with finding the square root of n and check if it is a perfect square.
If not, then try to find the minimum number of squares required for the remaining number.
Repeat the process until the remaining number becomes 0.
Return the minimum number of squares required for the given number n.
Insertion sort for a singly linked list.
Traverse the list and compare each node with the previous nodes
If the current node is smaller, swap it with the previous node
Repeat until the end of the list is reached
Time complexity is O(n^2)
I applied via Naukri.com and was interviewed in May 2019. There were 4 interview rounds.
based on 3 interviews
Interview experience
based on 11 reviews
Rating in categories
Store Manager
5
salaries
| ₹3.8 L/yr - ₹5.1 L/yr |
Fashion Consultant
3
salaries
| ₹2.3 L/yr - ₹3 L/yr |
TCS
Accenture
Wipro
Cognizant