Jupiter Money Interview Questions, Process, and Tips

Q1. Intermeditae sql questions
Add your answer
Q2. SQL proficiency was expected
Add your answer

Q1. SQL proficiency expected
Add your answer
Q2. SQL proficiency expected
Add your answer

Q1. My first round clear
Add your answer
Q2. Tell me about your self
Ans. 
I am a dedicated and experienced Customer Service Executive with a strong focus on providing exceptional customer support.
• Over 5 years of experience in customer service roles

• Proficient in handling customer inquiries, complaints, and providing solutions

• Excellent communication and interpersonal skills

• Ability to remain calm and composed in challenging situations

• Proven track record of achieving customer satisfaction target...read more
Answered by AI
Add your answer

Q1. My second round clear nice team
Add your answer

Q1. Third round will hr they just ask you background
Add your answer

Q1. I just gave 3 round they will inform
Add your answer

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 - 50 mins
Round difficulty - Medium

First round was coding round, where i was asked 2 DS algo questions, 1 was easy and other was of medium difficulty

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) algorithm to find the shortest path.

• Keep track of visited cells to avoid revisiting them.

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

• Return -1 if no valid path exists.
Answered by AI
Add your answer

Round duration - 50 mins
Round difficulty - Easy

I was asked to design url shortner

Q1. Can you explain how you would design a URL shortener?
Ans. 
Design a URL shortener system
• Generate a unique short code for each URL

• Store the mapping of short code to original URL in a database

• Redirect users from short URL to original URL when accessed

• Consider implementing features like custom short codes, expiration dates, and analytics

• Ensure scalability and performance by using distributed systems and caching
Answered by AI
Add your answer

Round duration - 50 mins
Round difficulty - Medium

This was hiring manager round

Q1. Can you discuss a coding problem you encountered, your past projects, and any behavioral questions related to your experiences?
Ans. 
Discussed coding problem, past projects, and behavioral questions in SDE - 1 interview.
• Coding problem: Discussed how I optimized a sorting algorithm in a previous project.

• Past projects: Talked about a web application I developed using React and Node.js.

• Behavioral questions: Shared how I handled a conflict within a team during a project.

• Example: Explained how I implemented a feature in a mobile app that improved user en
Answered by AI
Add your answer

Q1. How you can bring business to the company
Add your answer
Q2. Why you want to join our company
Add your answer

Q1. What is your salary expectations
Add your answer

Q1. Basic SQL questions are asked in this round Some theory questions are asked as well
Add your answer