Filter interviews by
Clear (1)
I applied via Referral and was interviewed before Oct 2021. There were 2 interview rounds.
I applied via Company Website and was interviewed in Nov 2023. There were 2 interview rounds.
Safety features in mixers include locking mechanisms, splash guards, and emergency stop buttons.
Locking mechanisms prevent accidental operation of the mixer.
Splash guards help contain ingredients and prevent splattering.
Emergency stop buttons allow for quick shutdown in case of an emergency.
Some mixers also have overload protection to prevent motor burnout.
Mixers may have safety interlocks to ensure the bowl is properl
The motor working principle involves converting electrical energy into mechanical energy through the interaction of magnetic fields.
Electric current flows through a coil of wire, creating a magnetic field.
The magnetic field interacts with a permanent magnet, causing the coil to rotate.
This rotation is used to drive mechanical components, such as a fan or a pump.
Kaizen is a Japanese business philosophy of continuous improvement involving all employees.
Kaizen focuses on making small, incremental changes to processes to improve efficiency and quality.
It involves all employees in the organization, from top management to frontline workers.
Kaizen promotes a culture of continuous improvement and innovation.
Examples of Kaizen practices include daily team meetings to discuss improveme...
Reducing losses in the supply chain involves improving visibility, communication, and efficiency.
Improve visibility by implementing tracking systems for inventory and shipments.
Enhance communication between all parties involved in the supply chain to prevent delays and errors.
Increase efficiency by optimizing processes and reducing waste.
Implement risk management strategies to mitigate potential disruptions.
Regularly r...
I applied via AmbitionBox and was interviewed in Jan 2022. There were 3 interview rounds.
INVENTORY
Reviewing HR policies is an important task for an Assistant Manager.
Review all HR policies to ensure they are up-to-date and compliant with laws and regulations.
Identify any gaps or areas for improvement in the existing policies.
Consult with HR team and management to gather feedback and suggestions for policy enhancements.
Consider industry best practices and benchmark against competitors' policies.
Ensure policies are c...
I was interviewed in Jun 2022.
Mental ability, logical reasoning
Write on essay on current issue
Discussion of topic given
I was interviewed before Sep 2020.
Round duration - 90 minutes
Round difficulty - Easy
This was MCQ+Coding round.
Check if two strings are anagrams by comparing the sorted versions of the strings.
Sort both strings and compare if they are equal.
Use a hashmap to store the frequency of characters in each string and compare the maps.
Ignore spaces and punctuation when comparing the strings.
Round duration - 90 minutes
Round difficulty - Easy
This was face to face interview round.
Round duration - 90 minutes
Round difficulty - Easy
This was face to face interview round.
Tip 1 : Participate in live contests on websites like Codechef, Codeforces etc as much as possible.
Tip 2 : Practice previous interview questions from LeetCode, GeeksForGeeks.
Tip 3 : Revise Computer Science subjects like DBMS, OOPS thoroughly.
Add projects and Internships if you have done any and add only those things which you really know.
Final outcome of the interviewSelectedI was interviewed before Sep 2020.
Round duration - 90 Minutes
Round difficulty - Medium
Interview started at 11:00 am. It was an online round. During the coding round I submitted optimized solution and got full acceptance of the solutions.
You are provided with a directed graph composed of 'N' nodes. You have a matrix called 'EDGES' with dimensions M x 2, which specifies the 'M' edges in the graph. Each edge...
Detect cycle in a directed graph using depth-first search (DFS) algorithm.
Use DFS to traverse the graph and detect back edges indicating a cycle.
Maintain a visited array to keep track of visited nodes during traversal.
If a node is visited again during traversal and it is not the parent node, then a cycle exists.
Return true if a cycle is detected, false otherwise.
Round duration - 80 Minutes
Round difficulty - Medium
Interview started at 10:00 am. Interview went well, I was able to connect with the interviewer and enjoyed the whole interview
Find the next smallest palindrome strictly greater than a given number 'N' represented as a string 'S'.
You are given a number in string format, a...
Find the next smallest palindrome greater than a given number represented as a string.
Convert the string to an integer, find the next greater palindrome, and convert it back to a string.
Handle cases where the number is a palindrome or has all digits as '9'.
Consider both odd and even length numbers when finding the next palindrome.
Round duration - 80 Minutes
Round difficulty - Medium
Interview started at 11:00 am. Interview went well.
Given a binary tree of integers, your task is to return the boundary nodes of the tree in Anti-Clockwise direction starting from the root node.
The first line ...
Return the boundary nodes of a binary tree in Anti-Clockwise direction starting from the root node.
Traverse the left boundary nodes in a top-down manner
Traverse the leaf nodes from left to right
Traverse the right boundary nodes in a bottom-up manner
Handle cases where duplicates occur in the boundary nodes
Implement the function without printing as printing is already managed
Tip 1 : For Data Structures number of questions doesn't matter. Try to understand the logic behind them and try to apply them in creating multiple scenario's. Learn them by heart.
Tip 2 : For Web.Development Try to learn full stack development. See which part interests you more, Increase your knowledge horizon, Always try to build a system a system considering It will be served to millions of customers. By doing this 1-2 projects will increase and cover all the major things which one should learn in their career/college.
Tip 1 : Always try to make it a single page
Tip 2 : Always make resume company specific. eg. Data Structures part more if you are applying for MNC's eg. Amazon, Google, DE Shaw, browserstack.
I applied via Naukri.com and was interviewed before Aug 2020. There were 4 interview rounds.
I was interviewed 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 Company Website and was interviewed in May 2019. There were 5 interview rounds.
based on 12 reviews
Rating in categories
Delivery Boy
869
salaries
| ₹0 L/yr - ₹0 L/yr |
Fleet Manager
580
salaries
| ₹0 L/yr - ₹0 L/yr |
Sales Manager
519
salaries
| ₹0 L/yr - ₹0 L/yr |
Assistant Manager
497
salaries
| ₹0 L/yr - ₹0 L/yr |
Assistant Store Manager
450
salaries
| ₹0 L/yr - ₹0 L/yr |
Zomato
Dunzo
FoodPanda
Rapido