Upload Button Icon Add office photos

Filter interviews by

Infibeam Assistant Manager Warehouse Interview Questions and Answers

Updated 22 Feb 2022

Infibeam Assistant Manager Warehouse Interview Experiences

1 interview found

I applied via Approached by Company

Round 1 - HR 

(1 Question)

  • Q1. Why are you looking for a change?

Interview Preparation Tips

Interview preparation tips for other job seekers - Hi my name is Tushar Manohar Penkar. I have 11 years work experience. My last Qualification is F.Y.B.com.

Interview questions from similar companies

I applied via Referral

Interview Questionnaire 

2 Questions

  • Q1. Tell me about your experience in current company??
  • Q2. If you read the JD tell me how you can manage it.

Interview Preparation Tips

Interview preparation tips for other job seekers - We know communication skill is important. But you can't reject someone who is good in communication but they are speaking with english+hindi+ regional language. Then your object is you just need someone who is good in english. In India not every people knows english well. When we are hired in company we have to visiti market have to communicate other companies for business or communicate with clients. That time english is important but not necessary because if i am able to clarify the client or merchant with other language or mixed with english that is also skilled communication. You rejecting someone who is good in is field, technically sound, can write in English, but if he/she used 2/3 words in hindi/other language (which interviewer can understand) you can't reject them. If you reject them for this reason than you are just searching for english speaking parrot not a skilled employee.

I appeared for an interview before Sep 2020.

Round 1 - Coding Test 

(3 Questions)

Round duration - 60 minutes
Round difficulty - Medium

It was held in the evening around 4 pm. The camera was on during the test to invigilate the activity of students. On any doubtful action, warning was given. Platform was easy to code in.

  • Q1. 

    Replace 0s Problem Statement

    You are given a matrix where every element is either a 1 or a 0. The task is to replace 0 with 1 if it is surrounded by 1s. A 0 (or a set of 0s) is considered to be surrounded...

  • Ans. 

    Given a matrix of 1s and 0s, replace 0s surrounded by 1s with 1s.

    • Iterate through the matrix and check each 0 surrounded by 1s.

    • If a 0 is surrounded by 1s, replace it with 1.

    • Update the matrix in place without printing or returning it.

  • Answered by AI
  • Q2. 

    Ways To Make Coin Change

    Given an infinite supply of coins of varying denominations, determine the total number of ways to make change for a specified value using these coins. If it's not possible to make...

  • Ans. 

    The task is to determine the total number of ways to make change for a specified value using given denominations.

    • Use dynamic programming to keep track of the number of ways to make change for each value up to the target value.

    • Iterate through each denomination and update the number of ways to make change for each value based on the current denomination.

    • Handle base cases such as making change for 0 or using only the smal...

  • Answered by AI
  • Q3. 

    Minimum Subset Sum Difference Problem

    Given an array of non-negative integers, your task is to partition this array into two subsets such that the absolute difference between the sums of the subsets is mi...

  • Ans. 

    Given an array, partition it into two subsets to minimize the absolute difference between their sums.

    • Use dynamic programming to calculate all possible subset sums.

    • Iterate through the subset sums to find the minimum absolute difference.

    • Consider all possible partitions of the array elements.

    • Example: For input [1, 6, 11, 5], the minimum absolute difference is 1.

    • Example: For input [1, 2, 3], the minimum absolute difference

  • Answered by AI
Round 2 - Face to Face 

(4 Questions)

Round duration - 60 minutes
Round difficulty - Medium

