AmbitionBox
Interview Questions
- Reviews
- Salaries
- Interview Questions
- About Company
- Benefits
- Jobs
- Office Photos
- Community
Add office photos
i
Jupiter
Money
Compare
Filter interviews by
Jupiter Money Interview Questions and Answers for Freshers
9 Interview questions
Partial BST Problem Statement
Check if a given binary tree is a Partial Binary Search Tree (BST). A Partial BST adheres to the following properties:
- The left subtree of a node contains only nodes with ...
Check if a binary tree is a Partial Binary Search Tree (BST) based on specific properties.
Traverse the tree in level order and check if each node satisfies the properties of a Partial BST.
Use recursion to check if the left and right subtrees are also Partial BSTs.
Compare the data of each node with its children to ensure the BST properties are maintained.
Example: For input 1 2 3 4 -1 5 6 -1 7 -1 -1 -1 -1 -1 -1, the...
Merge Two Sorted Linked Lists Problem Statement
You are provided with two sorted linked lists. Your task is to merge them into a single sorted linked list and return the head of the combined linked list.
...
Merge two sorted linked lists into a single sorted linked list.
Create a new linked list to store the merged result.
Iterate through both input linked lists simultaneously, comparing and adding nodes to the result list.
Handle cases where one list is empty or both lists are empty.
Ensure the final merged list is sorted in ascending order.
Use constant space complexity and linear time complexity for the solution.
Shortest Path in an Unweighted Graph
The city of Ninjaland is represented as an unweighted graph with houses and roads. There are 'N' houses numbered 1 to 'N', connected by 'M' bidirectional roads. A road ...
Implement a function to find the shortest path in an unweighted graph from a given start house to a destination house.
Use Breadth First Search (BFS) algorithm to find the shortest path in an unweighted graph.
Maintain a queue to explore neighboring houses and keep track of visited houses to avoid revisiting them.
Return the path once the destination house is reached.
Example: For input N=8, M=9, S=1, T=8 and roads (1...
Capture Region Problem Statement
You are given a matrix having N rows and M columns. Each cell of the matrix contains either 'X' or 'O'. Your task is to flip all the regions of 'O' that are completely surr...
Given a matrix with 'X' and 'O', flip all 'O' regions completely surrounded by 'X' to 'X'.
Iterate through the matrix and identify 'O' regions completely surrounded by 'X'.
Use DFS/BFS to mark all 'O's in the surrounded region.
Update the matrix by flipping all marked 'O's to 'X'.
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 palindr...
Identify the longest palindromic substring in a given string.
Iterate through the string and expand around each character to find palindromes
Keep track of the longest palindrome found
Return the longest palindromic substring with the smallest start index
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 numbe...Find the third largest element in an array of distinct integers.
Sort the array in descending order and return the element at index 2.
Handle cases where the array has less than 3 elements separately.
Consider using a set to ensure distinct elements in the array.
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 poin...
Calculate the intersection point of two lines on a 2D plane with precision up to six decimal places.
Implement a function to calculate the intersection point of two lines on a 2D plane
Handle precision up to six decimal places in the output
Return -1.000000 -1.000000 if the lines do not intersect
Ensure the lines 'AB' and 'PQ' are distinct
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 app...
Find the element that appears an odd number of times in an array of integers.
Iterate through the array and use XOR operation to find the element that appears odd number of times.
Keep a count of occurrences of each element using a hashmap.
Return the element that has an odd count of occurrences.
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]
Outp...
Find the maximum sum of any contiguous subarray within an array of integers.
Iterate through the array and keep track of the maximum sum of subarrays encountered so far.
Use Kadane's algorithm to efficiently find the maximum subarray sum.
Handle cases where all elements are negative by returning the maximum element in the array.
Example: For array [34, -50, 42, 14, -5, 86], the maximum subarray sum is 137.
Jupiter Money Interview Experiences for Freshers
9 interviews found
Anonymous
Selected
I applied via Referral and was interviewed in Sep 2023. There were 4 interview rounds.
Technical SQL Coding Round of 1 hour
Began with 2 easy generic question -
1. No. of record on different types of joins.
2. Employees who have higher salaries than their managers,
Then moved to medium questions -
1. Implement Rolling sum with & without window functions.
2. Other questions were on CTEs, Joins & other complex queries.
Bar Raiser Round of 1 hour involving -
1. Case study: How can we leverage product knowledge & analytics to increase Amazon Prime Revenue from 10% to 12%?
2. Metrics awareness: Common metrics discussion like DAU, PDAU, MAU, Retention, Churn, etc.
3. Resume based work exp discussion
(1 Question)
- Q1. Quick culture fitment round with HR discussing about past work experience, my expectations & why I want to join Jupiter.
Interview Preparation Tips
- SQL
Selected
I appeared for an interview before May 2024, where I was asked the following questions.
- Q1. Why you want to join Jupiter
- Ans.
I want to join Jupiter to contribute to innovative KYC solutions and enhance customer trust in a dynamic financial environment.
Passion for compliance: I am dedicated to ensuring regulatory adherence, which is crucial in the KYC field.
Innovative environment: Jupiter's focus on technology-driven solutions aligns with my desire to work in a forward-thinking company.
Career growth: I see opportunities for professional devel...
- Q2. Why you want to join this role.
- Ans.
I am eager to join as a KYC Analyst to leverage my analytical skills and contribute to compliance and risk management.
I have a strong background in compliance and risk assessment, which aligns well with the KYC Analyst role.
My attention to detail ensures accurate identification and verification of clients, minimizing potential risks.
I am passionate about financial integrity and helping organizations maintain compliance...
Dheeraj CH
Selected
I applied via Referral and was interviewed before Jun 2023. There were 2 interview rounds.
(2 Questions)
- Q1. Intermeditae sql questions
- Q2. SQL proficiency was expected
(2 Questions)
- Q1. SQL proficiency expected
- Q2. SQL proficiency expected
Interview Preparation Tips
- SQL
- MySQL
- Python
- Credit Risk Analysis
- Financial Services
I appeared for an interview in May 2022.
(1 Question)
Round duration - 90 minutes
Round difficulty - Medium
Timings: it was late night. I started the test at 10 pm
- Q1.
Partial BST Problem Statement
Check if a given binary tree is a Partial Binary Search Tree (BST). A Partial BST adheres to the following properties:
- The left subtree of a node contains only nodes with...
- Ans.
Check if a binary tree is a Partial Binary Search Tree (BST) based on specific properties.
Traverse the tree in level order and check if each node satisfies the properties of a Partial BST.
Use recursion to check if the left and right subtrees are also Partial BSTs.
Compare the data of each node with its children to ensure the BST properties are maintained.
Example: For input 1 2 3 4 -1 5 6 -1 7 -1 -1 -1 -1 -1 -1, the outp...
(1 Question)
Round duration - 45 minutes
Round difficulty - Medium
It was the interviw round.
the environment was good.
the interviewer was very nice to me.
- Q1.
Merge Two Sorted Linked Lists Problem Statement
You are provided with two sorted linked lists. Your task is to merge them into a single sorted linked list and return the head of the combined linked list.
... - Ans.
Merge two sorted linked lists into a single sorted linked list.
Create a new linked list to store the merged result.
Iterate through both input linked lists simultaneously, comparing and adding nodes to the result list.
Handle cases where one list is empty or both lists are empty.
Ensure the final merged list is sorted in ascending order.
Use constant space complexity and linear time complexity for the solution.
Interview Preparation Tips
Tip 1 : Please have a strong hold on data structures mainly linked lists, arrays, maths, stacks, trees
Tip 2 : Must explore about DBMS. Means SQL, writing efficient queries, about indexing and other SQL backend process.
Tip 3 : Should work on spring boot. try build some project using spring boot with java (Gradle) as Jupiter's backend tech is mainly based on spring boot with java.
Tip 1 : Mention only those skills on which you have worked on properly. no need to flood the resume with skills about which you need a little.
Tip 2 : Must mention the links of projects which you have worked on.
Skills evaluated in this interview
I appeared for an interview in Oct 2021.
(1 Question)
Round duration - 120 minutes
Round difficulty - Medium
The online test was for 2 hrs in which 5 coding questions were asked. 3 questions were pretty easy and 2 were of medium difficulty level. I was able to solve all 5 questions.
- Q1.
Shortest Path in an Unweighted Graph
The city of Ninjaland is represented as an unweighted graph with houses and roads. There are 'N' houses numbered 1 to 'N', connected by 'M' bidirectional roads. A road...
- Ans.
Implement a function to find the shortest path in an unweighted graph from a given start house to a destination house.
Use Breadth First Search (BFS) algorithm to find the shortest path in an unweighted graph.
Maintain a queue to explore neighboring houses and keep track of visited houses to avoid revisiting them.
Return the path once the destination house is reached.
Example: For input N=8, M=9, S=1, T=8 and roads (1, 2),...
(1 Question)
Round duration - 60 minutes
Round difficulty - Medium
It started with the introduction and then we had a discussion on the projects I had made. He asked for several Backend and Database concepts like locking in DB, sessions, etc as I had mentioned backend internship in my resume. It took around half an hour.
Then he gave me a coding question based on the graph
- Q1.
Capture Region Problem Statement
You are given a matrix having
Nrows andMcolumns. Each cell of the matrix contains either 'X' or 'O'. Your task is to flip all the regions of 'O' that are completely sur... - Ans.
Given a matrix with 'X' and 'O', flip all 'O' regions completely surrounded by 'X' to 'X'.
Iterate through the matrix and identify 'O' regions completely surrounded by 'X'.
Use DFS/BFS to mark all 'O's in the surrounded region.
Update the matrix by flipping all marked 'O's to 'X'.
Interview Preparation Tips
Tip 1 : Practice 250+ standard quality questions.
Tip 2 : Do some good real-life projects in Front-end or Backend Development
Tip 3 : Try to find an internship that will not only enhance your development skills but also increase your resume selection chances.
Tip 1 : Add quality projects (2 will be sufficient)
Tip 2 : Add your coding profile links.
Skills evaluated in this interview
I appeared for an interview in Apr 2021.
(3 Questions)
Round duration - 90 minutes
Round difficulty - Hard
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... - Ans.
Find the third largest element in an array of distinct integers.
Sort the array in descending order and return the element at index 2.
Handle cases where the array has less than 3 elements separately.
Consider using a set to ensure distinct elements in the array.
- Q2.
Longest Palindromic Substring Problem Statement
You are provided with a string
STRof lengthN. The goal is to identify the longest palindromic substring within this string. In cases where multiple palind... - Ans.
Identify the longest palindromic substring in a given string.
Iterate through the string and expand around each character to find palindromes
Keep track of the longest palindrome found
Return the longest palindromic substring with the smallest start index
- 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...
- Ans.
Calculate the intersection point of two lines on a 2D plane with precision up to six decimal places.
Use the formula for finding the intersection point of two lines in 2D space.
Handle precision issues that may arise due to floating-point arithmetic.
Return -1.000000 -1.000000 if the lines do not intersect.
Ensure the lines 'AB' and 'PQ' are distinct.
Interview Preparation Tips
Tip 1 : Have some projects.
Tip 2 : Do a course from Coding Ninjas.
Tip 1 : Keep it short.
Tip 2 : Do not put false things.
Skills evaluated in this interview
I appeared for an interview in Apr 2021.
(3 Questions)
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... - Ans.
Find the third largest element in an array of distinct integers.
Sort the array in descending order and return the element at index 2.
Handle cases where the array has less than 3 elements separately.
Use a set to store distinct elements for efficient processing.
- Q2.
Longest Palindromic Substring Problem Statement
You are provided with a string
STRof length N. The task is to find the longest palindromic substring withinSTR. If there are several palindromic substring... - Ans.
Find the longest palindromic substring in a given string.
Iterate through the string and expand around each character to find palindromes
Keep track of the longest palindrome found so far
Return the longest palindromic substring
- 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...
- Ans.
Calculate the intersection point of two lines on a 2D plane with precision up to six decimal places.
Implement a function to calculate the intersection point of two lines on a 2D plane
Handle precision up to six decimal places in the output
Return -1.000000 -1.000000 if the lines do not intersect
Ensure the lines 'AB' and 'PQ' are distinct
Interview Preparation Tips
Tip 1 : Have some projects.
Tip 2 : Do a course from Coding Ninjas.
Tip 1 : Keep it short
Tip 2 : Add skills iff you are sure
Skills evaluated in this interview
I appeared for an interview in Apr 2021.
(3 Questions)
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... - Ans.
Find the third largest element in an array of distinct integers.
Sort the array in descending order and return the element at index 2.
Handle cases where there are less than 3 elements in the array.
Consider edge cases like negative integers and duplicates.
- Q2.
Longest Palindromic Substring Problem Statement
You are provided with a string
STRof lengthN. The goal is to identify the longest palindromic substring within this string. In cases where multiple palind... - Ans.
Identify the longest palindromic substring in a given string.
Iterate through each character in the string and expand around it to find palindromes
Keep track of the longest palindrome found so far
Return the longest palindromic substring with the smallest start index
- 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...
- Ans.
Calculate the intersection point of two lines on a 2D plane with precision up to six decimal places.
Implement a function to calculate the intersection point of two lines on a 2D plane
Handle precision up to six decimal places in the output
Return -1.000000 -1.000000 if the lines do not intersect
Ensure the lines 'AB' and 'PQ' are distinct
Interview Preparation Tips
Tip 1 : Have some projects.
Tip 2 : Do a course from Coding Ninjas.
Tip 1 : Keep it short.
Tip 2 : Do not put false things.
Skills evaluated in this interview
I appeared for an interview in Feb 2021.
(2 Questions)
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...
- Ans.
Find the maximum sum of any contiguous subarray within an array of integers.
Iterate through the array and keep track of the maximum sum of subarrays encountered so far.
Use Kadane's algorithm to efficiently find the maximum subarray sum.
Handle cases where all elements are negative by returning the maximum element in the array.
Example: For array [34, -50, 42, 14, -5, 86], the maximum subarray sum is 137.
- 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...
- Ans.
Find the element that appears an odd number of times in an array of integers.
Iterate through the array and use XOR operation to find the element that appears odd number of times.
Keep a count of occurrences of each element using a hashmap.
Return the element that has an odd count of occurrences.
Interview Preparation Tips
Tip 1 : Practice dsa from leetcode
Tip 2 : Compete in coding contests
Tip 3 : Do at least 2-3 projects
Tip 1 : If you have some past experience, add it.
Tip 2 : Also add your projects.
Skills evaluated in this interview
Top trending discussions
Interview questions from similar companies
I applied via Campus Placement and was interviewed in Jan 2024. There were 3 interview rounds.
Easy doable questions ( can be completed in 30 mins)
(1 Question)
- Q1. Basic DSA, OOPS, SQL questions
(1 Question)
- Q1. Complex and hard DSA problems( Dynamic programming questions) to be written on paper.
Interview Preparation Tips
Jupiter Money Interview FAQs
Some of the top questions asked at the Jupiter Money interview for freshers -
The duration of Jupiter Money interview process can vary, but typically it takes about less than 2 weeks to complete.
Tell us how to improve this page.
Jupiter Money Interviews By Designations
- Jupiter Money Software Developer Interview Questions
- Jupiter Money Data Analyst Interview Questions
- Jupiter Money Software Developer Intern Interview Questions
- Jupiter Money Risk Analyst Interview Questions
- Jupiter Money Software Engineer Interview Questions
- Jupiter Money Assistant Manager Interview Questions
- Jupiter Money Backend Developer Interview Questions
- Jupiter Money Software Development Engineer Interview Questions
- Show more
Interview Questions for Popular Designations
- Software Developer Interview Questions
- Data Analyst Interview Questions
- Senior Executive Interview Questions
- Software Engineer Interview Questions
- Intern Interview Questions
- Business Analyst Interview Questions
- Graduate Engineer Trainee (Get) Interview Questions
- Accountant Interview Questions
- Show more
Overall Interview Experience Rating
based on 2 interview experiences
Difficulty level
Duration
Interview Questions from Similar Companies
Jupiter Money Reviews and Ratings
based on 106 reviews
Rating in categories
|
Customer Support Executive
23
salaries
|  ₹3.8 L/yr - ₹6.5 L/yr |
|
Software Engineer
17
salaries
| ₹20.1 L/yr - ₹35 L/yr |
|
Customer Service Executive
17
salaries
| ₹5 L/yr - ₹6.5 L/yr |
|
Software Development Engineer II
16
salaries
| ₹23.8 L/yr - ₹48 L/yr |
|
Product Manager
12
salaries
| ₹13 L/yr - ₹39 L/yr |
Rupeek
Razorpay
ACKO
Revolut
- Home >
- Interviews >
- Jupiter Money Interview Questions >
- Jupiter Money Interview Questions for Fresher
