Juspay Technologies Sdet Engineer Interview Questions and Answers

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

Q1. Basics about previous work
Add your answer

152. Maximum Product Subarray
Medium
17.6K
552
Companies
Given an integer array nums, find a
subarray
that has the largest product, and return the product.

The test cases are generated so that the answer will fit in a 32-bit integer.



Example 1:

Input: nums = [2,3,-2,4]
Output: 6
Explanation: [2,3] has the largest product 6.
Example 2:

Input: nums = [-2,0,-1]
Output: 0
Explanation: The result cannot be 2, because [-2,-1] is not a subarray.


Constraints:

1 <= nums.length <= 2 * 104
-10 <= nums[i] <= 10
The product of any prefix or suffix of nums is guaranteed to fit in a 32-bit integer.

Basic quants and advanced quants