AmbitionBox
Interview Questions
- Reviews
- Salaries
- Interview Questions
- About Company
- Benefits
- Jobs
- Office Photos
- Community
Add office photos
Filter interviews by
PeopleStrong Interview Questions and Answers
29 Interview questions
Count Set Bits Problem Statement
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
Shortest Path in an Unweighted Graph
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...
Reverse Words in a String: Problem Statement
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 or...
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
Aggressive Cows Problem Statement
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 w...
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 se...
Maximum Path Sum in a Matrix
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...
Remove Consecutive Duplicates From String Problem Statement
Given a string STR consisting of both lower and upper case characters, your task is to remove consecutive duplicate characters from the string an...
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
Permutation In String Problem Statement
Given two strings, str1 and str2, determine whether str2 contains any permutation of str1 as a substring.
Input:
str1 = “ab”
str2 = “aoba”
Output:
TrueExample:
...Check if a string contains any permutation of another string as a substring.
Iterate through str2 with a sliding window of length str1, check if any permutation of str1 is present.
Use a hashmap to store the frequency of characters in str1 and str2 for comparison.
If the frequencies of characters in the sliding window match the frequencies of characters in str1, return True.
Rat in a Maze Problem Statement
You need to determine all possible paths for a rat starting at position (0, 0) in a square maze to reach its destination at (N-1, N-1). The maze is represented as an N*N mat...
Find all possible paths for a rat in a maze from start to finish, moving in 'U', 'D', 'L', 'R' directions.
Use backtracking to explore all possible paths in the maze.
Keep track of visited cells to avoid loops.
Recursively try moving in all directions and backtrack when reaching dead ends.
Return the valid paths in alphabetical order as an array of strings.
Minimum Time Problem Statement
In a city with ‘N’ junctions and ‘M’ bi-directional roads, each junction is connected to other junctions with specified travel times. No road connects a junction to itself, a...
The problem involves finding the minimum time to travel from a source junction to a destination junction in a city with specified travel times and green light periods.
Input consists of the number of test cases, number of junctions and roads, green light periods, road connections with travel times, and source/destination junctions.
Output should be the minimum time needed from source to destination, or -1 if destina...
PeopleStrong Interview Experiences
53 interviews found
Anonymous
(2 Questions)
- Q1. Project Discussions
- Q2. Java, Spring boot, Database and Angular
I appeared for an interview in Feb 2025, where I was asked the following questions.
- Q1. Inteview 1: Java + SpringBoot + DSA (Medium level questions) + Database Questions
- Q2. Interview 2: Java + Syste Design -> Worst experience ever, the interviewer copy pasted some questions, asked me to not explain anything and rejected for answering with the right answers, also left 40 mi...
I applied via Job Portal and was interviewed in Jul 2024. There was 1 interview round.
(2 Questions)
- Q1. Distance bw 2 nodes in binary tree
- Ans.
To find the distance between two nodes in a binary tree, we can find the distance from the root to each node and then calculate the distance between the two nodes.
Calculate the distance from the root to each node using a recursive function
Find the lowest common ancestor of the two nodes
Calculate the distance from each node to the lowest common ancestor and add them together to get the total distance
- Q2. Valid sudoku of 9*9
- Ans.
A valid sudoku of 9*9 is a grid where each row, column, and 3x3 subgrid contains the numbers 1-9 without repetition.
Each row must contain the numbers 1-9 without repetition
Each column must contain the numbers 1-9 without repetition
Each 3x3 subgrid must contain the numbers 1-9 without repetition
Skills evaluated in this interview
Ankita Sharma
(1 Question)
- Q1. Explain normalization in sql?
- Ans.
Normalization in SQL is the process of organizing data in a database to reduce redundancy and improve data integrity.
Normalization is used to eliminate data redundancy by breaking up tables into smaller, related tables.
It helps in reducing data anomalies such as update anomalies, insert anomalies, and delete anomalies.
There are different levels of normalization - 1NF, 2NF, 3NF, BCNF, and 4NF, each with specific rules t...
Skills evaluated in this interview
Selected
I appeared for an interview in Feb 2025.
(2 Questions)
- Q1. Can you tell us about yourself?
- Q2. Can you describe your previous job?
- Ans.
In my previous role, I focused on enhancing employee engagement and optimizing workplace culture through various initiatives.
Conducted regular employee surveys to gather feedback and identify areas for improvement.
Implemented wellness programs that increased participation by 30%, promoting a healthier work-life balance.
Collaborated with HR to develop training sessions aimed at career development, resulting in a 20% inc...
A standard 30-minute aptitude test.
Sudhanshu Ranjan
Binary search
find minium in array.
I applied via Walk-in and was interviewed in Oct 2023. There were 3 interview rounds.
(3 Questions)
- Q1. Excel realated questions and answers
- Q2. Vlookup working formula
- Ans.
Vlookup is a function in Excel used to search for a value in a table and return a corresponding value.
Syntax: =VLOOKUP(lookup_value, table_array, col_index_num, [range_lookup])
lookup_value: The value to search for in the first column of the table.
table_array: The range of cells that contains the data.
col_index_num: The column number in the table from which to retrieve the value.
range_lookup: Optional. TRUE for approxim...
- Q3. H lookup formula
- Ans.
HLOOKUP is a function in Excel used to search for a value in the top row of a table and return a value in the same column from a specified row.
HLOOKUP stands for Horizontal Lookup.
It is used to search for a value in the top row of a table and return a value in the same column from a specified row.
Syntax: =HLOOKUP(lookup_value, table_array, row_index_num, [range_lookup])
Example: =HLOOKUP(123, A1:D4, 3, FALSE) will searc...
Assignment 1 ,3 and 3
Payroll realated questions and answers
Interview Preparation Tips
- Excel
- Finance
- investment
Selected
Normal test with VARC Maths
(1 Question)
- Q1. About Principle consultancy
(1 Question)
- Q1. Tell me about yourself
ammu madhuri
Selected
I applied via Shine and was interviewed in Feb 2024. There were 2 interview rounds.
Genral knowledge questions based on Government
(5 Questions)
- Q1. Introduce yourself
- Q2. What choosed to select this field
- Q3. Education Backround
- Q4. Why role change is required
- Q5. Relocation is comfortable
- Ans.
Relocation can be comfortable with proper planning and support.
Proper planning and research can help make the relocation process smoother
Having a support system in place can ease the transition to a new location
Utilizing relocation services provided by the company can also make the process more comfortable
Kapil Nawhal
(2 Questions)
- Q1. DSA like stack,
- Q2. Framework questions
Top trending discussions
PeopleStrong Interview FAQs
The duration of PeopleStrong interview process can vary, but typically it takes about less than 2 weeks to complete.
Tell us how to improve this page.
PeopleStrong Interviews By Designations
- PeopleStrong Principal Consultant Interview Questions
- PeopleStrong Senior Software Developer Interview Questions
- PeopleStrong HR Recruiter Interview Questions
- PeopleStrong Senior Software Engineer Interview Questions
- PeopleStrong Payroll Specialist Interview Questions
- PeopleStrong HR Specialist Interview Questions
- PeopleStrong Recruitment Associate Interview Questions
- PeopleStrong Software Engineer Interview Questions
- Show more
Interview Questions for Popular Designations
Overall Interview Experience Rating
based on 47 interview experiences
Difficulty level
Duration
Interview Questions from Similar Companies
PeopleStrong Reviews and Ratings
based on 619 reviews
Rating in categories
11-21 Yrs
Not Disclosed
4-8 Yrs
Not Disclosed
12-25 Yrs
Not Disclosed
|
Senior Recruitment Associate
261
salaries
|  ₹3.5 L/yr - ₹7.7 L/yr |
|
Recruitment Associate
175
salaries
| ₹2.5 L/yr - ₹5.2 L/yr |
|
Recruitment Specialist
118
salaries
| ₹4.5 L/yr - ₹9.8 L/yr |
|
Payroll Specialist
97
salaries
| ₹2.3 L/yr - ₹7.2 L/yr |
|
Software Development Engineer II
81
salaries
| ₹13.3 L/yr - ₹24 L/yr |
Randstad
Team Lease
Innovsource Services
IMPACT Infotech
- Home >
- Interviews >
- PeopleStrong Interview Questions
