ParentPay Technical Lead Interview Questions and Answers

Q1. Coding with design fundamentals on BST and DP
Add your answer

Q1. Coding test with BST, DP
Add your answer
Q2. LLD, HLD on telecom. SOLID principles, Design patterns, System design
Add your answer

Q1. One on one round with Architect and Manager. What do we know about SIP, SS7, Diameter.
Add your answer

Q1. Usual HR questions
Add your answer

Normal coding test on DSA and LLD.

Q1. Java palindrome questiin
Add your answer

Q1. Brush up on algo and data engineer
Add your answer

Q1. Can you provide details about the projects you have completed and your areas of expertise?
Add your answer

Q1. What are the various aspects of big data associated with your work?
Add your answer
Q2. Explain spark Framework
Add your answer

Q1. Salary discussion
Add your answer

Q1. Reverse the given linked list
Add your answer
Q2. Separate out 0's, 1's, and 2's in an array
Ans. 
Separate out 0's, 1's, and 2's in an array
• Create three variables to count the number of 0's, 1's, and 2's in the array

• Loop through the array and increment the respective variable for each occurrence

• Create a new array and add the counted number of 0's, 1's, and 2's in order
Answered by AI
Add your answer

Q1. Remove duplicates from the given array
Ans. 
Remove duplicates from given array of strings
• Create a new empty array

• Loop through the original array and check if the element already exists in the new array

• If not, add it to the new array

• Return the new array
Answered by AI
Add your answer
Q2. Detect a loop in linked list
Ans. 
Loop in linked list can be detected using Floyd's cycle-finding algorithm.
• Floyd's cycle-finding algorithm uses two pointers, one moving at twice the speed of the other.

• If there is a loop, the faster pointer will eventually catch up to the slower pointer.

• If there is no loop, the faster pointer will reach the end of the list.

• Time complexity of this algorithm is O(n) and space complexity is O(1).
Answered by AI
Add your answer