PeopleStrong Full Stack Developer Interview Questions and Answers

Round duration - 90 minutes
Round difficulty - Hard

The round was online. It had 3 coding questions to be solved.  Was asked about why are the javascript and jquery used? What is the difference between angular 8 and angular?

Q1. 
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:
True
Example:
...read more
Ans. 
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.
Answered by AI
Add your answer
Q2. 
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, ...read more
Ans. 
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 destination ...read more
Answered by AI
Add your answer
Q3. 
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 ma...read more
Ans. 
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.
Answered by AI
Add your answer