i
Jupiter Money
Filter interviews by
I applied via Job Portal and was interviewed in Jan 2024. There were 2 interview rounds.
Top trending discussions
posted on 7 Aug 2023
I applied via Recruitment Consulltant and was interviewed before Aug 2022. There were 4 interview rounds.
English grammar test and paragraph writing.
I appeared for an interview before Sep 2020.
Round duration - 90 mins
Round difficulty - Hard
There were questions related to DP and DFS.
You are given a long type array/list ARR
of size N
, representing an elevation map. The value ARR[i]
denotes the elevation of the ith
bar. Your task is to determine th...
Calculate the total amount of rainwater that can be trapped between given elevations in an array.
Iterate through the array and calculate the maximum height on the left and right of each bar.
Calculate the amount of water that can be trapped at each bar by taking the minimum of the maximum heights on the left and right.
Sum up the trapped water at each bar to get the total trapped water for the entire array.
Round duration - 60 mins
Round difficulty - Medium
At first, I was asked about the different projects that I have done so far. We had a detailed discussion on the same.
He also checked my OOP concepts
Designing an LRU Cache involves implementing a data structure that stores a fixed number of items and removes the least recently used item when full.
Start by defining the data structure for the cache, typically using a combination of a hashmap and a doubly linked list.
Implement methods for getting and setting key-value pairs in the cache.
When a new item is added to the cache, check if it exceeds the maximum capacity. I...
Given a Singly Linked List of integers, your task is to reverse the Linked List by altering the links between the nodes.
The first line of input is an intege...
Reverse a singly linked list by altering the links between nodes.
Iterate through the linked list and reverse the links between nodes
Use three pointers to keep track of the current, previous, and next nodes
Update the links between nodes to reverse the list
Return the head of the reversed linked list
You are given the head node of a singly linked list. Your task is to return a pointer pointing to the middle of the linked list.
If there is an odd number of elements, return the ...
Return the middle element of a singly linked list, or the one farther from the head if there are even elements.
Traverse the linked list with two pointers, one moving twice as fast as the other
When the fast pointer reaches the end, the slow pointer will be at the middle
If there are even elements, return the one that is farther from the head node
Handle edge cases like linked list of size 1 or empty list
Round duration - 60 mins
Round difficulty - Medium
It is HR + Technical round
asked about the Behavioural questions and how you justify yourself in an argument .questions related to current technology.
They gave me feedback on how well I had performed so far and gave me suggestions on what more can I do to further improve myself.
Tip 1 : Be thorough about your projects
Tip 2 : Prepare Ds and Algo and Practice all standard questions
Tip 3 : Know the complexities of the code that you’ve written.
Tip 1 : Mention at least 2 projects.
Tip 2 : Don't make any silly spelling mistakes on resume
Medium Leetcode, Array, String, Tree, DP
I applied via LinkedIn and was interviewed before Oct 2023. There were 2 interview rounds.
SQL - technical round
Case Study round - 2
I appeared for an interview before Feb 2024.
Mostly medium leetcode
Mostly medium level DSA
I applied via Campus Placement and was interviewed in Jan 2024. There were 3 interview rounds.
Easy doable questions ( can be completed in 30 mins)
20 MCQs + 2 Coding Question
I applied via Approached by Company and was interviewed in Sep 2022. There were 2 interview rounds.
Find number of group of 1s in a 2D array of Os and 1s, Second question is to design a data structure which can perform crud operation.
Design a Ride sharing app, lld question, in java
I applied via Campus Placement and was interviewed in Nov 2023. There were 4 interview rounds.
Mcqs based on cs fundamentals and 2_3 coding questions
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.
based on 1 interview
Interview experience
Customer Support Executive
14
salaries
| ₹3.8 L/yr - ₹6 L/yr |
Customer Service Executive
14
salaries
| ₹5 L/yr - ₹6.4 L/yr |
Product Manager
12
salaries
| ₹13 L/yr - ₹40 L/yr |
Software Development Engineer II
9
salaries
| ₹16.5 L/yr - ₹44 L/yr |
Senior Product Manager
9
salaries
| ₹38 L/yr - ₹62 L/yr |
Rupeek
Razorpay
ACKO
Revolut