Jupiter Money Software Developer Intern Interview Questions and Answers

Round duration - 50 minutes
Round difficulty - Easy

Q1. 
Move Zeros to Left Problem Statement
Your task is to rearrange a given array ARR such that all zero elements appear at the beginning, followed by non-zero elements, while maintaining the relative order of...read more
Ans. 
Rearrange an array such that all zero elements appear at the beginning, followed by non-zero elements, maintaining relative order of non-zero elements.
• Iterate through the array and move all zero elements to the left side of the array while maintaining the relative order of non-zero elements.

• Use two pointers approach to swap elements efficiently.

• Ensure to solve the problem in linear time and constant space complexity.

• Ex...read more
Answered by AI
Add your answer
Q2. 
Rat in a Maze Problem Statement
Given a maze of size N * N with a rat placed at the top-left corner, find and print all possible paths that the rat can take to reach the bottom-right corner. The rat can m...read more
Ans. 
Find and print all possible paths for a rat to reach the bottom-right corner of a maze.
• Create a recursive function to explore all possible paths in the maze.

• Keep track of the current path and mark visited cells.

• Return the paths as matrices with 1 for cells in the path and 0 for others.
Answered by AI
Add your answer

Round duration - 60 minutes
Round difficulty - Medium

First 10 minutes started with the Introduction. Then he asked about my projects. He seemed interested in my projects and asked a lot of questions about them.

Q1. 
Matrix Chain Multiplication Problem Statement
You are provided with a chain of matrices A1, A2, A3, ..., An. The goal is to determine the minimum number of scalar multiplications needed to multiply these ...read more
Ans. 
The goal is to determine the minimum number of scalar multiplications needed to multiply a chain of matrices together.
• Understand the matrix chain multiplication problem statement and how the dimensions of matrices are defined by the input array.

• Implement a dynamic programming approach to find the minimum cost of matrix multiplication.

• Consider the constraints provided and optimize the solution accordingly.

• Test the solut...read more
Answered by AI
Add your answer
Q2. How would you design an application like Instagram?
Ans. 
Designing an application like Instagram involves creating a platform for sharing photos and videos with social networking features.
• Implement user profiles with the ability to upload, like, comment, and share photos/videos

• Develop a news feed algorithm to display content based on user preferences and interactions

• Include features like filters, hashtags, geotagging, and direct messaging

• Integrate push notifications for like...read more
Answered by AI
Add your answer

Round duration - 20 minutes
Round difficulty - Easy

Round duration - 90 minutes
Round difficulty - Easy

The online round had 2 coding questions and one question of a regular expression.

Q1. 
Find All Pairs Adding Up to Target
Given an array of integers ARR of length N and an integer Target, your task is to return all pairs of elements such that they add up to the Target.
Input:
The first line ...read more
Ans. 
Find all pairs of elements in an array that add up to a given target.
• Iterate through the array and for each element, check if the complement (target - current element) exists in a hash set.

• If the complement exists, add the pair to the result. If not, add the current element to the hash set.

• Handle cases where the same element is used twice in a pair (e.g., target = 6, array = [3, 3]).
Answered by AI
Add your answer
Q2. 
Increasing Subsegment Problem Statement
Given a sequence ARR consisting of N integers, your task is to identify the longest subsegment of ARR, where you can change at most one number to make the subsegmen...read more
Ans. 
Find the longest subsegment where at most one number can be changed to make it strictly increasing.
• Iterate through the array and keep track of the longest increasing subsegment with at most one change.

• If a number violates the increasing order, try changing it and check if the subsegment becomes strictly increasing.

• Update the length of the longest subsegment found so far.

• Return the length of the longest subsegment for e...read more
Answered by AI
Add your answer

Round duration - 60 minutes
Round difficulty - Easy

First 10 minutes started with the Introduction. Then he asked about my projects. He seemed interested in my projects and asked a lot of questions about them. He asked questions related to Node Js, React Js, Mongo DB, AWS as all these were mentioned in my Resume. Around 25 minutes was completed explaining each and everything.

Then he started with the coding questions. I was allowed to share my screen and use any of my favourite text editors. I chose ‘VS Code’.

I was able to solve 2 coding questions very easily. I got stuck in the puzzle as I didn’t solve any puzzles before. I was able to come up with different approaches, but they weren’t the most optimal. He tried giving me a lot of hints but still wasn’t able to solve it. I had a positive can-do attitude throughout, and I was really close to solving it.

Feedback: He told me I performed well and asked if I had any questions for him. I asked for the solution to the puzzle. He explained to me the solution and I told him that I will practice puzzles.

Around 5-6 students got selected for 2nd Interview.

Q1. 
Move Zeros To Left
You are provided an array ARR of integers. Your task is to rearrange this array such that all elements with zero values are moved to the left, and all non-zero elements follow them, pre...read more
Ans. 
Rearrange array with zeros on the left and non-zeros on the right while maintaining original order.
• Iterate through the array from right to left, moving non-zero elements to the end of the array.

