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 Software Developer Interview Questions and Answers
7 Interview questions
Design a chess game with classes for pieces, board, and game logic.
Create a class for each chess piece (e.g., Pawn, Rook, Knight) with movement rules.
Implement a Board class to manage the 8x8 grid and piece placement.
Design a Game class to handle turns, check/checkmate conditions, and game state.
Use an Enum for piece colors (e.g., WHITE, BLACK) to differentiate players.
Consider implementing a user interface for pl...
Shortest Path in a Binary Matrix Problem Statement
Given a binary matrix of size N * M where each element is either 0 or 1, find the shortest path from a source cell to a destination cell, consisting only ...
Find the shortest path in a binary matrix from a source cell to a destination cell consisting only of 1s.
Use Breadth First Search (BFS) algorithm to find the shortest path.
Keep track of visited cells to avoid revisiting them.
Update the path length as you traverse through the matrix.
Return -1 if no valid path exists.
Design a URL shortener system
Generate a unique short code for each URL
Store the mapping of short code to original URL in a database
Redirect users from short URL to original URL when accessed
Consider implementing features like custom short codes, expiration dates, and analytics
Ensure scalability and performance by using distributed systems and caching
Discussed coding problem, past projects, and behavioral questions in SDE - 1 interview.
Coding problem: Discussed how I optimized a sorting algorithm in a previous project.
Past projects: Talked about a web application I developed using React and Node.js.
Behavioral questions: Shared how I handled a conflict within a team during a project.
Example: Explained how I implemented a feature in a mobile app that improved us...
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 for multiple test cases.
Sort the array in descending order and select the third element.
Use a min-heap of size 3 to keep track of the top three largest elements.
Example: For ARR = [7, 4, 9, 1, 3], the third largest is 4.
Example: For ARR = [10, 20, 30, 40], the third largest is 20.
Jupiter Money HR Interview Questions
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
Jupiter Money Software Developer Interview Experiences
5 interviews found
Ali Mobasshir
Selected
I applied via Company Website and was interviewed in Aug 2023. There were 4 interview rounds.
(1 Question)
- Q1. 1 - Easy Medium Question. Discuss the approach with interviewer and then implement it. The code should work, thats important.
(1 Question)
- Q1. LLD round to design Chess.
- Ans.
Design a chess game with classes for pieces, board, and game logic.
Create a class for each chess piece (e.g., Pawn, Rook, Knight) with movement rules.
Implement a Board class to manage the 8x8 grid and piece placement.
Design a Game class to handle turns, check/checkmate conditions, and game state.
Use an Enum for piece colors (e.g., WHITE, BLACK) to differentiate players.
Consider implementing a user interface for player ...
(1 Question)
- Q1. Hiring manager round. Grilling on resume and past experience questions
Anonymous
I appeared for an interview in May 2022.
(1 Question)
Round duration - 50 mins
Round difficulty - Medium
First round was coding round, where i was asked 2 DS algo questions, 1 was easy and other was of medium difficulty
- Q1.
Shortest Path in a Binary Matrix Problem Statement
Given a binary matrix of size
N * Mwhere each element is either 0 or 1, find the shortest path from a source cell to a destination cell, consisting only... - Ans.
Find the shortest path in a binary matrix from a source cell to a destination cell consisting only of 1s.
Use Breadth First Search (BFS) algorithm to find the shortest path.
Keep track of visited cells to avoid revisiting them.
Update the path length as you traverse through the matrix.
Return -1 if no valid path exists.
(1 Question)
Round duration - 50 mins
Round difficulty - Easy
I was asked to design url shortner
- Q1. Can you explain how you would design a URL shortener?
- Ans.
Design a URL shortener system
Generate a unique short code for each URL
Store the mapping of short code to original URL in a database
Redirect users from short URL to original URL when accessed
Consider implementing features like custom short codes, expiration dates, and analytics
Ensure scalability and performance by using distributed systems and caching
(1 Question)
Round duration - 50 mins
Round difficulty - Medium
This was hiring manager round
- Q1. Can you discuss a coding problem you encountered, your past projects, and any behavioral questions related to your experiences?
- Ans.
Discussed coding problem, past projects, and behavioral questions in SDE - 1 interview.
Coding problem: Discussed how I optimized a sorting algorithm in a previous project.
Past projects: Talked about a web application I developed using React and Node.js.
Behavioral questions: Shared how I handled a conflict within a team during a project.
Example: Explained how I implemented a feature in a mobile app that improved user en...
Interview Preparation Tips
Tip 1 : Prepare DS and algo well(i prepared from GFG)
Tip 2 : Must know basics of DBMS and OS
Tip 3 : Be confident and genuine
Tip 1 : Prepare resume iteratively
Tip 2 : show ur resume to seniors and ask for suggestions
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 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
Top trending discussions
Interview questions from similar companies
I appeared for an interview before Sep 2020.
(1 Question)
Round duration - 90 mins
Round difficulty - Hard
There were questions related to DP and DFS.
- Q1.
Trapping Rain Water Problem Statement
You are given a long type array/list
ARRof sizeN, representing an elevation map. The valueARR[i]denotes the elevation of theithbar. Your task is to determine th... - Ans.
Calculate the total amount of rainwater that can be trapped between given elevations in an array.
Iterate through the array and calculate the maximum height on the left and right of each bar.
Calculate the amount of water that can be trapped at each bar by taking the minimum of the maximum heights on the left and right.
Sum up the trapped water at each bar to get the total trapped water for the entire array.
(3 Questions)
Round duration - 60 mins
Round difficulty - Medium
At first, I was asked about the different projects that I have done so far. We had a detailed discussion on the same.
He also checked my OOP concepts
- Q1. Can you describe the process of designing an LRU Cache from scratch during your System Design Round?
- Ans.
Designing an LRU Cache involves implementing a data structure that stores a fixed number of items and removes the least recently used item when full.
Start by defining the data structure for the cache, typically using a combination of a hashmap and a doubly linked list.
Implement methods for getting and setting key-value pairs in the cache.
When a new item is added to the cache, check if it exceeds the maximum capacity. I...
- Q2.
Reverse Linked List Problem Statement
Given a Singly Linked List of integers, your task is to reverse the Linked List by altering the links between the nodes.
Input:
The first line of input is an intege... - Ans.
Reverse a singly linked list by altering the links between nodes.
Iterate through the linked list and reverse the links between nodes
Use three pointers to keep track of the current, previous, and next nodes
Update the links between nodes to reverse the list
Return the head of the reversed linked list
- Q3.
Middle of a Linked List
You are given the head node of a singly linked list. Your task is to return a pointer pointing to the middle of the linked list.
If there is an odd number of elements, return the ...
- Ans.
Return the middle element of a singly linked list, or the one farther from the head if there are even elements.
Traverse the linked list with two pointers, one moving twice as fast as the other
When the fast pointer reaches the end, the slow pointer will be at the middle
If there are even elements, return the one that is farther from the head node
Handle edge cases like linked list of size 1 or empty list
Round duration - 60 mins
Round difficulty - Medium
It is HR + Technical round
asked about the Behavioural questions and how you justify yourself in an argument .questions related to current technology.
They gave me feedback on how well I had performed so far and gave me suggestions on what more can I do to further improve myself.
Interview Preparation Tips
Tip 1 : Be thorough about your projects
Tip 2 : Prepare Ds and Algo and Practice all standard questions
Tip 3 : Know the complexities of the code that you’ve written.
Tip 1 : Mention at least 2 projects.
Tip 2 : Don't make any silly spelling mistakes on resume
Skills evaluated in this interview
Parul Mishra
Selected
I applied via Approached by Company and was interviewed before Sep 2023. There was 1 interview round.
(1 Question)
- Q1. Project discussion
I appeared for an interview in May 2022.
(2 Questions)
Round duration - 75 Minutes
Round difficulty - Medium
The round consisted of 2 Coding based based questions.
These question were easy for as I have already done this while preparing.
- Q1.
Flip Equivalent Binary Tree Problem
Determine whether two binary trees, given by their roots 'ROOT1' and 'ROOT2', are flip equivalent. A tree can be transformed into a flip equivalent through any number o...
- Ans.
The problem is to determine if two binary trees are flip equivalent after performing flip operations on one of the trees.
Perform a depth-first search (DFS) on both trees simultaneously
At each node, check if the values are equal and the left and right subtrees are either both null or both not null
If the above conditions are met, recursively check the flip equivalence of the left and right subtrees
If any of the condition...
- Q2.
Split Array Into Increasing Subsequences Problem Statement
You are provided with an integer array
ARRof sizeNsorted in ascending order. Your task is to determine if it is possible to split this array i... - Ans.
The task is to determine if an integer array can be split into one or more increasing subsequences with a length of at least 3.
Check if the array can be split into increasing subsequences by iterating through the array.
Keep track of the current subsequence and its length while iterating.
If the difference between the current element and the previous element is not 1, start a new subsequence.
If the length of any subseque...
(1 Question)
Round duration - 60 Minutes
Round difficulty - Easy
The interview started a bit late as I it to be at 11:30 am but started at 12:15pm So Had to wait. Apart from these the overall experience was great and the interviewer was also kind and had a smiling face.
- Q1.
Ninja and Alternating Largest Problem Statement
Ninja is given a sequence of numbers and needs to rearrange them so that every second element is greater than its neighbors on both sides.
Example:
Input:
... - Ans.
The task is to rearrange the given array such that every second element is greater than its left and right element.
Iterate through the array and check if every second element is greater than its left and right element
If not, swap the current element with its adjacent element to satisfy the condition
Continue this process until the entire array satisfies the condition
Return 1 if the array satisfies the condition, else re...
Round duration - 30 Minutes
Round difficulty - Easy
10:30 PM
Interviewer was Cool.
Round duration - 5 minutes
Round difficulty - Easy
At 10:00 am
Interview Preparation Tips
Tip 1 : Never never try to cheat in online interview the interviewer will definitely get to know.
Tip 2 : Psuedo code presentation matters a lot so name Your variable properly and with proper indentation.
Tip 3 : Keep on trying even if You feel that's not the right answer so at least put that idea forward.
Tip 4 : Do Leetcode medium questions as much as possible As they are mostly asked in Interviews.
Tip 1 : Avoid unnecessary details on Resume
Tip 2 : Make It look clean and also keep it of one page
Skills evaluated in this interview
Selected
I appeared for an interview before Jun 2023.
(2 Questions)
- Q1. DSA Round & Introduction Round
- Q2. DP Question related to subsequence
(2 Questions)
- Q1. Design Parking Lot
- Q2. Sort Numbers with large file
Skills evaluated in this interview
(1 Question)
- Q1. Basics on Node.js
Jupiter Money Interview FAQs
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 Engineer Interview Questions
- Java Developer Interview Questions
- Web Developer Interview Questions
- Senior Software Developer Interview Questions
- Application Developer Interview Questions
- Salesforce Developer Interview Questions
- Software Development Engineer Interview Questions
- Developer Interview Questions
- Show more
Overall Interview Experience Rating
based on 2 interview experiences
Difficulty level
Duration
Interview Questions from Similar Companies
Jupiter Money Software Developer Reviews and Ratings
based on 1 review
Rating in categories
|
Customer Support Executive
24
salaries
|  ₹3.8 L/yr - ₹7 L/yr |
|
Software Development Engineer II
19
salaries
| ₹24.5 L/yr - ₹42.6 L/yr |
|
Software Engineer
18
salaries
| ₹24 L/yr - ₹40 L/yr |
|
Customer Service Executive
17
salaries
| ₹5 L/yr - ₹6.5 L/yr |
|
Chief Staff
17
salaries
| ₹80 L/yr - ₹100 L/yr |
Rupeek
Razorpay
ACKO
Revolut
- Home >
- Interviews >
- Jupiter Money Interview Questions
