Jupiter Money Software Developer Intern Interview Questions and Answers for Freshers

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

Easy doable questions ( can be completed in 30 mins)

Q1. Basic DSA, OOPS, SQL questions
Add your answer

Q1. Complex and hard DSA problems( Dynamic programming questions) to be written on paper.
Add your answer

Q1. Sort array of cards in color red , blue,green
Ans. 
Sort array of cards in red, blue, green colors.
• Use a custom sorting function to sort the array based on color order.

• Assign a numerical value to each color (e.g. red: 0, blue: 1, green: 2) and sort based on these values.

• Implement a sorting algorithm like bubble sort or quicksort to rearrange the array based on color order.
Answered by AI
View 1 more answer

The aptitude test was medium level.

Q1. Array - Pair Sum - Return pair of the sum from arrays
Ans. 
Find pairs in array that sum up to a given target value.
• Iterate through the array and store each element in a hash set.

• For each element, check if the target value minus the current element exists in the hash set.

• Return the pair of elements that sum up to the target value.
Answered by AI
Add your answer
Q2. Check if two strings are anagram of each other
Ans. 
Check if two strings are anagram of each other
• Create character count arrays for both strings

• Compare the character count arrays to check if they are equal

• Example: 'listen' and 'silent' are anagrams
Answered by AI
Add your answer

Q1. Find Target Element in a rotating sorted Array.
Add your answer

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?