• Track the index where non-zero elements should be placed.

• Fill the beginning of the array with zeros and the rest with non-zero elements in their original order.
Answered by AI
Add your answer
Q2. 
Maximum Sum of Disjoint Pairs with Specific Difference
Given an array of integers and a number K, your task is to form pairs of elements from the array such that the absolute difference between them is st...read more
Ans. 
Find maximum sum of disjoint pairs with specific difference in an array.
• Sort the array in non-decreasing order.

• Iterate through the array and form pairs with absolute difference less than K.

• Keep track of the sum of disjoint pairs to maximize it.

• Return the maximum sum obtained.
Answered by AI
Add your answer

Round duration - 35 minutes
Round difficulty - Medium

It started with a brief Introduction and in-depth discussions on projects. He also asked me a lot of questions about my previous internship. He asked me some behavioural questions as well.

I was able to solve the question, and he did not ask me any other questions. This round was really short for me and was finished in around 35 minutes, well before time. I asked about my feedback, and he told me that the ‘HR’ will get back to me. I thought he was not satisfied with my answers and I will be rejected though I gave very good answers to every question.

3 students got selected for the next round. I think he was satisfied and did not want to waste more time asking questions.

Q1. 
Polynomial Simplification Problem Statement
You are provided with two arrays representing the coefficients and degrees of a polynomial expression. Your task is to simplify this polynomial into its general...read more
Ans. 
Simplify a polynomial expression by combining like terms and arranging them in descending order of degrees.
• Iterate through the coefficients and degrees arrays to combine like terms

• Create a new array to store the simplified polynomial in descending order of degrees

• Return the simplified polynomial array
Answered by AI
Add your answer

Round duration - 60 minutes
Round difficulty - Medium

It started with an introduction and discussion on projects. He seemed very curious about my project and went ahead to cross-question every functionality. We discussed everything and how the code works. He asked me a lot of questions on ‘Socket’ as my project mentioned it.

HR-related questions such as:
Why do you want to join the company?
Where do you see yourself in the next 5 years?
What are your strengths and weakness?

20 MCQs + 2 Coding Question

Q1. Trapping Rain Water
Add your answer

Q1. Questions on time and space complexity
Add your answer

Q1. General Discussion
Add your answer

Data Structures Algorithms

Data Structures and Algorithm

Round duration - 90 minutes
Round difficulty - Medium

Only Java allowed

Q1. 
Sort 0 and 1 Problem Statement
Given an integer array ARR of size N containing only integers 0 and 1, implement a function to sort this array. The solution should scan the array only once without using an...read more
Ans. 
Sort an array of 0s and 1s in linear time without using additional arrays.
• Iterate through the array and maintain two pointers, one for 0s and one for 1s.

• Swap elements at the two pointers based on the current element being 0 or 1.

• Continue this process until the entire array is sorted in place.
Answered by AI
View 1 more answer

Round duration - 60 minutes
Round difficulty - Easy

Basic intro and coding questions

Q1. 
Valid Perfect Square Check
An integer N is provided, and the task is to determine if N is a perfect square. A perfect square refers to an integer which can be expressed as the square of another integer.
...read more
Ans. 
Implement a function to check if a given integer is a perfect square.
• Create a function that takes an integer as input and returns true if it is a perfect square, false otherwise.

• Iterate through possible square roots of the input integer and check if the square of the root equals the input.

