i
Jupiter Money
Filter interviews by
I applied via LinkedIn and was interviewed in Apr 2023. There were 3 interview rounds.
Use Depth First Search (DFS) to find connected components in a graph
Start by initializing all vertices as unvisited
Iterate through each vertex and perform DFS to find connected components
Keep track of visited vertices to avoid revisiting
Example: For a graph with vertices {A, B, C} and edges {(A, B), (B, C)}, the connected components are {A, B, C}
Design a chess game with proper board setup, piece movements, and win conditions.
Create a 8x8 grid to represent the chess board
Assign initial positions to each type of chess piece (pawn, rook, knight, bishop, queen, king)
Implement rules for each piece's movement (e.g. pawn moves forward, rook moves horizontally/vertically)
Check for valid moves and capture opponent's pieces
Implement win conditions (checkmate, stalemate)
...
20 MCQs + 2 Coding Question
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)
I applied via Approached by Company and was interviewed in Sep 2022. There were 2 interview rounds.
Find number of group of 1s in a 2D array of Os and 1s, Second question is to design a data structure which can perform crud operation.
Design a Ride sharing app, lld question, in java
I applied via Campus Placement and was interviewed in Nov 2023. There were 4 interview rounds.
Mcqs based on cs fundamentals and 2_3 coding questions
Merge two sorted linked lists into one.
Create a new linked list to store the merged list.
Compare the values of the nodes from both lists and add the smaller value to the new list.
Move the pointer of the list with the smaller value to the next node.
Repeat the comparison and addition until one of the lists is empty.
Add the remaining nodes from the non-empty list to the new list.
Return the new merged list.
I applied via Job Portal and was interviewed in Dec 2024. There was 1 interview round.
Search for target element in a rotated sorted array.
Use binary search to find the pivot point where rotation happens.
Divide the array into two subarrays and perform binary search on the appropriate subarray.
Handle cases where the target element is on the left or right side of the pivot.
I applied via Campus Placement and was interviewed in Oct 2023. There were 4 interview rounds.
Basic mathematics and analytical thinking questions
Basic programming questions
I appeared for an interview in May 2022.
Round duration - 90 Minutes
Round difficulty - Medium
DS/Algo Questions
2 questions
Kevin is playing a hurdle game where he must jump over hurdles to clear levels. Each level ‘i’ consists of ‘i’ hurdles (e.g., Level 6 has 6 hurdles).
Given the total number ...
The task is to determine the number of levels cleared by Kevin based on the total number of hurdles he has jumped.
Each level 'i' has 'i' hurdles, so Kevin can only reach level 'i' if he has cleared level 'i-1'.
Count the number of levels cleared by dividing the total number of hurdles by the sum of the first 'n' natural numbers.
The formula to calculate the sum of the first 'n' natural numbers is (n * (n + 1)) / 2.
Given a collection of stones, each having a positive integer weight, perform the following operation: On each turn, select the two heaviest stones and smash them toge...
This question is about finding the weight of the last stone after repeatedly smashing the two heaviest stones together.
Sort the array of stone weights in descending order.
Repeatedly smash the two heaviest stones together until there is at most 1 stone left.
If there is 1 stone left, return its weight. Otherwise, return 0.
Round duration - 60 Minutes
Round difficulty - Medium
Live coding
Rearrange a linked list such that all nodes at odd positions are together, followed by all nodes at even positions. You need to return the head of the ...
The task is to rearrange a linked list such that all odd position nodes are together and all even position nodes are together.
Create two separate linked lists, one for odd position nodes and one for even position nodes.
Traverse the original linked list and add the nodes to their respective lists based on their position.
Join the two lists together by pointing the last node of the odd list to the head of the even list.
Re...
Round duration - 60 Minutes
Round difficulty - Easy
Design Zomato - a food delivery platform
Zomato is a platform that connects users with restaurants for food delivery
Users can search for restaurants, view menus, and place orders
Restaurants can register, manage their menus, and receive orders
Delivery partners can sign up to deliver orders
Payment integration is required for seamless transactions
User reviews and ratings can be implemented for restaurant feedback
Location-b...
Round duration - 30 Minutes
Round difficulty - Easy
Cultural
Tip 1 : Prepare for DA/Algo online consistently.
Tip 2 : During interviews, do not hesitate to clarify your doubts, if any. Be in constant communication, explain your thought process.
Tip 3 : Have strong grasp on domain and technologies. Quality over Quantity
Tip 1 : Have super clear idea about the projects you've been part of in case of any cross questions.
Tip 2 : Along with your role do describe how you increased the throughput or reduced cost.
I applied via Approached by Company and was interviewed before Sep 2023. There was 1 interview round.
I appeared for an interview in Mar 2021.
Round duration - 90 minutes
Round difficulty - Medium
Started with projects discussion and internships and moved forward with coding problems.
It started at around 6:00 PM and lasted for 90 minutes approximately
The interviewer was very cool, he even gave me some tips on improving myself further at the end of the interview.
Given a string S
of length N
and an integer K
, find the length of the longest substring that contains at most K
distinct characters.
The first...
Find the length of the longest substring with at most K distinct characters in a given string.
Use a sliding window approach to keep track of the characters and their counts within the window.
Maintain a hashmap to store the characters and their frequencies.
Update the window size and characters count as you iterate through the string.
Return the maximum window size encountered for each test case.
Given an array of integers with numbers in random order, write a program to find and return the number which appears the most frequently in the array.
If multip...
Find the number with the maximum frequency in an array of integers.
Iterate through the array and keep track of the frequency of each number using a hashmap.
Find the number with the maximum frequency and return it.
If multiple elements have the same maximum frequency, return the one that appears first.
Ninja wants to travel from his house to his best friend's house. The locations of the houses are on a 2D coordinate plane, where Ninja's house is located at the origin (0...
Determine if Ninja can reach his friend's house with even x-coordinate without using modulus operator.
Check if the x-coordinate is even or odd by using bitwise AND operation with 1.
Return 1 if x-coordinate is even, else return 0.
Handle multiple test cases by iterating through each input.
Round duration - 60 minutes
Round difficulty - Easy
I was asked a coding question then, a system design question and some basic operating systems and oops questions
Given an array ARR
of size 'N', where each integer is in the range from 0 to N - 1, identify all elements that appear more than once.
Return the duplicate elements in any orde...
Find duplicates in an array of integers within a specified range.
Iterate through the array and keep track of the count of each element using a hashmap.
Return elements with count greater than 1 as duplicates.
Time complexity can be optimized to O(N) using a set to store seen elements.
Designing a Google Search Engine involves creating a web crawler, indexing system, and ranking algorithm.
Develop a web crawler to discover and retrieve web pages.
Implement an indexing system to store and organize the content of web pages.
Design a ranking algorithm to determine the relevance of search results.
Include features like autocomplete, spell check, and personalized search results.
Optimize for speed and scalabil...
Tip 1 : Practice data structures problems
Tip 2 : Read about System Designs
Tip 3 : Study the popular algorithms
Tip 1 : Mention your projects
Tip 2 : Mention your internships
based on 1 interview
Interview experience
based on 2 reviews
Rating in categories
Customer Service Executive
16
salaries
| ₹4.9 L/yr - ₹6.4 L/yr |
Customer Support Executive
14
salaries
| ₹3.8 L/yr - ₹6 L/yr |
Product Manager
12
salaries
| ₹13 L/yr - ₹40 L/yr |
Software Development Engineer II
9
salaries
| ₹16.5 L/yr - ₹44 L/yr |
Senior Product Manager
9
salaries
| ₹38 L/yr - ₹62 L/yr |
Rupeek
Razorpay
ACKO
Revolut