i
IndustryBuying.com
Filter interviews by
I applied via Naukri.com and was interviewed in Nov 2019. There were 3 interview rounds.
ABC analysis is a technique used to categorize items based on their importance or value.
ABC analysis divides items into three categories: A, B, and C.
Category A items are the most important and valuable, while category C items are the least important and valuable.
ABC analysis is commonly used in inventory management to prioritize items for restocking or ordering.
For example, a grocery store might use ABC analysis to pr...
FIFO (First-In, First-Out) and LIFO (Last-In, First-Out) are inventory management methods.
FIFO: Oldest items are sold first, used in industries like retail and food.
LIFO: Newest items are sold first, used in industries like manufacturing and construction.
I handle rejection and damaged materials by staying calm, assessing the situation, and taking appropriate action.
Remain calm and composed when faced with rejection or damaged materials
Assess the extent of the damage and determine the cause of rejection
Take appropriate action to rectify the situation, such as repairing or replacing damaged materials
Implement preventive measures to minimize future rejections or damages
Ma...
5S is a methodology for workplace organization and standardization.
Sort - eliminate unnecessary items
Set in order - organize remaining items
Shine - clean and inspect work area
Standardize - establish procedures and schedules
Sustain - maintain and improve
Advantages include increased efficiency, safety, and quality
Reduces waste and improves morale
Example: A factory implements 5S to reduce clutter and improve workflow
Inventory is maintained through regular monitoring, accurate record-keeping, and efficient replenishment.
Regularly monitor inventory levels to identify shortages or excesses
Keep accurate records of all incoming and outgoing inventory
Implement a system for efficient replenishment, such as using reorder points or automated ordering
Conduct regular audits to ensure inventory accuracy
Utilize inventory management software or...
GRN stands for Goods Receipt Note and e-way bill is an electronic document required for the movement of goods.
GRN is a document used to record the receipt of goods from a supplier.
It includes details such as the quantity, quality, and condition of the goods received.
GRN helps in verifying the accuracy of the goods received and is used for inventory management.
E-way bill is an electronic document required for the moveme...
Top trending discussions
Calculate the level sum of a binary tree.
Traverse the tree level by level using BFS
Add the values of nodes at each level
Store the level sum in an array
Return the array of level sums
Vertical sum of binary tree is the sum of all nodes in each vertical line of the tree.
Traverse the tree in-order and keep track of the horizontal distance of each node from the root.
Use a hash table to store the sum of nodes at each horizontal distance.
Recursively traverse the left and right subtrees and update the hash table accordingly.
Calculate top 10 frequently used words on Facebook in 1 hour dynamically.
Use Facebook API to fetch data
Implement a script to count word frequency
Sort the words based on frequency and return top 10
I am a software engineer with experience in developing web applications and a passion for problem-solving.
Proficient in programming languages such as Java, Python, and JavaScript
Experience with front-end frameworks like React and Angular
Familiarity with back-end technologies such as Node.js and Spring Boot
Strong understanding of data structures and algorithms
Ability to work collaboratively in a team environment
There are 204 squares and 1296 rectangles on a standard 8x8 chess board.
The number of squares can be calculated using the formula n(n+1)(2n+1)/6, where n is the number of rows/columns.
The number of rectangles can be calculated using the formula n(n+1)m(m+1)/4, where n and m are the number of rows and columns respectively.
For an 8x8 chess board, there are 64 squares of size 1x1, 49 squares of size 2x2, 36 squares of siz...
I was interviewed before Apr 2021.
Round duration - 90 minutes
Round difficulty - Easy
There were 22 MCQ questions of aptitude and technical based while 3 questions were of coding type.
Tips: MCQ questions were not time consuming , so try to do that questions in less time , so you will get enough time for coding questions.
Given a string STR
consisting solely of the characters '{', '}', '(', ')', '[', and ']', determine whether the parentheses are balanced.
The first line contains an inte...
Implement a function to check if parentheses in a string are balanced.
Use a stack to keep track of opening parentheses and pop when a closing parenthesis is encountered.
If the stack is empty when a closing parenthesis is encountered or if there are unmatched parentheses at the end, return 'NO'.
Ensure that all opening parentheses have a corresponding closing parenthesis in the correct order.
Return 'YES' if all parenthes...
Given a string S
that represents a number, determine the smallest number that is strictly greater than the original number and has the same set of ...
The task is to find the smallest number greater than the given number with the same set of digits.
Sort the digits of the number in descending order.
Find the first digit from the right that is smaller than the digit to its right.
Swap this digit with the smallest digit to its right that is greater than it.
Sort all the digits to the right of the swapped digit in ascending order to get the smallest number greater than the
Round duration - 60 minutes
Round difficulty - Medium
My experience was very awesome , I answered all the questions , although in starting I was very nervous , so at starting interviewer help me get my confidence, interviewer was very helpful.
Given an arbitrary binary tree consisting of N nodes, where each node is associated with a certain value, your task is to find the maximum sum for any le...
Find the maximum sum for any level in a binary tree.
Traverse the binary tree level by level and calculate the sum for each level.
Keep track of the maximum sum encountered so far.
Return the maximum sum found.
Example: For the input tree, the maximum level sum is 13 (5+6+2).
Given an integer array ARR
and an integer K
, your task is to find the K
most frequent elements in ARR
. Return the elements sorted in ascending order.
Find the K most frequent elements in an integer array and return them sorted in ascending order.
Use a hashmap to store the frequency of each element in the array.
Use a min heap to keep track of the K most frequent elements.
Return the elements from the min heap in ascending order.
Round duration - 60 minutes
Round difficulty - Easy
This round was based on DSA and questions on core subjects that I had studied throughout college.
Given a binary tree where each node has a positive integer value, compute the vertical sum of the nodes. The vertical sum is defined as the sum of all nodes aligned along the...
Compute the vertical sum of nodes in a binary tree aligned along the same vertical line.
Traverse the binary tree in a level order manner to calculate the vertical sum.
Use a hashmap to store the vertical sum at each vertical level.
Recursively traverse the tree and update the vertical sum in the hashmap.
Output the vertical sums in the required format for each test case.
TCP/IP is a set of protocols that governs the way data is transmitted over the internet.
TCP/IP stands for Transmission Control Protocol/Internet Protocol.
It is a suite of communication protocols used to connect devices on the internet.
TCP ensures that data is reliably transmitted between devices.
IP is responsible for addressing and routing data packets across networks.
Examples of TCP/IP protocols include HTTP, FTP, and
Round duration - 30 minutes
Round difficulty - Easy
Experience : Keep confidence and show them good communication skills. Previous round's performance also matters in this rounds
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.
Write a program to maximum subsequence in an array
I applied via Referral and was interviewed before Jan 2024. There was 1 interview round.
I was fine with a lot of dsa
Find the pair element from the array
Iterate through the array and use a hashmap to store elements and their counts
Check if the current element's complement exists in the hashmap
Return the pair if found, otherwise return null
I applied via Referral and was interviewed before Nov 2022. There were 2 interview rounds.
The question asks to merge two sorted arrays and delete a node in a linked list.
To merge two sorted arrays, we can use a two-pointer approach.
To delete a node in a linked list, we need to update the pointers of the previous and next nodes.
Example: Merge [1, 3, 5] and [2, 4, 6] to get [1, 2, 3, 4, 5, 6].
Example: Delete node with value 3 from linked list [1, 2, 3, 4, 5] to get [1, 2, 4, 5].
Check if a string is a palindrome using recursion.
Use recursion to compare the first and last characters of the string.
If they are equal, recursively check the substring without the first and last characters.
Continue this process until the string is empty or only has one character.
If all comparisons are equal, the string is a palindrome.
based on 4 reviews
Rating in categories
Sourcing Engineer
71
salaries
| ₹0 L/yr - ₹0 L/yr |
Category Manager
54
salaries
| ₹0 L/yr - ₹0 L/yr |
Operations Executive
34
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Sourcing Engineer
29
salaries
| ₹0 L/yr - ₹0 L/yr |
Assistant Manager
25
salaries
| ₹0 L/yr - ₹0 L/yr |
Tolexo
Moglix
Power2sme
Voonik