Jupiter Money Customer Service Executive Interview Questions and Answers

Mobikwik zip code contact with payment refund related contact now, XXXXX

Call ? XXXXX all issue with

Q1. Customer care contact now
Add your answer
Q2. All issue solve now call me
Add your answer
Q3. XXXXX all issue with my friends
Add your answer
Q4. Or email and credit card and the rest
Add your answer
Q5. Good day call me sir
Add your answer
Q6. Customer service support
Add your answer
Q7. Mobikwik refund related
Add your answer
Q8. Zop balance Atibete and any
Add your answer

Round duration - 90 mins
Round difficulty - Hard

There were questions related to DP and DFS.

 

Q1. 
Trapping Rain Water Problem Statement
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...read more
Ans. 
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.
Answered by AI
Add your answer

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

Q1. Can you describe the process of designing an LRU Cache from scratch during your System Design Round?
Ans. 
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...read more
Answered by AI
Add your answer
Q2. 
Reverse Linked List Problem Statement
Given a Singly Linked List of integers, your task is to reverse the Linked List by altering the links between the nodes.
Input:
The first line of input is an intege...read more
Ans. 
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
Answered by AI
Add your answer
Q3. 
Middle of a 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 ...read more
Ans. 
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
Answered by AI
Add your answer

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.

Easy doable questions ( can be completed in 30 mins)

Q1. Basic DSA, OOPS, SQL questions
Add your answer

Q1. Complex and hard DSA problems( Dynamic programming questions) to be written on paper.
Add your answer

20 MCQs + 2 Coding Question

Q1. Trapping Rain Water
Add your answer

Q1. Questions on time and space complexity
Add your answer

Q1. General Discussion
Add your answer

Medium Leetcode, Array, String, Tree, DP

Q1. System Design, Design Payment Platform
Add your answer

Mostly medium leetcode

Mostly medium level DSA

Q1. AWS, GCP , Kubernetes, Docker
Add your answer

Q1. Security standards, cloud security
Add your answer

SQL - technical round

Case Study round - 2