It was held in the morning around 11:30 am. The interview was scheduled on google meet. The interviewer was quite friendly. He started by a brief introduction. This round was mostly based on Data structures and algorithms. At the end he asked some concepts of OOPs and Operating System.

  • Q1. 

    String Transformation Problem

    Given a string (STR) of length N, you are tasked to create a new string through the following method:

    Select the smallest character from the first K characters of STR, remov...

  • Ans. 

    Given a string and an integer K, create a new string by selecting the smallest character from the first K characters of the input string and repeating the process until the input string is empty.

    • Iterate through the input string, selecting the smallest character from the first K characters each time.

    • Remove the selected character from the input string and append it to the new string.

    • Continue this process until the input ...

  • Answered by AI
  • Q2. 

    SpecialStack Design Problem

    Design a stack that efficiently supports the getMin() operation in O(1) time with O(1) extra space. This stack should include the following operations: push(), pop(), top(), is...

  • Ans. 

    Design a stack that supports getMin() operation in O(1) time with O(1) extra space using inbuilt stack data structure.

    • Use two stacks - one to store the actual data and another to store the minimum value at each level.

    • When pushing a new element, check if it is smaller than the current minimum and update the minimum stack accordingly.

    • When popping an element, also pop the top element from the minimum stack if it matches t...

  • Answered by AI
  • Q3. 

    Geometric Progression Subsequences Problem Statement

    Given an array of ‘N’ integers, determine the number of subsequences of length 3 that form a geometric progression with a specified common ratio ‘R’.

    ...

  • Ans. 

    Count the number of subsequences of length 3 forming a geometric progression with a specified common ratio in an array of integers.

    • Iterate through the array and for each element, check for possible subsequences of length 3 with the given common ratio.

    • Use a hashmap to store the count of possible subsequences for each element as the middle element.

    • Return the total count of subsequences modulo 10^9 + 7.

    • Example: For input ...

  • Answered by AI
  • Q4. What are the conditions for a deadlock to occur?
  • Ans. 

    Deadlock occurs when two or more processes are waiting for each other to release resources, resulting in a standstill.

    • Two or more processes must be holding resources and waiting for resources held by other processes

    • Processes cannot proceed because they are stuck in a circular wait

    • Resources cannot be forcibly released by the operating system

    • Examples: Process A holds Resource 1 and waits for Resource 2, while Process B h

  • Answered by AI
Round 3 - Face to Face 

(2 Questions)

Round duration - 45 minutes
Round difficulty - Medium

It was held in the afternoon around 3pm. The interviewer was quite friendly. She started with my introduction. She asked 2-3 problems related to data structures and then asked about python libraries which I used in my projects.

  • Q1. 

    Group Anagrams Problem Statement

    Given an array or list of strings called inputStr, your task is to return the strings grouped as anagrams. Each group should contain strings that are anagrams of one anoth...

  • Ans. 

    Group anagrams in an array of strings based on their characters.

    • Iterate through each string in the input array/list.

    • For each string, sort the characters alphabetically to create a key for grouping.

    • Use a hashmap to group strings with the same key.

    • Return the grouped anagrams as separate arrays of strings.

  • Answered by AI
  • Q2. 

    Kth Smallest Element Problem Statement

    You are provided with an array of integers ARR of size N and an integer K. Your task is to find and return the K-th smallest value present in the array. All elements...

  • Ans. 

    Find the K-th smallest element in a given array of distinct integers.

    • Sort the array in ascending order.

    • Return the element at index K-1 from the sorted array.

    • Handle edge cases like K being out of bounds or array being empty.

  • Answered by AI
Round 4 - Face to Face 

(1 Question)

Round duration - 45 minutes
Round difficulty - Medium

It was held in the evening around 6 pm. The interviewer started with a brief introduction of me. He asked about my projects and then asked some concepts of Operating System and problems related to data structures. I had projects of Machine Learning and Deep learning. Discussion about projects continued for about 25 minutes.

  • Q1. 

    Middle of a Linked List

    You are given the head node of a singly linked list. Your task is to return a pointer pointing to the middle of the linked list.

    If there is an odd number of elements, return the ...

  • Ans. 

    Return the middle element of a singly linked list, or the one farther from the head node if there are even elements.

    • Traverse the linked list with two pointers, one moving twice as fast as the other

    • When the fast pointer reaches the end, the slow pointer will be at the middle

    • Return the element pointed to by the slow pointer

  • Answered by AI

Interview Preparation Tips

Professional and academic backgroundI completed Computer Science Engineering from Dr. B.R. Ambedkar National Institute of Technology. I applied for the job as Software Engineer in NoidaEligibility criteriaAbove 7 cgpaPaytm (One97 Communications Limited) interview preparation:Topics to prepare for the interview - Data Structures and Algorithms, OOPS, C programming, C++ Programming, Machine Learning, Operating System, Deep learning.Time required to prepare for the interview - 10 monthsInterview preparation tips for other job seekers

Tip 1 : Practice problems related to data structures and algorithms 
Tip 2 : Brush up fundamental concepts deeply
Tip 3 : You should have a deep knowledge of your projects and related technology.

Application resume tips for other job seekers