• Return true if a perfect square is found, false otherwise.
Answered by AI
Add your answer
Q2. 
Merge Sort Problem Statement
Given a sequence of numbers 'ARR', your task is to return a sorted sequence of 'ARR' in non-descending order using the Merge Sort algorithm.
Example:
Input:
ARR = [5, 3, 8,...read more
Ans. 
Implement Merge Sort algorithm to sort a given sequence of numbers in non-descending order.
• Merge Sort is a divide-and-conquer algorithm that splits the array into two halves, recursively sorts each half, and then merges the sorted halves back together.

• Time complexity of Merge Sort is O(n log n) in the worst case scenario.

• It is a stable sorting algorithm, meaning that the relative order of equal elements is preserved.

• Ex...read more
Answered by AI
Add your answer

Round duration - 60 minutes
Round difficulty - Medium

More difficult than the previous round

Q1. 
Bottom View of Binary Tree Problem Statement
Given a binary tree, the task is to print its bottom view from left to right. Assume the left and the right child nodes make a 45-degree angle with their paren...read more
Ans. 
The task is to print the bottom view of a binary tree from left to right.
• Traverse the binary tree in level order and keep track of the horizontal distance of each node from the root.

• Store the nodes at each horizontal distance in a map, updating it as you traverse the tree.

• After traversal, extract the bottom-most nodes at each horizontal distance to get the bottom view sequence.
Answered by AI
Add your answer

Round duration - 70 minutes
Round difficulty - Medium

There were no DSA questions. My interviews were based on android app development. The interviewer presented scenarios and asked how will you solve them. No particular correct answer was expected just the best approach as per me.

Q1. How would you implement multiple RecyclerViews on a magnified screen in an Android application?
Ans. 
Implement multiple RecyclerViews on a magnified screen in an Android app by adjusting item sizes and spacing.
• Adjust item sizes and spacing based on screen magnification level

• Use nested RecyclerViews or custom layouts to display multiple lists

• Implement custom item decorators to manage spacing between RecyclerViews

• Consider using a GridLayoutManager with custom span sizes for each RecyclerView
Answered by AI
Add your answer
Q2. How would you implement various activities related to cart functionality in an e-commerce application?
Ans. 
Implementing cart functionality in an e-commerce application involves managing user interactions, updating quantities, handling discounts, and processing orders.
• Create a data structure to store cart items, quantities, and prices.

• Implement add to cart, remove from cart, and update quantity functionalities.

• Handle discounts, promotions, and coupon codes.

• Calculate total price, including taxes and shipping costs.

• Implement c...read more
Answered by AI
Add your answer

Round duration - 30 minutes
Round difficulty - Easy

HR asked questions about why Mobikwik, what's your goal, how are you a good fit, etc.

Round duration - 120 Minutes
Round difficulty - Medium

The first round was an assessment round comprised of MCQ questions of DSA, RDBMS, MySQL questions and 2 coding questions to be written in java only

Q1. 
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...read more
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) to explore all possible paths from the source cell to the destination cell.

• Keep track of visited cells to avoid revisiting them.

• Update the path length as you traverse through the matrix.

• Return the shortest path length found or -1 if no valid path exists.
Answered by AI
Add your answer
Q2. 
Kth Smallest Element Problem Statement
You are provided with an array of integers ARR of size N and an integer K. Your task is to find and return the K-th smallest value present in the array. All elements...read more
Ans. 
Find the K-th smallest element in an array of distinct integers.
• Sort the array and return the element at index K-1.

• Use a min-heap to find the K-th smallest element efficiently.

• Implement quickselect algorithm for optimal performance.
Answered by AI
Add your answer

Round duration - 60 Minutes
Round difficulty - Medium

The basic data structure round duration 1 hour, in this Interviewer, was very friendly and asked some casual questions. After that, he asked me to code.

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
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.

• At each index, decide whether to include the current element in the subarray or start a new subarray.

• Update the maximum sum if a new maximum is found.

• Example: For array [34, -50, 42, 14, -5, 86], the maximum sum is 137.

• Example: For array [-5, -1, -8, -9]...read more
Answered by AI
Add your answer

Round duration - 60 Minutes
Round difficulty - Hard

Advance data structure round duration 1 hour, in this Interviewer asked some basic questions on oops, puzzles and asked me to code them later.

Q1. 
Reverse Linked List Problem Statement
Given a singly linked list of integers, return the head of the reversed linked list.
Example:
Initial linked list: 1 -> 2 -> 3 -> 4 -> NULL
Reversed link...read more
Ans. 
Reverse a singly linked list of integers and return the head of the reversed linked list.
• Iterate through the linked list and reverse the pointers to point to the previous node instead of the next node.

• Use three pointers to keep track of the current, previous, and next nodes while reversing the linked list.

• Update the head of the reversed linked list as the last node encountered during the reversal process.
Answered by AI
Add your answer
Q2. 
Trapping Rain Water
You are provided with an array ARR of integers representing an elevation map, where ARR[i] denotes the elevation of the ith bar. Determine the maximum amount of rainwater that can be t...read more
Ans. 
Given an array representing an elevation map, find the maximum amount of rainwater that can be trapped between the bars.
• Iterate through the array and calculate the maximum height on the left and right of each bar.

• Calculate the trapped water by finding the minimum of the maximum heights on the left and right minus the current bar height.

• Sum up the trapped water for all bars to get the total trapped rainwater.

• Example: Fo...read more
Answered by AI
Add your answer

Round duration - 30 Minutes
Round difficulty - Medium

Vice President interview round duration 30mins, in this round VP’s of different domains taking interview to the selected candidates.

Q1. 
Buy and Sell Stock Problem Statement
Imagine you are Harshad Mehta's friend, and you have been given the stock prices of a particular company for the next 'N' days. You can perform up to two buy-and-sell ...read more
Ans. 
The task is to determine the maximum profit that can be achieved by performing up to two buy-and-sell transactions on a given set of stock prices.
• Iterate through the array of stock prices to find the maximum profit that can be achieved by buying and selling stocks.

• Keep track of the maximum profit that can be obtained by performing two transactions.

• Consider all possible combinations of buying and selling stocks to maxim...read more
Answered by AI
Add your answer

Round duration - 30 Minutes
Round difficulty - Easy

This round lasted for 30mins basic HR questions were asked