Juspay Technologies Interview Questions, Process, and Tips

Dfs based on graphs ,yes they were lengthy plus ,the compiler was really hard to work on

.n array tree and graph problems

Hackathon round divided into two

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

Q1. General introduction and experience check
Add your answer

Q1. Grilling on resume
Add your answer

Problem statement to be solved using Excel

Q1. Puzzles and case studies
Add your answer

They follow the same pattern questions in every college so go through those. These are easily accessible from Leetcode discussion section.

Q1. Well I was not selected for futther rounds :(
Add your answer

3 coding rounds, hacker earth (2 question), coding hackathon, another coding interview.

Physics and mathematics questions.

Q1. Design a system for messaging multiple teams at a time.
Ans. 
Design a system for messaging multiple teams at a time.
• Implement a messaging platform with channels for each team

• Allow users to subscribe to multiple teams' channels

• Provide options for real-time messaging and notifications

• Include features like file sharing, message search, and user mentions
Answered by AI
Add your answer