Tip 1 : It should not be more than a page.
Tip 2 : It should be precise and university projects or prior experience like industrial training or internship should be mentioned.

Final outcome of the interviewSelected

Skills evaluated in this interview

I applied via Approached by Company and was interviewed before Feb 2021. There was 1 interview round.

Round 1 - One-on-one 

(1 Question)

  • Q1. Basic end user understanding

Interview Preparation Tips

Interview preparation tips for other job seekers - Be confident and share your experiences in correct way

I applied via Referral and was interviewed before May 2021. There were 3 interview rounds.

Round 1 - Coding Test 

I dont remember exact questions but they are like leetcode easy and medium

Round 2 - One-on-one 

(2 Questions)

  • Q1. How web/internet works?
  • Ans. 

    The web/internet is a network of interconnected devices that communicate through standardized protocols to share information.

    • Devices connect to the internet through ISPs

    • Data is transmitted through packets using TCP/IP protocols

    • Web browsers use HTTP/HTTPS protocols to request and receive web pages

    • DNS servers translate domain names to IP addresses

    • Web servers host web pages and respond to requests

    • Search engines use web cr

  • Answered by AI
  • Q2. Coding questions with complete explanation
Round 3 - One-on-one 

(1 Question)

  • Q1. Coding and managerial round similar to round 2

Interview Preparation Tips

Interview preparation tips for other job seekers - practice coding well and some development skill. you are good to go

Skills evaluated in this interview

I appeared for an interview before Sep 2020.

Round 1 - Coding Test 

(3 Questions)

Round duration - 70 minutes
Round difficulty - Easy

The first round was the Online Coding Round of 70 minutes with 3 problems of 3 marks, 3 marks, and 4 marks respectively.
The first two questions were easy and the third one was a bit tricky. The round started at 6 PM. 
Anyone who is practicing continuously could have solved these questions easily within the time limit. The test cases were also not so hard and distinct. I coded in C++ language.
The questions asked were-
1. Minimum insertions required to make a string palindrome
2. To find the distance of the closest leaf from a node with given data.
3. Add two numbers represented by linked lists

22 students were selected for the next round.

  • Q1. 

    Minimum Insertions to Make a String Palindrome

    Determine the minimal number of characters needed to insert into a given string STR to transform it into a palindrome.

    Example:

    Input:
    STR = "abcaa"
    Outp...
  • Ans. 

    The task is to find the minimum number of characters needed to insert into a given string to make it a palindrome.

    • Use dynamic programming to find the longest palindromic subsequence of the given string.

    • Subtract the length of the longest palindromic subsequence from the length of the original string to get the minimum insertions required.

    • Handle edge cases like an empty string or a string that is already a palindrome.

    • Exa...

  • Answered by AI
  • Q2. 

    Closest Leaf in a Binary Tree

    Ninja is stuck in a maze represented as a binary tree, and he is at a specific node ‘X’. Help Ninja find the shortest path to the nearest leaf node, which is considered an ex...

  • Ans. 

    Find the minimum distance from a given node to the nearest leaf node in a binary tree.

    • Traverse the binary tree from the given node 'X' to find the nearest leaf node using BFS or DFS.

    • Keep track of the distance from 'X' to each leaf node encountered during traversal.

    • Return the minimum distance found as the output.

  • Answered by AI
  • Q3. 

    Adding Two Linked Lists

    Given two singly linked lists, with each list representing a positive number without leading zeros, your task is to add these two numbers and return the result in the form of a new...

  • Ans. 

    Add two numbers represented by linked lists and return the result as a new linked list.

    • Traverse both linked lists simultaneously while adding corresponding elements and carry over the sum if needed

    • Handle cases where one linked list is longer than the other

    • Create a new linked list to store the sum of the two numbers

  • Answered by AI
Round 2 - Video Call 

(3 Questions)

Round duration - 80 minutes
Round difficulty - Easy

