Juspay Technologies Interview Questions, Process, and Tips

This round has 3 coding questions mostly based on graph and trees

Q1. A lockable tree problem
Ans. 
Design a data structure for locking/unlocking nodes in a binary tree efficiently.
• Implement a lockable tree data structure with lock(), unlock(), and isLocked() methods.

• Ensure a node can only be locked if all ancestors are unlocked and all descendants are locked.

• Optimize the operations for efficiency.

• Consider using a flag in each node to track its locked status.

• Use a recursive approach to check locking conditions.

• Mainta...read more
Answered by AI
Add your answer
Q2. OS level improvements in above problem
Ans. 
Improving the operating system can enhance performance and efficiency of the system.
• Optimizing memory management to reduce overhead

• Implementing better scheduling algorithms to improve multitasking

• Enhancing file system performance for faster data access

• Improving network stack for better communication speed
Answered by AI
Add your answer

MCQs around CS fundamentals

3 DSA questions on graph

Q1. Hackathon of two parts
Ans. 
Hackathon is a competitive event where teams work on projects within a limited time frame.
• Teams collaborate to solve a specific problem or create a new product

• Participants showcase their technical skills and creativity

• Judges evaluate projects based on innovation, functionality, and presentation
Answered by AI
Add your answer

Q1. DSA and system design
Add your answer

First round 1.1 assessment test consist of total 30 questions in 30 minutes. Apti, technical questions, code snippet related questions.

Q1. There was a question related to array topic in which you have arrrange the no. In ascending order.
Add your answer
Q2. Find the time complexity of binary search of given numbers
Ans. 
Binary search has a time complexity of O(log n) where n is the number of elements in the array.
• Time complexity is O(log n) as it divides the array in half at each step

• Best case is O(1) when the element is found at the middle of the array

• Worst case is O(log n) when the element is not present in the array
Answered by AI
Add your answer

Peoples who come for joining the company they know the method to solve the aptitude test

GD is kept because to know that guy is eligible for doing work or not

Q1. Asking basic questions from the courses what they had do.
Add your answer
Q2. Checking he is eligible for to the work or not.
Add your answer

Q1. Interviewer has to see his confidence, dressing style, straight forward or not.
Add your answer
Q2. Check the he is able to except the challenge or not.
Add your answer

Q1. How much salary that person is wants.
Add your answer
Q2. Salary gives based on the experience of doing the work and based on his knowledge.
Add your answer