Upload Button Icon Add office photos
Engaged Employer

i

This company page is being actively managed by Jupiter Money Team. If you also belong to the team, you can get access from here

Jupiter Money Verified Tick

Compare button icon Compare button icon Compare

Filter interviews by

Clear (1)

Jupiter Money Software Developer Intern Interview Questions, Process, and Tips

Updated 31 May 2022

Top Jupiter Money Software Developer Intern Interview Questions and Answers

  • Q1. Partial BST Problem Statement Check if a given binary tree is a Partial Binary Search Tree (BST). A Partial BST adheres to the following properties: The left subtree of ...read more
  • Q2. Maximum Subarray Sum Problem Statement Given an array of integers, determine the maximum possible sum of any contiguous subarray within the array. Example: Input: array ...read more
  • Q3. Odd Occurrence Element Problem Statement Given an array of integers where each element appears an even number of times except for one element which appears an odd number ...read more
View all 6 questions

Jupiter Money Software Developer Intern Interview Experiences

3 interviews found

I was interviewed in May 2022.

Round 1 - Coding Test 

(1 Question)

Round duration - 90 minutes
Round difficulty - Medium

Timings: it was late night. I started the test at 10 pm

  • Q1. 

    Partial BST Problem Statement

    Check if a given binary tree is a Partial Binary Search Tree (BST). A Partial BST adheres to the following properties:

    • The left subtree of a node contains only nodes with...
  • Ans. 

    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

  • Answered by AI
Round 2 - Video Call 

(1 Question)

Round duration - 45 minutes
Round difficulty - Medium

It was the interviw round.
the environment was good.
the interviewer was very nice to me.

  • Q1. 

    Merge Two Sorted Linked Lists Problem Statement

    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.

    ...
  • Ans. 

    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.

  • Answered by AI

Interview Preparation Tips

Professional and academic backgroundI completed Computer Science Engineering from Chitkara University. I applied for the job as SDE - Intern in BengaluruEligibility criterianoneJupiter Money interview preparation:Topics to prepare for the interview - Data Structures and Algorithms, Spring Boot with java, Operating Systems, Database Management System, Amazon Web ServicesTime required to prepare for the interview - 8 monthsInterview preparation tips for other job seekers

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.

Application resume tips for other job seekers

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.

Final outcome of the interviewSelected

Skills evaluated in this interview

I was interviewed in Oct 2021.

Round 1 - Coding Test 

(1 Question)

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.

  • Q1. 

    Shortest Path in an Unweighted Graph

    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...

  • Ans. 

    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),...

  • Answered by AI
Round 2 - Face to Face 

(1 Question)

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

  • Q1. 

    Capture Region Problem Statement

    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...

  • Ans. 

    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'.

  • Answered by AI

Interview Preparation Tips

Professional and academic backgroundI completed Computer Science Engineering from Madan Mohan Malaviya University Of Technology. I applied for the job as SDE - Intern in BangaloreEligibility criteriaGood PH score on ElitmusJupiter Money interview preparation:Topics to prepare for the interview - Array, Graphs, Dynamic Programming, Operating System, Database Management SystemTime required to prepare for the interview - 3 monthsInterview preparation tips for other job seekers

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.

Application resume tips for other job seekers

Tip 1 : Add quality projects (2 will be sufficient)
Tip 2 : Add your coding profile links.

Final outcome of the interviewSelected

Skills evaluated in this interview

Software Developer Intern Interview Questions Asked at Other Companies

Q1. Sum of Maximum and Minimum Elements Problem Statement Given an ar ... read more
asked in Amazon
Q2. Fish Eater Problem Statement In a river where water flows from le ... read more
asked in Apple
Q3. Kevin and his Fruits Problem Statement Kevin has 'N' buckets, eac ... read more
asked in CommVault
Q4. Sliding Maximum Problem Statement Given an array of integers ARR ... read more
Q5. Reverse Words in a String: Problem Statement You are given a stri ... read more

I was interviewed in Feb 2021.

Round 1 - Video Call 

(2 Questions)

Round duration - 45 minutes
Round difficulty - Medium

Two DSA questions were asked in this round in 45 min.

  • Q1. 

    Maximum Subarray Sum Problem Statement

    Given an array of integers, determine the maximum possible sum of any contiguous subarray within the array.

    Example:

    Input:
    array = [34, -50, 42, 14, -5, 86]
    Out...
  • Ans. 

    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.

  • Answered by AI
  • Q2. 

    Odd Occurrence Element Problem Statement

    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...

  • Ans. 

    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.

  • Answered by AI

Interview Preparation Tips

Eligibility criteriaM.tech and B.tech banches allowedJupiter Money interview preparation:Topics to prepare for the interview - maths, probability, stack, queue, linked list, pointers, algorithmsTime required to prepare for the interview - 3 monthsInterview preparation tips for other job seekers

Tip 1 : Practice dsa from leetcode
Tip 2 : Compete in coding contests
Tip 3 : Do at least 2-3 projects

Application resume tips for other job seekers

