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

Q1. DSA Round & Introduction Round
Add your answer
Q2. DP Question related to subsequence
Add your answer

Q1. Design Parking Lot
Ans. 
Design a parking lot system with multiple levels and spots for cars.
• Create a class for ParkingLot with attributes like levels, spots per level, etc.

• Implement methods for parking a car, removing a car, checking availability, etc.

• Consider implementing a ticketing system for tracking parked cars.

• Utilize data structures like arrays, lists, or maps to manage parking spots efficiently.
Answered by AI
Add your answer
Q2. Sort Numbers with large file
Ans. 
Use external sorting algorithm like merge sort to efficiently sort numbers in a large file.
• Break the large file into smaller chunks that can fit into memory

• Sort each chunk individually using a sorting algorithm like merge sort

• Merge the sorted chunks back together to get the final sorted result
Answered by AI
Add your answer

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

Mcqs based on cs fundamentals and 2_3 coding questions

Q1. 2-3 DSA questions to be written on paper in the interview itself
Add your answer
Q2. Merge 2 sorted Linked list into 1
Ans. 
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.
Answered by AI
Add your answer

Q1. A full cv analysis interview round discussion on all the projects and team work experience
Add your answer

Round duration - 60 Minutes
Round difficulty - Medium

This round was scheduled with the SDE-2, we started with the introduction than he jumped to the dsa questions. First question he asked me was leetcode 3 sum problem, we discussed the approach than I wrote the code for that problem. Second question was of arrays and maps I didn't remember the exact question but that was also some modified version of k sum subarray. Than he asked many questions related to oops, I answered most of them than he asked me for any qiuestions and we dropped the call.

Q1. 
Triplets with Given Sum Problem
Given an array or list ARR consisting of N integers, your task is to identify all distinct triplets within the array that sum up to a specified number K.
Explanation:
A t...read more
Ans. 
The task is to find all distinct triplets in an array that sum up to a specified number.
• Iterate through all possible triplets using three nested loops.

• Check if the sum of the triplet equals the target sum.

• Print the triplet if found, else print -1.
Answered by AI
Add your answer
Q2. 
K Sum Subset Problem Statement
You are provided with an array arr of size N and an integer K. Your objective is to compute the maximum sum of a subset of the array such that this sum does not exceed K.
E...read more
Ans. 
Find the maximum sum of a subset of an array that does not exceed a given value K.
• Sort the array in descending order to maximize the sum.

• Iterate through the array and add elements to the sum until it exceeds K.

• Return the sum obtained before exceeding K.
Answered by AI
Add your answer

Round duration - 40 Minutes
Round difficulty - Medium

This round was arranged with the Engineering Manager, we started with the introduction then he asked me to explain my project, I did that. After that he asked me one pattern question, I coded that than he asked me one more array question of finding mean, mode, median, I partially solved that question. Than he asked me for any questions and we dropped the call.

Q1. 
Diamond Pattern Grid Problem
Create a grid pattern of size R rows and C columns, where each cell contains a diamond-like shape of size S. The diamond shape is made with characters ‘/’ and ‘\’ for the bord...read more
Ans. 
Create a grid pattern with diamond shapes of given size in each cell.
• Iterate through each cell in the grid and construct the diamond shape based on the size provided.

• Use 'e' for the outer space, '/' and '' for the borders, 'o' for the inner space of the diamond.

• Adjust the positioning of characters based on the size of the diamond to create the desired pattern.
Answered by AI
Add your answer
Q2. 
Mean, Median, and Mode Problem Statement
Given an integer array ARR of size N, you need to compute the following three statistical measures:
1. Mean: Implement the function mean() to calculate the mean o...read more
Ans. 
Implement functions to calculate mean, median, and mode of an integer array.
• Calculate mean by summing all elements and dividing by total count

• Calculate median by sorting array and finding middle element(s)

• Calculate mode by finding element with highest frequency, return smallest if multiple
Answered by AI
Add your answer

Q1. Project discussion
Add your answer