Pinnacle Technology 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. Permutation In String
• Check for Base Case i.e if Length of str1 > Length of str2, return false.As substring length is always greater than or equal to permutation never small.
• Generate all the permutations of the short string and then check for each permutation if this string is present as a substring of the second string or not.
• Initialize a global boolean value named flag.
• To generate all the permutations of the small ...read more
Answered Anonymously
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. Depth First Search
This approach will use DFS(Depth First Search) to make a recursive function in which we pass the currCost, which is the current cost. If the light is not green when we reach that junction, we have to add the waiting time in currCost. After that, we will call the recursive function on all the adjacent unvisited junctions by incrementing the currCost with the weight of the edge. We will maintain a vari...read more
Answered Anonymously
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. Bactracking
Approach: We can start the traversal of the paths from the rat’s starting position, i.e. (0,0) keeping track of the visited cells during the traversal. We will recursively go through all the paths possible until the last index of the grid (destination) is reached, and add the path information using which the rat successfully reached the end.
 
Algorithm is as follows:
 
1. Take the starting position of th...read more
Answered Anonymously
Add your answer

Gtfd juun lfxjk nf kf krsz kg khvb.

Sf cv cv nn khg mhh mkgx sv jvv .

Gnn h m gf l y kf, kkyc liv mlbh mh .

Sf jf jdzy kew ha bkkm kgc jyydc .

Q1. Dbb Ku HK VM fb LM GH GH mm GH ui nfdz hx mkm
Add your answer
Q2. Fjnl bmkvhvgndVhfgnk hun jjvj HK HK DG.
Add your answer

Q1. Hjnn HK OK KKK LJ GH
Add your answer
Q2. Th uf GH ur Ed CV kg
Add your answer

KKK lb GU Mk ohhh sf VH mg ui

CJK PJ Mk ng HK LJ VN I'll