i
Jupiter Money
Filter interviews by
Clear (1)
I was interviewed in May 2022.
Round duration - 90 minutes
Round difficulty - Medium
Timings: it was late night. I started the test at 10 pm
Check if a given binary tree is a Partial Binary Search Tree (BST). A Partial BST adheres to the following properties:
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
Round duration - 45 minutes
Round difficulty - Medium
It was the interviw round.
the environment was good.
the interviewer was very nice to me.
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.
...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.
Tip 1 : Please have a strong hold on data structures mainly linked lists, arrays, maths, stacks, trees
Tip 2 : Must explore about DBMS. Means SQL, writing efficient queries, about indexing and other SQL backend process.
Tip 3 : Should work on spring boot. try build some project using spring boot with java (Gradle) as Jupiter's backend tech is mainly based on spring boot with java.
Tip 1 : Mention only those skills on which you have worked on properly. no need to flood the resume with skills about which you need a little.
Tip 2 : Must mention the links of projects which you have worked on.
I was interviewed in Oct 2021.
Round duration - 120 minutes
Round difficulty - Medium
The online test was for 2 hrs in which 5 coding questions were asked. 3 questions were pretty easy and 2 were of medium difficulty level. I was able to solve all 5 questions.
The city of Ninjaland is represented as an unweighted graph with houses and roads. There are 'N' houses numbered 1 to 'N', connected by 'M' bidirectional roads. A road...
Implement a function to find the shortest path in an unweighted graph from a given start house to a destination house.
Use Breadth First Search (BFS) algorithm to find the shortest path in an unweighted graph.
Maintain a queue to explore neighboring houses and keep track of visited houses to avoid revisiting them.
Return the path once the destination house is reached.
Example: For input N=8, M=9, S=1, T=8 and roads (1, 2),...
Round duration - 60 minutes
Round difficulty - Medium
It started with the introduction and then we had a discussion on the projects I had made. He asked for several Backend and Database concepts like locking in DB, sessions, etc as I had mentioned backend internship in my resume. It took around half an hour.
Then he gave me a coding question based on the graph
You are given a matrix having N
rows and M
columns. Each cell of the matrix contains either 'X' or 'O'. Your task is to flip all the regions of 'O' that are completely sur...
Given a matrix with 'X' and 'O', flip all 'O' regions completely surrounded by 'X' to 'X'.
Iterate through the matrix and identify 'O' regions completely surrounded by 'X'.
Use DFS/BFS to mark all 'O's in the surrounded region.
Update the matrix by flipping all marked 'O's to 'X'.
Tip 1 : Practice 250+ standard quality questions.
Tip 2 : Do some good real-life projects in Front-end or Backend Development
Tip 3 : Try to find an internship that will not only enhance your development skills but also increase your resume selection chances.
Tip 1 : Add quality projects (2 will be sufficient)
Tip 2 : Add your coding profile links.
I was interviewed in Feb 2021.
Round duration - 45 minutes
Round difficulty - Medium
Two DSA questions were asked in this round in 45 min.
Given an array of integers, determine the maximum possible sum of any contiguous subarray within the array.
array = [34, -50, 42, 14, -5, 86]
Find the maximum sum of any contiguous subarray within an array of integers.
Iterate through the array and keep track of the maximum sum of subarrays encountered so far.
Use Kadane's algorithm to efficiently find the maximum subarray sum.
Handle cases where all elements are negative by returning the maximum element in the array.
Example: For array [34, -50, 42, 14, -5, 86], the maximum subarray sum is 137.
Given an array of integers where each element appears an even number of times except for one element which appears an odd number of times, find the element that ap...
Find the element that appears an odd number of times in an array of integers.
Iterate through the array and use XOR operation to find the element that appears odd number of times.
Keep a count of occurrences of each element using a hashmap.
Return the element that has an odd count of occurrences.
Tip 1 : Practice dsa from leetcode
Tip 2 : Compete in coding contests
Tip 3 : Do at least 2-3 projects
Tip 1 : If you have some past experience, add it.
Tip 2 : Also add your projects.
Top trending discussions
I applied via Campus Placement and was interviewed before Jul 2023. There were 2 interview rounds.
DSA with 2 question
2 medium and 15 Aptitude and Logical question
1.2 hrs
I was interviewed in Dec 2017.
To find the maximum water pond formed between buildings.
Identify the lowest point between the buildings.
Calculate the area of the pond using the distance between the buildings and the depth of the pond.
Consider any obstacles or uneven ground that may affect the pond's shape.
Use a surveying tool or satellite imagery to get accurate measurements.
Take into account any drainage systems or natural water flow that may affect
Design a dictionary using trie with insert, update and delete operations.
Implement a Trie data structure with nodes containing a character and a boolean flag to indicate end of word
For insert operation, traverse the trie and add nodes for each character in the word
For update operation, delete the existing word and insert the updated word
For delete operation, mark the end of word flag as false and delete the node if it ...
Find the odd repeating element from an array of strings
Use a hash table to count the frequency of each element
Iterate through the hash table to find the element with an odd count
Finding an element in a sorted 2D matrix
Start from the top right corner or bottom left corner
Compare the target element with the current element
Move left or down if the target is smaller, else move right or up
Repeat until the target is found or all elements are checked
SQL query to find Nth highest salary from table
Use ORDER BY and LIMIT clauses
Use subquery to get the Nth highest salary
Handle cases where there are less than N distinct salaries
Function to swap '3' and '4' without using if-else
Use XOR operator to swap the values
Convert the input to ASCII code and perform the swap
Use a lookup table to map the values
I am a software developer with experience in Java and Python.
Proficient in Java and Python programming languages
Experience in developing web applications using Spring framework
Familiarity with database management systems like MySQL and MongoDB
PAYTM is a leading digital payment platform in India with a wide range of services.
PAYTM has a user-friendly interface and offers a seamless payment experience.
It provides a variety of services like mobile recharges, bill payments, and online shopping.
PAYTM has a strong focus on security and fraud prevention measures.
It has a large user base and is widely accepted by merchants across India.
PAYTM is constantly innovatin...
Yes, I am open to pursuing further studies in the future.
I believe in continuous learning and staying updated with the latest technologies.
Further studies can help me specialize in a particular field and enhance my skills.
I may consider pursuing a master's degree in computer science or a related field.
However, my immediate focus is on gaining practical experience and contributing to the organization.
PAYTM grew fast due to its innovative approach and early adoption of digital payments.
Early adoption of digital payments in India
Innovative approach with features like mobile recharges, bill payments, and cashback offers
Expansion into e-commerce and financial services
Strategic partnerships with major companies like Uber and Alibaba
I was interviewed in Mar 2021.
Round duration - 90 minutes
Round difficulty - Medium
Started with projects discussion and internships and moved forward with coding problems.
It started at around 6:00 PM and lasted for 90 minutes approximately
The interviewer was very cool, he even gave me some tips on improving myself further at the end of the interview.
Given a string S
of length N
and an integer K
, find the length of the longest substring that contains at most K
distinct characters.
The first...
Find the length of the longest substring with at most K distinct characters in a given string.
Use a sliding window approach to keep track of the characters and their counts within the window.
Maintain a hashmap to store the characters and their frequencies.
Update the window size and characters count as you iterate through the string.
Return the maximum window size encountered for each test case.
Given an array of integers with numbers in random order, write a program to find and return the number which appears the most frequently in the array.
If multip...
Find the number with the maximum frequency in an array of integers.
Iterate through the array and keep track of the frequency of each number using a hashmap.
Find the number with the maximum frequency and return it.
If multiple elements have the same maximum frequency, return the one that appears first.
Ninja wants to travel from his house to his best friend's house. The locations of the houses are on a 2D coordinate plane, where Ninja's house is located at the origin (0...
Determine if Ninja can reach his friend's house with even x-coordinate without using modulus operator.
Check if the x-coordinate is even or odd by using bitwise AND operation with 1.
Return 1 if x-coordinate is even, else return 0.
Handle multiple test cases by iterating through each input.
Round duration - 60 minutes
Round difficulty - Easy
I was asked a coding question then, a system design question and some basic operating systems and oops questions
Given an array ARR
of size 'N', where each integer is in the range from 0 to N - 1, identify all elements that appear more than once.
Return the duplicate elements in any orde...
Find duplicates in an array of integers within a specified range.
Iterate through the array and keep track of the count of each element using a hashmap.
Return elements with count greater than 1 as duplicates.
Time complexity can be optimized to O(N) using a set to store seen elements.
Designing a Google Search Engine involves creating a web crawler, indexing system, and ranking algorithm.
Develop a web crawler to discover and retrieve web pages.
Implement an indexing system to store and organize the content of web pages.
Design a ranking algorithm to determine the relevance of search results.
Include features like autocomplete, spell check, and personalized search results.
Optimize for speed and scalabil...
Tip 1 : Practice data structures problems
Tip 2 : Read about System Designs
Tip 3 : Study the popular algorithms
Tip 1 : Mention your projects
Tip 2 : Mention your internships
I was interviewed in Mar 2022.
Round duration - 90 minutes
Round difficulty - Medium
Only Java allowed
Given an integer array ARR
of size N
containing only integers 0 and 1, implement a function to sort this array. The solution should scan the array only once without using an...
Sort an array of 0s and 1s in linear time without using additional arrays.
Iterate through the array and maintain two pointers, one for 0s and one for 1s.
Swap elements at the two pointers based on the current element being 0 or 1.
Continue this process until the entire array is sorted in place.
Round duration - 60 minutes
Round difficulty - Easy
Basic intro and coding questions
An integer N
is provided, and the task is to determine if N
is a perfect square. A perfect square refers to an integer which can be expressed as the square of another integer.
Implement a function to check if a given integer is a perfect square.
Create a function that takes an integer as input and returns true if it is a perfect square, false otherwise.
Iterate through possible square roots of the input integer and check if the square of the root equals the input.
Return true if a perfect square is found, false otherwise.
Given a sequence of numbers 'ARR', your task is to return a sorted sequence of 'ARR' in non-descending order using the Merge Sort algorithm.
ARR = [5, 3, 8,...
Implement Merge Sort algorithm to sort a given sequence of numbers in non-descending order.
Merge Sort is a divide-and-conquer algorithm that splits the array into two halves, recursively sorts each half, and then merges the sorted halves back together.
Time complexity of Merge Sort is O(n log n) in the worst case scenario.
It is a stable sorting algorithm, meaning that the relative order of equal elements is preserved.
Ex...
Round duration - 60 minutes
Round difficulty - Medium
More difficult than the previous round
Given a binary tree, the task is to print its bottom view from left to right. Assume the left and the right child nodes make a 45-degree angle with their paren...
The task is to print the bottom view of a binary tree from left to right.
Traverse the binary tree in level order and keep track of the horizontal distance of each node from the root.
Store the nodes at each horizontal distance in a map, updating it as you traverse the tree.
After traversal, extract the bottom-most nodes at each horizontal distance to get the bottom view sequence.
Round duration - 70 minutes
Round difficulty - Medium
There were no DSA questions. My interviews were based on android app development. The interviewer presented scenarios and asked how will you solve them. No particular correct answer was expected just the best approach as per me.
Implement multiple RecyclerViews on a magnified screen in an Android app by adjusting item sizes and spacing.
Adjust item sizes and spacing based on screen magnification level
Use nested RecyclerViews or custom layouts to display multiple lists
Implement custom item decorators to manage spacing between RecyclerViews
Consider using a GridLayoutManager with custom span sizes for each RecyclerView
Implementing cart functionality in an e-commerce application involves managing user interactions, updating quantities, handling discounts, and processing orders.
Create a data structure to store cart items, quantities, and prices.
Implement add to cart, remove from cart, and update quantity functionalities.
Handle discounts, promotions, and coupon codes.
Calculate total price, including taxes and shipping costs.
Implement c...
Round duration - 30 minutes
Round difficulty - Easy
HR asked questions about why Mobikwik, what's your goal, how are you a good fit, etc.
Tip 1 : Prepare advanced array questions
Tip 2 : Trees basic to medium questions
Tip 3 : Optimize solutions
Tip 1 : Internship experience
Tip 2 : Personal Projects (remember proper details)
based on 1 review
Rating in categories
Customer Support Executive
14
salaries
| ₹0 L/yr - ₹0 L/yr |
Customer Service Executive
14
salaries
| ₹0 L/yr - ₹0 L/yr |
Product Manager
12
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Product Manager
9
salaries
| ₹0 L/yr - ₹0 L/yr |
Product Designer
8
salaries
| ₹0 L/yr - ₹0 L/yr |
Paytm
PhonePe
Mobikwik
Payed