Juspay Technologies Interview Questions, Process, and Tips

Q1. Guesstimates , Product Metric etc
Add your answer
Q2. Resume Overview
Add your answer

A problem will be given and you have to edit the code to change functionality

Q1. Puzzles and aptitude
Add your answer
Q2. Minimum number of races to find the fastest of 25 horses
Ans. 
The minimum number of races needed to find the fastest of 25 horses is 5.
• Divide the 25 horses into 5 groups of 5 horses each.

• Conduct 5 races with each group to determine the fastest horse in each group.

• Then conduct a final race with the winners from each group to find the fastest horse overall.
Answered by AI
View 2 more answers

React assignment about a live cat demo project

Mostly graph questions were asked

Q1. Very famous question tree of space has been asked
Add your answer

Testing related MCQs

Q1. Customer api creation in postman
Ans. 
Creating customer API in Postman for testing purposes
• Use Postman to create a new request with the necessary endpoint and parameters

• Set up authentication if required for the API

• Add headers, body, and any other necessary information for the request

• Test the API request to ensure it is functioning correctly

• Save the request in a collection for future testing
Answered by AI
Add your answer
Q2. Writing test cases for customer paying more payments to same order.
Ans. 
Write test cases for customer paying more payments to same order
• Verify that the system allows the customer to make multiple payments towards the same order

• Check that the total amount paid by the customer is correctly updated for the order

• Ensure that the payment history for the order reflects all payments made by the customer
Answered by AI
Add your answer
Q3. Observing the UIs and giving suggestions and also test cases
Add your answer

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

First round is apti when in placement

Too hard all are dsa questions

30 question -30 min,topics - profit or loss , time work distance ,time speed ,upstreaam downstream percentage ,probability

2 dsa questions were asked related to graph

Test on hackerearth binary tree

Q1. Project related
Add your answer
Q2. 1 dsa question were asked
Add your answer