People Group Software Engineer Interview Questions and Answers

3 questions easy-medium level leetcode problem I solved 2 completely and 3rd question partially (9/15 test cases passed) to move on to 2nd round

Q1. Implement an app similar to splitwise
Add your answer

1. PEAK ELEMENT QUESTION.
2. COIN DENOMINATION

Q1. Create pagination component using an api show the data for the pages
Ans. 
Create a pagination component using an API to display data for different pages.
• Use API to fetch data for each page

• Implement pagination logic to display data for each page

• Allow users to navigate between pages
Answered by AI
Add your answer

Q1. He asked to invert a binary tree
Add your answer
Q2. Deep dive in projects
Add your answer
Q3. Asked me indept js questions
Add your answer

Q1. Js question with code snippets
Add your answer

Given some ant ui design to reacreate from scretch

Q1. Asked system design for online movie booking plateform
Add your answer

Implement your own state management in React and integrate it into a React application.

Round duration - 45 minutes
Round difficulty - Easy

This was a coding test with 2 DSA questions.

Q1. Merge two sorted arrays
Ninja has been given two sorted integer arrays/lists ‘ARR1’ and ‘ARR2’ of size ‘M’ and ‘N’. Ninja has to merge these sorted arrays/lists into ‘ARR1’ as one sorted array. You may hav...read more
Ans. 
A simple approach would be to create a new arrays with size as sum of the sizes of both the arrays. Copy the elements of both the arrays in the new array and sort the array. 
A space optimized approach also exists. While traversing the two sorted arrays parallelly, if we encounter the jth second array element is smaller than ith first array element, then jth element is to be included and replace some kth element in...read more
Answered by CodingNinjas
View 2 more answers
Q2. Count ways to reach the n’th stair
You have been given a number of stairs. Initially, you are at the 0th stair, and you need to reach the Nth stair. Each time you can either climb one step or two steps. Yo...read more
Ans. 
The question can be approached using recursion. The person can reach nth stair from either (n-1)th stair or from (n-2)th stair. Hence, for each stair n, find out the number of ways to reach n-1th stair and n-2th stair and add them to give the answer for the nth stair. Therefore the expression for such an approach comes out to be : ways(n) = ways(n-1) + ways(n-2)

This is an expression for Fibonacci numbers only, where wa...read more
Answered by CodingNinjas
View 5 more answers

Round duration - 60 minutes
Round difficulty - Medium

This was the first round with questions on DSA and Low Level design.

Q1. Trapping Rain Water
You have been given a long type array/list 'ARR' of size 'N'. It represents an elevation map wherein 'ARR[i]' denotes the elevation of the 'ith' bar. Pri...read more
Ans. 
Basic Insight: 
An element of the array can store water if there are higher bars on the left and right. The amount of water to be stored in every element can be found out by finding the heights of bars on the left and right sides. The idea is to compute the amount of water that can be stored in every element of the array.

Algorithm: 
1) Create two arrays left and right of size n. create a variable max_ = INT_MIN...read more
Answered by CodingNinjas
View 3 more answers
Q2. System Design Question
Low Level design of hotel management system
Ans. 
Tip 1 : Firstly, remember that the system design round is extremely open-ended and there’s no such thing as a standard answer. Even for the same question, you’ll have a totally different discussion with different interviewers.

Tip 2 : Before you jump into the solution always clarify all the assumptions you’re making at the beginning of the interview. Ask questions to identify the scope of the system. This will clear the...read more
Answered by CodingNinjas
Add your answer