Jupiter Money Interview Questions, Process, and Tips

Round duration - 90 minutes
Round difficulty - Medium

Timing was 9 PM. Platform was not good. Platform was very lagging so overall it was bad experience.

Q1. 
Find the Third Greatest Element
Given an array 'ARR' of 'N' distinct integers, determine the third largest element in the array.
Input:
The first line contains a single integer 'T' representing the numb...read more
Add your answer
Q2. 
Longest Palindromic Substring Problem Statement
You are provided with a string STR of length N. The goal is to identify the longest palindromic substring within this string. In cases where multiple palind...read more
Add your answer
Q3. 
Ninja and Geometry Problem Statement
In this problem, Ninja is provided with two lines on a 2D plane. The first line 'AB' is determined by two points A and B. The second line 'PQ' is determined by two poi...read more
Add your answer

Round duration - 90 minutes
Round difficulty - Medium

Timing was 9 PM. Platform was not good. Platform was very lagging so overall it was bad experience.

Q1. 
Find the Third Greatest Element
Given an array 'ARR' of 'N' distinct integers, determine the third largest element in the array.
Input:
The first line contains a single integer 'T' representing the numb...read more
Ans. Sorting Based Approach
The idea is to sort the array in non-decreasing order, and then return the third element from the back of the array.
 
The steps are as follows :
1. Sort the array in non-decreasing order.
2. Return the third element from the back of the array.
Space Complexity: O(logn)Explanation:
O(1)
 
We are not using any extra space. Thus, the overall space complexity will be O(1).
Time Complexity: O(nlogn)Explan...read more
Answered Anonymously
Add your answer
Q2. 
Longest Palindromic Substring Problem Statement
You are provided with a string STR of length N. The task is to find the longest palindromic substring within STR. If there are several palindromic substring...read more
Ans. Brute Force
1. Generate substrings of the given string such that substring having greater length will be generated first.
2. To do this, run a loop where iterator len will go from N to 1, where N is the length of the given string.
3. Run a nested loop and fix an iterator j that will point at the starting index of the substring.
4. Get the substring from j to j+len.
5. If the substring is a palindrome, return the substring (As the substrin...read more
Answered Anonymously
Add your answer
Q3. 
Ninja and Geometry Problem Statement
In this problem, Ninja is provided with two lines on a 2D plane. The first line 'AB' is determined by two points A and B. The second line 'PQ' is determined by two poi...read more
Ans. Mathematics
The idea behind this approach is to derive the equation of both of the lines ‘AB’ and ‘PQ’ and check if the Slope of these two lines is equal or not. Following are the two cases:
• If the slope of ‘AB’ and ‘PQ’ is the same that means they are parallel so we return -1.
• Else there must a point where ‘AB’ and ‘PQ’ are intersecting.
For a better understanding of this approach, Assume that we have two points which are...read more
Answered Anonymously
Add your answer

Coding round was for 1 hour. 1 medium-difficulty coding question on Arrays was asked. The code could be written on our IDE. Interviewer was friendly and provided good hints and feedback.

Q1. Design a hotel booking management system
Ans. 
A hotel booking management system to handle reservations, room availability, guest information, and payment processing.
• Create a database to store information on rooms, reservations, guests, and payments

• Develop a user interface for guests to search for available rooms and make reservations

• Implement a payment gateway for secure transactions

• Include features for managing room availability, cancellations, and guest check-in...read more
Answered by AI
Add your answer

Q1. General HR questions about our expectations from the job
Add your answer

Basic aptitude test to check the right skill set

Q1. Technical knowledge about the role, responsibilities, etc with various situation handling, decision making
Add your answer

Q1. One on one round with AVP on skill set and knowledge
Add your answer

Q1. One on one round with the CS head
Add your answer

Q1. Final discussion on pay package, joining and other stuffs
Add your answer

Round duration - 45 minutes
Round difficulty - Medium

Two DSA questions were asked in this round in 45 min.

Q1. 
Maximum Subarray Sum Problem Statement
Given an array of integers, determine the maximum possible sum of any contiguous subarray within the array.
Example:
Input:
array = [34, -50, 42, 14, -5, 86]
Out...read more
Add your answer
Q2. 
Odd Occurrence Element Problem Statement
Given an array of integers where each element appears an even number of times except for one element which appears an odd number of times, find the element that ap...read more
Add your answer