Tip 1 : If you have some past experience, add it.
Tip 2 : Also add your projects.

Final outcome of the interviewRejected

Skills evaluated in this interview

Interview questions from similar companies

Interview experience
4
Good
Difficulty level
Moderate
Process Duration
2-4 weeks
Result
Selected Selected

I applied via Campus Placement and was interviewed before Jul 2023. There were 2 interview rounds.

Round 1 - Coding Test 

DSA with 2 question
2 medium and 15 Aptitude and Logical question
1.2 hrs

Round 2 - One-on-one 

(3 Questions)

  • Q1. OOPS Concepts with basic coding
  • Q2. 2 Logical question and the Explanations with some coding
  • Q3. Github Project explanation and Question

I was interviewed in Dec 2017.

Interview Questionnaire 

3 Questions

  • Q1. You need to find the maximum water pond formed in bw the building
  • Ans. 

    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

  • Answered by AI
  • Q2. On mars you have to place n robots and they are connected via GPS. now you need to move each robot such that the whole mars is visited and each robot visit the minimum area(meaning no overlapping of area)...
  • Q3. Design dictionary using trie....having operations of inserting a word, updating and deleting (needed to write full running code)
  • Ans. 

    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 ...

  • Answered by AI

Interview Preparation Tips

Round: Test
Experience: Simple questions
Duration: 1 hour 10 minutes
Total Questions: 3

College Name: IIT Guwahati

Skills evaluated in this interview

Interview Preparation Tips

Round: Test
Experience: There were 3 Questions . One on String manipulation and two were on Binary Trees. All were easy but there was time constraint.
Tips: Practice as many question as possible.
Duration: 60 minutes
Total Questions: 3

Round: Technical Interview
Experience: I was given the problem to design a car pooling system complete with the required classes .. data structures which would be used ... how the database would look like etc..
Tips: General understanding of databases and OOP concepts would do.

Round: Technical Interview
Tips: Be thorough and have in-depth knowledge of each and every point of your resume.

College Name: BITS Pilani

Interview Questionnaire 

21 Questions

  • Q1. Discussion of previous written test questions
  • Q2. Find the odd repeating element from a set of repeating elements
  • Ans. 

    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

  • Answered by AI
  • Q3. A 2D matrix is given which is row wise and column wise sorted. Find a particular element from it
  • Ans. 

    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

  • Answered by AI
  • Q4. SQL Query to find Nth highest salary from table
  • Ans. 

    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

  • Answered by AI
  • Q5. Another basic SQL query
  • Q6. Write a function that returns '3' when '4' is passed as an input and vice versa without using if-else condition
  • Ans. 

    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

  • Answered by AI
  • Q7. Question on Suffix trees
  • Q8. Question on Tries
  • Q9. Question on Ternary search trees
  • Q10. Question on hash maps
  • Q11. Question on complexity of an algorithm
  • Q12. 3-4 SQL queries
  • Q13. Question on SQL joins
  • Q14. JAVA questions on static block,static function and static variables
  • Q15. JAVA questions on memory initialization and references
  • Q16. Puzzle on measuring exactly half a glass of water
  • Q17. Introduce yourself
  • Ans. 

    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

  • Answered by AI
  • Q18. Why PAYTM?
  • Ans. 

    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...

  • Answered by AI
  • Q19. Will you go for further studies?
  • Ans. 

    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.

  • Answered by AI
  • Q20. Why do you think has PAYTM grown so fast?
  • Ans. 

    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

  • Answered by AI
  • Q21. (looking at my CGPA of 9) You can get a better company. Then Why PAYTM only?

Interview Preparation Tips

Round: Test
Experience: there were 20 mcqs and 2 coding questions. It was a pen and paper test. We were given 1 hour to solve it. The mcqs were of average difficulty. The 2 coding questions were:
1. A variation of the standard Josephus Problem
2. Find the 'x' largest elements from 'n' input elements without using sorting.
Tips: They focus on algorithms not on complete solutions. Do not leave any question unattempted. If you do not know the exact approach then use Brute-Force approach.

Round: Technical Interview
Experience: The Interviewer was very nice. He was focussing on the approach used not on codes.
Tips: Be calm and think by basics :)

Round: Technical Interview
Experience: The interviewer asked high level data structures in this round. But again he saw the approach used and not exact solution
Tips: Don't give up. Tell whatever you know

Round: Technical Interview
Experience: JAVA questions were based on very detailed concepts. Study OOP properly.
Tips: Maintain your calm :)

Round: HR Interview
Experience: Overall the experience was nice and smooth.
Tips: If they allow you to ask them any question then ask them something about the company. They should find you interested in the company :)

General Tips: Just be cool. Show them you are enthusiastic to learn and work. While prepration focus on Basics and Algorithms. Prepare DBMS nicely too :)
Skill Tips: Have full knowledge about your projects
Skills: JAVA, Data Structures, Operating systems, Network Programming, DBMS
College Name: NIT Jalandhar
Motivation: PAYTM is a perfect mix for the dynamic startup culture and stability of a big organiztaion. PAYTM has an amazing work culture and excellent opportunities for growth

