Jupiter Money Software Developer Intern Interview Questions, Process, and Tips for Freshers

Round duration - 90 minutes
Round difficulty - Medium

Timings: it was late night. I started the test at 10 pm

Q1. 
Partial BST Problem Statement
Check if a given binary tree is a Partial Binary Search Tree (BST). A Partial BST adheres to the following properties:
• The left subtree of a node contains only nodes with...read more
Ans. 
Check if a binary tree is a Partial Binary Search Tree (BST) based on specific properties.
• Traverse the tree in level order and check if each node satisfies the properties of a Partial BST.

• Use recursion to check if the left and right subtrees are also Partial BSTs.

• Compare the data of each node with its children to ensure the BST properties are maintained.

• Example: For input 1 2 3 4 -1 5 6 -1 7 -1 -1 -1 -1 -1 -1, the outp
Answered by AI
Add your answer

Round duration - 45 minutes
Round difficulty - Medium

It was the interviw round.
the environment was good.
the interviewer was very nice to me.

Q1. 
Merge Two Sorted Linked Lists Problem Statement
You are provided with two sorted linked lists. Your task is to merge them into a single sorted linked list and return the head of the combined linked list.
...read more
Ans. 
Merge two sorted linked lists into a single sorted linked list.
• Create a new linked list to store the merged result.

• Iterate through both input linked lists simultaneously, comparing and adding nodes to the result list.

• Handle cases where one list is empty or both lists are empty.

• Ensure the final merged list is sorted in ascending order.

• Use constant space complexity and linear time complexity for the solution.
Answered by AI
Add your answer

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.

Q1. 
Shortest Path in an Unweighted Graph
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...read more
Ans. 
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),...read more
Answered by AI
Add your answer

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

Q1. 
Capture Region Problem Statement
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...read more
Ans. 
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'.
Answered by AI
Add your answer

Round duration - 45 minutes
Round difficulty - Medium

Two DSA questions were asked in this round in 45 min.

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.

• 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.
Answered by AI
Add your answer
Q2. 
Odd Occurrence Element Problem Statement
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...read more
Ans. 
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.
Answered by AI
Add your answer