Jupiter Money interview experience Real time questions & tips from candidates to crack your interview

SDE - 1

Jupiter Money
upvote
share-icon
3 rounds | 3 Coding problems

Interview preparation journey

expand-icon
Preparation
Duration: 3 months
Topics: Data Structures, Operating Systems, OOPS, DBMS, CNS.
Tip
Tip

Tip 1 : Start Early
Tip 2 : Solve the 250 DSA sheet
 

Application process
Where: Campus
Eligibility: 7 C.G.P.A
Resume Tip
Resume tip

Tip 1 : Short and 1 page
Tip 2 : Should Not contain Phone number of image or any wrong information

Interview rounds

01
Round
Easy
Online Coding Interview
Duration30 minutes
Interview date11 Aug 2021
Coding problem1

It was early in the morning around 9 A.M 
There were 3 questions
The round was very similar to other companies coding round

1. Minimum Number of Platforms

Moderate
30m average time
70% success
0/80
Asked in companies
MeeshoGrabAmazon

You have been given two arrays, 'AT' and 'DT', representing the arrival and departure times of all trains that reach a railway station.

Your task is to find the minimum number of platforms required for the railway station so that no train needs to wait.

Note :
1. Every train will depart on the same day and the departure time will always be greater than the arrival time. For example, A train with arrival time 2240 and departure time 1930 is not possible.

2. Time will be given in 24H format and colons will be omitted for convenience. For example, 9:05AM will be given as "905", or 9:10PM will be given as "2110".

3. Also, there will be no leading zeroes in the given times. For example, 12:10AM will be given as “10” and not as “0010”.
Problem approach

1. Sort the arrival and departure times of trains.
2. Create two pointers i=0, and j=0, and a variable to store ans and current count plat
3. Run a loop while i 4. If the arrival time is less than or equal to departure then one more platform is needed so increase the count, i.e., plat++ and increment i
5. Else if the arrival time is greater than departure then one less platform is needed to decrease the count, i.e., plat– and increment j
6. Update the ans, i.e. ans = max(ans, plat).

Try solving now
02
Round
Easy
Video Call
Duration30 minutes
Interview date12 Aug 2021
Coding problem1

It was in the afternoon around 2 P.M The interviewer was very friendly and was interested in my projects

1. Technical Question

Explain your project in detail.

Problem approach

Tip 1 : Give the relevance of your project why you made it and why is it useful
Tip 2 : Always give the live demo
Tip 3 : Do read about the project once in depth before giving the demo

03
Round
Easy
HR Round
Duration10 minutes
Interview date12 Aug 2021
Coding problem1

Normal HR questions . The interview happened in the evening around 6 P.M .

1. Basic HR Questions

Tell me about Yourself.
Where do you see yourself in 5 years?
What does Jupiter do?
Your major achievement and failure in college.


 

Problem approach

Tip 1 : Give answers with confidence
Tip 2 : Give answers with honesty
Tip 3 : Prepare for similar HR questions before as they are very same in every interview

Here's your problem of the day

Solving this problem will increase your chance to get selected in this company

Skill covered: Programming

How do you remove whitespace from the start of a string?

Choose another skill to practice
Similar interview experiences
company logo
SDE - 1
1 rounds | 3 problems
Interviewed by Jupiter Money
1904 views
0 comments
0 upvotes
company logo
SDE - 1
1 rounds | 3 problems
Interviewed by Jupiter Money
1270 views
1 comments
0 upvotes
company logo
SDE - 1
2 rounds | 2 problems
Interviewed by Jupiter Money
1687 views
1 comments
0 upvotes
company logo
SDE - 1
3 rounds | 3 problems
Interviewed by Jupiter Money
1384 views
0 comments
0 upvotes
Companies with similar interview experiences
company logo
SDE - 1
5 rounds | 12 problems
Interviewed by Amazon
115097 views
24 comments
0 upvotes
company logo
SDE - 1
4 rounds | 5 problems
Interviewed by Microsoft
58238 views
5 comments
0 upvotes
company logo
SDE - 1
3 rounds | 7 problems
Interviewed by Amazon
35147 views
7 comments
0 upvotes