i
Jupiter Money
Filter interviews by
I was interviewed in Dec 2021.
Round duration - 90 Minutes
Round difficulty - Easy
Problem solving using SQL questions
Round duration - 90 Minutes
Round difficulty - Easy
A marketing campaign is run, how will you decide metrics to be tracked. Techincaly a KPI round
Metrics selection based on campaign objectives, target audience, and key performance indicators.
Identify campaign objectives and goals
Consider target audience and their behavior
Select key performance indicators (KPIs) relevant to the campaign
Track metrics such as conversion rate, click-through rate, ROI, customer acquisition cost
Analyze data to measure success and make data-driven decisions
Round duration - 30 Minutes
Round difficulty - Easy
Social empathatic fit round
Tip 1 : SQL logics to be understood completely
Tip 2 : A good running working logic of Python
Tip 3 : Basics of Dashboarding
Tip 1 : One pager , single column resume which shows all your skills
Tip 2 : Mention all things that make you relevant for the job
I was interviewed in Oct 2021.
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.
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, 2),...
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
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 sur...
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'.
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.
I applied via LinkedIn and was interviewed in Oct 2021. There were 3 interview rounds.
Testing Excel knowledge and Operations experience
I was interviewed in Apr 2021.
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.
Given an array 'ARR' of 'N' distinct integers, determine the third largest element in the array.
The first line contains a single integer 'T' representing the numb...
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.
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...
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
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...
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
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
Jupiter Money interview questions for popular designations
I was interviewed in Apr 2021.
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.
Given an array 'ARR' of 'N' distinct integers, determine the third largest element in the array.
The first line contains a single integer 'T' representing the numb...
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.
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...
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
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...
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
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.
Get interview-ready with Top Jupiter Money Interview Questions
I was interviewed in Apr 2021.
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.
Given an array 'ARR' of 'N' distinct integers, determine the third largest element in the array.
The first line contains a single integer 'T' representing the numb...
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.
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...
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
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...
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.
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.
I applied via Approached by Company and was interviewed before Oct 2022. There were 4 interview rounds.
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.
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...
I applied via Referral and was interviewed before Mar 2022. There were 6 interview rounds.
Basic aptitude test to check the right skill set
I was interviewed in Feb 2021.
Round duration - 45 minutes
Round difficulty - Medium
Two DSA questions were asked in this round in 45 min.
Given an array of integers, determine the maximum possible sum of any contiguous subarray within the array.
array = [34, -50, 42, 14, -5, 86]
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.
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...
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.
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.
Top trending discussions
The duration of Jupiter Money interview process can vary, but typically it takes about less than 2 weeks to complete.
based on 20 interviews
Interview experience
based on 87 reviews
Rating in categories
Customer Support Executive
14
salaries
| ₹0 L/yr - ₹0 L/yr |
Customer Service Executive
14
salaries
| ₹0 L/yr - ₹0 L/yr |
Product Manager
12
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Product Manager
9
salaries
| ₹0 L/yr - ₹0 L/yr |
Product Designer
8
salaries
| ₹0 L/yr - ₹0 L/yr |
Paytm
PhonePe
Mobikwik
Payed