i
ManpowerGroup
Filter interviews by
I applied via Referral and was interviewed before Oct 2022. There were 2 interview rounds.
Boolean search involves using operators like AND, OR, NOT to narrow or expand search results.
Use AND to narrow down search results by requiring all keywords to be present
Use OR to expand search results by allowing any of the keywords to be present
Use NOT to exclude specific keywords from search results
Use parentheses to group keywords and operators for more complex searches
I applied via Naukri.com and was interviewed in Sep 2020. There were 3 interview rounds.
I am flexible towards night shifts and can adjust my schedule accordingly.
I have experience working night shifts and understand the importance of being available for the job.
I am willing to adjust my personal schedule to accommodate night shifts.
I understand that night shifts may be necessary in certain industries and am prepared to work them if required.
I applied via Campus Placement and was interviewed before Jan 2022. There were 2 interview rounds.
I have a strong understanding of various technologies and their applications.
Proficient in programming languages such as Java, Python, and C++
Familiar with web development technologies such as HTML, CSS, and JavaScript
Knowledgeable in database management systems like MySQL and Oracle
Experience with cloud computing platforms like AWS and Azure
Understanding of emerging technologies like blockchain and artificial intellig
I applied via Naukri.com and was interviewed before Jun 2021. There were 2 interview rounds.
I applied via Naukri.com and was interviewed before Jan 2021. There were 3 interview rounds.
I applied via Naukri.com and was interviewed in May 2021. There were 5 interview rounds.
I applied via Job Fair
Java 8 programs, string buffer and builder
About traffic in Banglore and the project
I appeared for an interview in Oct 2021.
Round duration - 105 minutes
Round difficulty - Medium
There were 3 problems .
One was easy but the other two were of medium level.
Given an array representing positions of stalls and an integer ‘K’ representing the number of aggressive cows, determine the largest minimum distance between any two cows ...
The problem requires assigning aggressive cows to stalls in a way that maximizes the minimum distance between any two cows.
Sort the array of stall positions in ascending order.
Use binary search to find the largest minimum distance between cows.
Check if it is possible to assign cows with this minimum distance by iterating through the sorted array.
If it is possible, update the maximum distance and continue binary search ...
The city of Ninjaland is represented as an unweighted graph with houses and roads. There are 'N' houses numbered 1 to 'N', connected by 'M' bidirectional roads. A road...
The problem is to find the shortest path between two houses in an unweighted graph.
The graph represents the city of Ninjaland with houses connected by roads.
The input consists of the number of test cases, number of houses and roads, starting and ending house, and the roads between houses.
The output is a vector of nodes representing the shortest path from the starting house to the ending house.
If there are multiple shor...
Given a positive integer N
, compute the total number of '1's in the binary representation of all numbers from 1 to N. Return this count modulo 1e9+7 because the result can...
The task is to count the total number of '1' in the binary representation of all numbers from 1 to N.
Convert each number from 1 to N into its binary representation
Count the number of '1' bits in each binary representation
Sum up the counts of '1' bits for all numbers
Return the sum modulo 1e9+7
Round duration - 60 minutes
Round difficulty - Easy
The interviewer was very polite and straightforward.
Firstly he introduced himself and then asked me to introduce myself and then he jumped to the coding problems.
After the coding problems, he asked some questions from the OS and DBMS.
You are given a string of length N
. Your task is to reverse the string word by word. The input may contain multiple spaces between words and may have leading o...
The task is to reverse the words in a given string, removing any leading or trailing spaces and replacing multiple spaces between words with a single space.
Split the string into words using spaces as delimiters
Reverse the order of the words
Join the reversed words with a single space between them
Remove any leading or trailing spaces
You are provided with a linked list containing 'N' nodes and an integer 'K'. The task is to reverse the linked list in groups of size K, which means reversing the nodes ...
The task is to reverse a linked list in groups of size K.
Iterate through the linked list in groups of size K
Reverse each group using a helper function
Connect the reversed groups to form the final reversed linked list
Round duration - 60 minutes
Round difficulty - Medium
The interviewer was very polite and straightforward, firstly he introduce himself and then ask me to introduce myself and then ask some ques on my projects and then he jumps to the coding problems.
Given a string STR
consisting of both lower and upper case characters, your task is to remove consecutive duplicate characters from the string a...
The task is to remove consecutive duplicate characters from a given string and return the new string.
Iterate through the characters of the string
Compare each character with the next character
If they are the same, skip the next character
If they are different, add the current character to the new string
Return the new string
Given an N*M matrix filled with integer numbers, determine the maximum sum that can be obtained from a path starting from any cell in the first row to any cell in the last row...
The question asks to find the maximum sum that can be obtained from a path starting from any cell in the first row to any cell in the last row of a given matrix.
Iterate through each cell in the first row and calculate the maximum sum path ending at that cell
For each cell, calculate the maximum sum path ending at that cell by considering the three possible directions
Store the maximum sum path ending at each cell in a se...
Tip 1 : Deep knowledge of the projects mentioned in your resume is a must.
Tip 2 : Practice must do GFG coding questions.
Tip 3 : Practice as many problems as you can from Leetcode.
Tip 1 : Mention 1 or 2 projects in your resume.
Tip 2 : Don't put false things in your resume.
posted on 5 Dec 2023
I applied via gfg and was interviewed before Dec 2022. There were 3 interview rounds.
3 medium DSA problems
I applied via Naukri.com and was interviewed before May 2023. There was 1 interview round.
based on 1 interview
Interview experience
based on 25 reviews
Rating in categories
Associate Consultant
128
salaries
| ₹2.2 L/yr - ₹5.9 L/yr |
Consultant
105
salaries
| ₹2.8 L/yr - ₹13.4 L/yr |
Talent Acquisition Specialist
77
salaries
| ₹2.2 L/yr - ₹5.5 L/yr |
Sales Executive
72
salaries
| ₹1.4 L/yr - ₹4.8 L/yr |
Talent Acquisition Consultant
66
salaries
| ₹3.2 L/yr - ₹6 L/yr |
Randstad
Innovsource Services
eTeam
IMPACT Infotech