Machine learning engineer Jupiter Money interview experience

Interview rounds

Round

Medium

Online Coding Interview

Duration90 minutes

Interview date22 Aug 2021

Coding problem2

The round held on 9. a.m . It was focused on DSA and some objective questions

1. Gas Stations

Moderate

10m average time

90% success

0/80

Asked in companies

You have been given a circular path. There are 'N' petrol pumps on this path that are numbered from 0 to N - 1 (Both inclusive). Each petrol pump has two values associated with it:

1)The amount of petrol that is available at this particular petrol pump.
2)The distance to reach the next petrol pump.

You are on a truck having an empty tank of infinite capacity. You can start the tour from any of the petrol pumps. Your task is to calculate the first petrol pump from where the truck will be able to complete the full circle or determine if it is impossible to do so.

You may assume that the truck will stop at every petrol pump and it will add the petrol from that pump to its tank. The truck will move one kilometre for each litre of petrol consumed.

Problem approach

Step 1) store the value of the capacity in some variable whenever the capacity becomes less than zero.
Step 2) You have to traverse the array only once
Step 3) If capacity < 0 then
start = i + 1;
deficit += capacity;
capacity = 0;
Step 4) return (capacity + deficit >= 0) ? start : -1;

Try solving now

2. Find Number Of Islands

Moderate

34m average time

60% success

0/80

Asked in companies

You are given a 2-dimensional array/list having N rows and M columns, which is filled with ones(1) and zeroes(0). 1 signifies land, and 0 signifies water.

A cell is said to be connected to another cell, if one cell lies immediately next to the other cell, in any of the eight directions (two vertical, two horizontal, and four diagonals).

A group of connected cells having value 1 is called an island. Your task is to find the number of such islands present in the matrix.

Problem approach

1) Initialize all vertex to be unvisited
2) loop through every unvisited vertex and perform dfs to visit nearby vertex and mark as visited
3) In every dfs step increase counter by 1
4) return counter

Try solving now

Round

Easy

Face to Face

Duration60 Minutes

Interview date23 Aug 2021

Coding problem2

Easy DSA questions were asked . Practice frequently solved questions on leetcode and gfg

1. Add Two Numbers As Linked Lists

Moderate

20m average time

80% success

0/80

Asked in companies

You are given two non-negative numbers 'num1' and 'num2' represented in the form of linked lists.

The digits in the linked lists are stored in reverse order, i.e. starting from least significant digit (LSD) to the most significant digit (MSD), and each of their nodes contains a single digit.

Calculate the sum of the two numbers and return the head of the sum list.

Example :

Input:
'num1' : 1 -> 2 -> 3 -> NULL
'num2' : 4 -> 5 -> 6 -> NULL

Output: 5 -> 7 -> 9 -> NULL

Explanation: 'num1' represents the number 321 and 'num2' represents 654. Their sum is 975.

Problem approach

1 Create 3 stacks namely s1,s2,s3.
2 Fill s1 with Nodes of list1 and fill s2 with nodes of list2.
3 Fill s3 by creating new nodes and setting the data of new nodes to the sum of s1.top(), s2.top() and carry until list1 and list2 are empty .
4 If the sum >9
5 set carry 1
else
set carry 0
6 Create a Node(say prev) that will contain the head of the sum List.
7 Link all the elements of s3 from top to bottom
8 return prev

Try solving now

2. Puzzle

Torch and bridge puzzle

Problem approach

Tip 1 : Listen to the question carefully and check for different corner cases
Tip 2 : Ask doubts if any problem statement must be clear
Tip 3 : Practice these type of questions from GFG and coding Ninjas

Round

Easy

Video Call

Duration30 Minutes

Interview date23 Aug 2021

Coding problem1

Simple project discussion round. They took one project of mine and asked several question so good information about the project is required

1. System Design Question

Describe your project

Problem approach

Tip 1 : Good project on resume is a must
Tip 2 : Good information about the project is required
Tip 3 : Don't lie about your project

Round

Easy

HR Round

Duration10 Minutes

Interview date24 Aug 2021

Coding problem1

Basic HR questions regarding how was your interview experience. Some questions about the company etc. Overall very easy round just be honest with HR

1. Basic HR Questions

How was your day?
what did you do in 4 years at college?
What are your strength?
What are your weakness?
failures you have encountered in your college life and how you overcome it?

Problem approach

Tip 1 : Be honest in the interview
Tip 2 : Answer all the questions
Tip 3 : Read general HR questions from GFG

Machine learning engineer

Interview preparation journey

Interview rounds

1. Gas Stations

You have been given a circular path. There are 'N' petrol pumps on this path that are numbered from 0 to N - 1 (Both inclusive). Each petrol pump has two values associated with it:

You are on a truck having an empty tank of infinite capacity. You can start the tour from any of the petrol pumps. Your task is to calculate the first petrol pump from where the truck will be able to complete the full circle or determine if it is impossible to do so.

You may assume that the truck will stop at every petrol pump and it will add the petrol from that pump to its tank. The truck will move one kilometre for each litre of petrol consumed.

2. Find Number Of Islands

You are given a 2-dimensional array/list having N rows and M columns, which is filled with ones(1) and zeroes(0). 1 signifies land, and 0 signifies water.

A cell is said to be connected to another cell, if one cell lies immediately next to the other cell, in any of the eight directions (two vertical, two horizontal, and four diagonals).

A group of connected cells having value 1 is called an island. Your task is to find the number of such islands present in the matrix.

1. Add Two Numbers As Linked Lists

You are given two non-negative numbers 'num1' and 'num2' represented in the form of linked lists.

The digits in the linked lists are stored in reverse order, i.e. starting from least significant digit (LSD) to the most significant digit (MSD), and each of their nodes contains a single digit.

Calculate the sum of the two numbers and return the head of the sum list.

Example :

2. Puzzle

1. System Design Question

1. Basic HR Questions