It was a technical interview. The platform used was google meet for online video calling. The interviewer first introduced himself then asked me to introduce myself. He also asked about my well-being amid the Covid-19 pandemic. He asked me 3 problems from data structures. He put a lot of focus on my project. We discussed about my project for about 20 mins. He asked various questions related to my project and I answered them confidently. After 70-75 mins he said that interview was over and that I may ask him anything. I asked him to give me feedback about my resume and my project. He gave me advice to improve my resume and the interview was over. The first technical interview was easy and was not so challenging as I was prepared.

  • Q1. 

    All Pairs with Target Sum

    Given an array of integers ARR with length 'N' and an integer 'Target', the task is to find all unique pairs of elements that add up to the 'Target'.

    Input:

    First line: Integer...
  • Ans. 

    Find all unique pairs of elements in an array that add up to a given target sum.

    • Use a hashmap to store the difference between the target sum and each element as keys and their indices as values.

    • Iterate through the array and check if the current element's complement exists in the hashmap.

    • Return the pairs of elements that add up to the target sum.

  • Answered by AI
  • Q2. 

    Quick Sort Problem Statement

    Sort the given array of integers in ascending order using the quick sort algorithm. Quick sort is a divide-and-conquer algorithm where a pivot point is chosen to partition the...

  • Ans. 

    Implement quick sort algorithm to sort an array of integers in ascending order.

    • Choose a pivot element (e.g., rightmost element) to partition the array into two subarrays.

    • Recursively apply quick sort on the subarrays until the entire array is sorted.

    • Time complexity can be optimized to NlogN for worst-case scenarios.

  • Answered by AI
  • Q3. 

    Merge Sort Task

    Given a sequence of numbers, denoted as ARR, your task is to return a sorted sequence of ARR in non-descending order using the Merge Sort algorithm.

    Example:

    Explanation:
    The Merge Sort...
  • Ans. 

    Implement Merge Sort algorithm to sort a sequence of numbers in non-descending order.

    • Implement the Merge Sort algorithm which involves dividing the array into two halves, sorting each half, and then merging them back together.

    • Recursively call the Merge Sort function on each half of the array until the base case of having a single element in the array is reached.

    • Merge the sorted halves back together in a new array in no...

  • Answered by AI
Round 3 - Video Call 

(2 Questions)

Round duration - 60 minutes
Round difficulty - Medium

This was also a technical round. The interviewer focused on data structures and resume. Apart from some basic questions about my resume, he asked majorly about data structures and algorithms. The interview was an hour long and he asked only 2 problems. Both of them were from trees. In this round, he focused if I can change my approach if a slight change is made in the question. Like he asked me to write code for inorder traversal. Obviously, I used a recursive approach. He then asked me to use the iterative method to find inorder traversal of the tree.

The questions he asked were-
1. Inorder traversal (both recursive and iterative method)
2. Level Order Traversal
( For obvious reasons I knew level order traversal very well. I coded it swiftly, so he asked me to write code for Zig-Zag traversal)

  • Q1. 

    Inorder Successor in a Binary Tree

    Find the inorder successor of a given node in a binary tree. The inorder successor is the node that appears immediately after the given node during an inorder traversal....

  • Ans. 

    Find the inorder successor of a given node in a binary tree.

    • Perform an inorder traversal of the binary tree to find the successor of the given node.

    • If the given node has a right child, the successor will be the leftmost node in the right subtree.

    • If the given node does not have a right child, backtrack to the parent nodes to find the successor.

  • Answered by AI
  • Q2. 

    Zigzag Traversal of Binary Tree

    Given a binary tree with integer values in its nodes, your task is to print the zigzag traversal of the tree.

    Note:

    In zigzag order, level 1 is printed from left to right...
  • Ans. 

    Implement a function to print the zigzag traversal of a binary tree.

    • Use a queue to perform level order traversal of the binary tree.

    • Maintain a flag to switch between printing nodes from left to right and right to left at each level.

    • Store nodes at each level in a list and reverse the list if the flag is set to print in zigzag order.

  • Answered by AI
Round 4 - Video Call 

Round duration - 50 minutes
Round difficulty - Medium

This was the final round of the Interview process. My interview was scheduled for 7.30 PM. It started at approximately 7.40 PM. The main focus of the interviewer was on my projects and my skills. He asked me many questions regarding my project like what problems I faced, what did you learn from this, apart from developing skills what else did you learn while developing the project, why did you use this tech instead of this, security features, scalability of the project and many more. I answered almost every question as perfectly as I can. Later he asked me some basic questions from NodeJS (as I am a full stack developer). In the end, he asked a puzzle. I didn't know the solution to the puzzle but we discussed it and I figured out the solution.

Interview Preparation Tips