Skills evaluated in this interview

Interview Preparation Tips

Skills: Algorithm, Java, Data structure
College Name: na

I was interviewed in Mar 2021.

Round 1 - Video Call 

(3 Questions)

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.

  • Q1. 

    Longest Substring with At Most K Distinct Characters

    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.

    Input:

    The first...
  • Ans. 

    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.

  • Answered by AI
  • Q2. 

    Maximum Frequency Number Problem Statement

    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...

  • Ans. 

    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.

  • Answered by AI
  • Q3. 

    Ninja and Bombs Problem Statement

    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...

  • Ans. 

    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.

  • Answered by AI
Round 2 - Video Call 

(2 Questions)

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

  • Q1. 

    Find Duplicates in an Array

    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...

  • Ans. 

    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.

  • Answered by AI
  • Q2. Can you design a Google Search Engine?
  • Ans. 

    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...

  • Answered by AI

Interview Preparation Tips

Eligibility criteriaNo CriteriaMobiKwik interview preparation:Topics to prepare for the interview - Data Structures, Algorithms, OOPS, System Design, Operating SystemsTime required to prepare for the interview - 1 monthInterview preparation tips for other job seekers

Tip 1 : Practice data structures problems
Tip 2 : Read about System Designs
Tip 3 : Study the popular algorithms

Application resume tips for other job seekers

Tip 1 : Mention your projects
Tip 2 : Mention your internships

Final outcome of the interviewSelected

Skills evaluated in this interview

I was interviewed in Mar 2022.

Round 1 - Coding Test 

(1 Question)

Round duration - 90 minutes
Round difficulty - Medium

Only Java allowed

  • Q1. 

    Sort 0 and 1 Problem Statement

    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...

  • Ans. 

    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.

  • Answered by AI
Round 2 - Video Call 

(2 Questions)

Round duration - 60 minutes
Round difficulty - Easy

Basic intro and coding questions

  • Q1. 

    Valid Perfect Square Check

    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.

    ...

  • Ans. 

    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.

  • Answered by AI
  • Q2. 

    Merge Sort Problem Statement

    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.

    Example:

    Input:
    ARR = [5, 3, 8,...
  • Ans. 

    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...

  • Answered by AI
Round 3 - Video Call 

(1 Question)

Round duration - 60 minutes
Round difficulty - Medium

More difficult than the previous round

  • Q1. 

    Bottom View of Binary Tree Problem Statement

    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...

  • Ans. 

    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.

  • Answered by AI
Round 4 - Face to Face 

(2 Questions)

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.

  • Q1. How would you implement multiple RecyclerViews on a magnified screen in an Android application?
  • Ans. 

    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

  • Answered by AI
  • Q2. How would you implement various activities related to cart functionality in an e-commerce application?
  • Ans. 

    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...

  • Answered by AI
Round 5 - HR 

Round duration - 30 minutes
Round difficulty - Easy

HR asked questions about why Mobikwik, what's your goal, how are you a good fit, etc.

Interview Preparation Tips

Eligibility criteriaCGPA - 7 & above, Active backlogs - NoneMobiKwik interview preparation:Topics to prepare for the interview - Basic DSA, Arrays, String, Trees, Problem SolvingTime required to prepare for the interview - 1 monthInterview preparation tips for other job seekers

Tip 1 : Prepare advanced array questions
Tip 2 : Trees basic to medium questions
Tip 3 : Optimize solutions

Application resume tips for other job seekers

Tip 1 : Internship experience
Tip 2 : Personal Projects (remember proper details)

Final outcome of the interviewSelected

Skills evaluated in this interview

Contribute & help others!
anonymous
You can choose to be anonymous

Recently Viewed

INTERVIEWS

Classplus

No Interviews

INTERVIEWS

Jupiter Money

No Interviews

INTERVIEWS

Grantley Edutech

No Interviews

INTERVIEWS

Aspect Ratio

No Interviews

INTERVIEWS

Aspect Ratio

No Interviews

INTERVIEWS

DNEG CREATIVE SERVICES

No Interviews

INTERVIEWS

Grantley Edutech

No Interviews

INTERVIEWS

Airtribe

No Interviews

CAMPUS PLACEMENT

Pune University

INTERVIEWS

Classplus

No Interviews

Tell us how to improve this page.

Fast track your campus placements

View all

Jupiter Money Software Developer Intern Reviews and Ratings

based on 1 review

5.0/5

Rating in categories

4.0

Skill development

4.0

Work-life balance

3.0

Salary

3.0

Job security

3.0

Company culture

3.0

Promotions

4.0

Work satisfaction

Explore 1 Review and Rating
Customer Support Executive
14 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Customer Service Executive
14 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Product Manager
12 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Senior Product Manager
9 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Product Designer
8 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Explore more salaries
Compare Jupiter Money with

Paytm

3.3
Compare

PhonePe

4.0
Compare

Mobikwik

3.7
Compare

Payed

2.7
Compare
Did you find this page helpful?
Yes No
write
Share an Interview