Eligibility criteriaabove 7 CGPA, No active backlogsPaytm (One97 Communications Limited) interview preparation:Topics to prepare for the interview - Data Structures, OOPS, Dynamic Programming, Recursion, Advanced Data Structures, Operating System, Time complexity analysis and Sorting AlgorithmsTime required to prepare for the interview - 4 monthsInterview preparation tips for other job seekers

Tip 1 : Properly grasp Data Structures and Algorithms from basics.
Tip 2 : Learn about Time complexity 
Tip 3 : Be honest and walk through your thought process to the interviewer.
Tip 4 : Its always good to be presentable and have good communications skills

Application resume tips for other job seekers

Tip 1 : Never Lie on your resume. Only write what you have done and what you know.
Tip 2 : It's good to have one or two projects on your resume. Mention the tech stack you used and a brief description of the project. It will be best if you host/upload your project on the cloud.
Tip 3 : Avoid unnecessary details like Hobbies, family details, declaration, date, signature, etc.
Tip 4 : You're more than a 1-page resume. But your resume should not be more than a page

Final outcome of the interviewSelected

Skills evaluated in this interview

I applied via Naukri.com and was interviewed in Jan 2021. There were 3 interview rounds.

Interview Questionnaire 

2 Questions

  • Q1. They ask about previous work experience
  • Q2. They ask related to analitics questions

Interview Preparation Tips

Interview preparation tips for other job seekers - Read about job description and prepare accordingly

Interview Questionnaire 

2 Questions

  • Q1. What is solid principles
  • Ans. 

    SOLID principles are a set of five design principles for writing maintainable and scalable code.

    • S - Single Responsibility Principle

    • O - Open/Closed Principle

    • L - Liskov Substitution Principle

    • I - Interface Segregation Principle

    • D - Dependency Inversion Principle

  • Answered by AI
  • Q2. What are internal working of has set
  • Ans. 

    HashSet is a collection that stores unique elements by using a hash table.

    • Elements are stored based on their hash code

    • Uses hashCode() and equals() methods to check for duplicates

    • Does not maintain insertion order

    • Allows null values

    • Example: HashSet set = new HashSet<>(); set.add("apple"); set.add("banana");

Answered by AI

Skills evaluated in this interview

I applied via Campus Placement and was interviewed before Jun 2020. There was 1 interview round.

Interview Questionnaire 

1 Question

  • Q1. Normal coding question medium level , approach focusing rounds actually how you get up to result

Interview Preparation Tips

Interview preparation tips for other job seekers - "GfG must do" should be solved properly alteast , otherwise go keep on practicing on any platform .

Interview Questionnaire 

1 Question

  • Q1. What is your goal

Interview Preparation Tips

Interview preparation tips for other job seekers - It was nice interview I have to learn nice concepts

Infibeam Interview FAQs

How many rounds are there in Infibeam Assistant Manager Warehouse interview?
Infibeam interview process usually has 1 rounds. The most common rounds in the Infibeam interview process are HR.

Tell us how to improve this page.

Interview Questions from Similar Companies

Paytm Interview Questions
3.3
 • 758 Interviews
Visa Interview Questions
3.5
 • 140 Interviews
Angel One Interview Questions
4.0
 • 136 Interviews
Freecharge Interview Questions
3.8
 • 53 Interviews
Mobikwik Interview Questions
3.6
 • 48 Interviews
Truhome Finance Interview Questions
3.8
 • 42 Interviews
Jupiter Money Interview Questions
3.3
 • 30 Interviews
Spice Money Interview Questions
4.0
 • 29 Interviews
Paytm Money Interview Questions
3.2
 • 27 Interviews
Verifone Interview Questions
3.3
 • 24 Interviews
View all
Software Engineer
8 salaries
unlock blur

₹10 L/yr - ₹14 L/yr

Senior Program Manager
7 salaries
unlock blur

₹16 L/yr - ₹28 L/yr

Program Manager
6 salaries
unlock blur

₹7.5 L/yr - ₹27 L/yr

Assistant Manager
5 salaries
unlock blur

₹4.8 L/yr - ₹7.5 L/yr

Senior Software Engineer
5 salaries
unlock blur

₹10.9 L/yr - ₹18.1 L/yr

Explore more salaries
Compare Infibeam with

Paytm

3.3
Compare

Angel One

4.0
Compare

Truhome Finance

3.8
Compare

Visa

3.5
Compare
Did you find this page helpful?
Yes No
write
Share an Interview