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

Jupiter Money Front end Engineer Interview Questions and Answers

Updated 1 Jun 2024

Jupiter Money Front end Engineer Interview Experiences

1 interview found

Interview experience
5
Excellent
Difficulty level
-
Process Duration
-
Result
-
Round 1 - Coding Test 

Basic JS, and React questions
1. reduce polyfill
2. pagination in react

Round 2 - Coding Test 

Asked to re-create a UI that was already part of the app

Round 3 - One-on-one 

(2 Questions)

  • Q1. Where do you see yourself in 5 years?
  • Ans. 

    In five years, I envision myself as a lead front-end engineer, driving innovative projects and mentoring junior developers.

    • I aim to lead a team, guiding projects from conception to deployment, like developing a complex web application for a major client.

    • I plan to deepen my expertise in frameworks like React and Vue.js, contributing to open-source projects to enhance my skills.

    • I want to mentor junior developers, sharing...

  • Answered by AI
  • Q2. Discussion on some of my projects

Interview Preparation Tips

Interview preparation tips for other job seekers - Brush up JS basics, and you'll be good :D

Top trending discussions

View All
Interview Tips & Stories
1w (edited)
a team lead
Why are women still asked such personal questions in interview?
I recently went for an interview… and honestly, m still trying to process what just happened. Instead of being asked about my skills, experience, or how I could add value to the company… the questions took a totally unexpected turn. The interviewer started asking things like When are you getting married? Are you engaged? And m sure, if I had said I was married, the next question would’ve been How long have you been married? What does my personal life have to do with the job m applying for? This is where I felt the gender discrimination hit hard. These types of questions are so casually thrown at women during interviews but are they ever asked to men? No one asks male candidates if they’re planning a wedding or how old their kids are. So why is it okay to ask women? Can we please stop normalising this kind of behaviour in interviews? Our careers shouldn’t be judged by our relationship status. Period.
Got a question about Jupiter Money?
Ask anonymously on communities.

Interview questions from similar companies

Interview experience
5
Excellent
Difficulty level
-
Process Duration
-
Result
-
Round 1 - Coding Test 

20 MCQs + 2 Coding Question

Round 2 - One-on-one 

(1 Question)

  • Q1. Trapping Rain Water
Round 3 - Technical 

(1 Question)

  • Q1. Questions on time and space complexity
Round 4 - HR 

(1 Question)

  • Q1. General Discussion

Front end Engineer Interview Questions Asked at Other Companies

asked in Housing.com
Q1. Pair Sum Problem Statement You are given an integer array 'ARR' o ... read more
asked in FactWise
Q2. What is a callback? How is it accompanied with asynchronous progr ... read more
asked in Housing.com
Q3. Can you explain the concepts of deep and shallow copy in JavaScri ... read more
asked in Housing.com
Q4. What is the difference between absolute and fixed positioning in ... read more
asked in Snapdeal
Q5. Write code to determine if an input date is today or tomorrow bas ... read more
Interview experience
3
Average
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
Selected Selected

I applied via LinkedIn and was interviewed in Jun 2024. There were 2 interview rounds.

Round 1 - Assignment 

Data Structures Algorithms

Round 2 - Coding Test 

Data Structures and Algorithm

Interview Preparation Tips

Interview preparation tips for other job seekers - Be prepared for DSA

I appeared for an interview 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

I appeared for an interview in Jan 2022.

Round 1 - Coding Test 

(2 Questions)

Round duration - 120 Minutes
Round difficulty - Medium

The first round was an assessment round comprised of MCQ questions of DSA, RDBMS, MySQL questions and 2 coding questions to be written in java only

  • Q1. 

    Shortest Path in a Binary Matrix Problem Statement

    Given a binary matrix of size N * M where each element is either 0 or 1, find the shortest path from a source cell to a destination cell, consisting only...

  • Ans. 

    Find the shortest path in a binary matrix from a source cell to a destination cell consisting only of 1s.

    • Use Breadth First Search (BFS) to explore all possible paths from the source cell to the destination cell.

    • Keep track of visited cells to avoid revisiting them.

    • Update the path length as you traverse through the matrix.

    • Return the shortest path length found or -1 if no valid path exists.

  • Answered by AI
  • Q2. 

    Kth Smallest Element Problem Statement

    You are provided with an array of integers ARR of size N and an integer K. Your task is to find and return the K-th smallest value present in the array. All elements...

  • Ans. 

    Find the K-th smallest element in an array of distinct integers.

    • Sort the array and return the element at index K-1.

    • Use a min-heap to find the K-th smallest element efficiently.

    • Implement quickselect algorithm for optimal performance.

  • Answered by AI
Round 2 - Telephonic Call 

(1 Question)

Round duration - 60 Minutes
Round difficulty - Medium

The basic data structure round duration 1 hour, in this Interviewer, was very friendly and asked some casual questions. After that, he asked me to code.

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

    • At each index, decide whether to include the current element in the subarray or start a new subarray.

    • Update the maximum sum if a new maximum is found.

    • Example: For array [34, -50, 42, 14, -5, 86], the maximum sum is 137.

    • Example: For array [-5, -1, -8, -9]...

  • Answered by AI
Round 3 - Telephonic Call 

(2 Questions)

Round duration - 60 Minutes
Round difficulty - Hard

Advance data structure round duration 1 hour, in this Interviewer asked some basic questions on oops, puzzles and asked me to code them later.

  • Q1. 

    Reverse Linked List Problem Statement

    Given a singly linked list of integers, return the head of the reversed linked list.

    Example:

    Initial linked list: 1 -> 2 -> 3 -> 4 -> NULL
    Reversed link...
  • Ans. 

    Reverse a singly linked list of integers and return the head of the reversed linked list.

    • Iterate through the linked list and reverse the pointers to point to the previous node instead of the next node.

    • Use three pointers to keep track of the current, previous, and next nodes while reversing the linked list.

    • Update the head of the reversed linked list as the last node encountered during the reversal process.

  • Answered by AI
  • Q2. 

    Trapping Rain Water

    You are provided with an array ARR of integers representing an elevation map, where ARR[i] denotes the elevation of the ith bar. Determine the maximum amount of rainwater that can be t...

  • Ans. 

    Given an array representing an elevation map, find the maximum amount of rainwater that can be trapped between the bars.

    • Iterate through the array and calculate the maximum height on the left and right of each bar.

    • Calculate the trapped water by finding the minimum of the maximum heights on the left and right minus the current bar height.

    • Sum up the trapped water for all bars to get the total trapped rainwater.

    • Example: Fo...

  • Answered by AI
Round 4 - Telephonic Call 

(1 Question)

Round duration - 30 Minutes
Round difficulty - Medium

Vice President interview round duration 30mins, in this round VP’s of different domains taking interview to the selected candidates.

  • Q1. 

    Buy and Sell Stock Problem Statement

    Imagine you are Harshad Mehta's friend, and you have been given the stock prices of a particular company for the next 'N' days. You can perform up to two buy-and-sell ...

  • Ans. 

    The task is to determine the maximum profit that can be achieved by performing up to two buy-and-sell transactions on a given set of stock prices.

    • Iterate through the array of stock prices to find the maximum profit that can be achieved by buying and selling stocks.

    • Keep track of the maximum profit that can be obtained by performing two transactions.

    • Consider all possible combinations of buying and selling stocks to maxim...

  • Answered by AI
Round 5 - HR 

Round duration - 30 Minutes
Round difficulty - Easy

This round lasted for 30mins basic HR questions were asked

Interview Preparation Tips

Professional and academic backgroundI completed Computer Science Engineering from Bharati Vidyapeeth's College of Engineering. Eligibility criteria7.5 CGPAMobiKwik interview preparation:Topics to prepare for the interview - Data Structures, OOPS, System Design, Algorithms, Dynamic Programming, Operating systems, DevelopmentTime required to prepare for the interview - 3 MonthsInterview preparation tips for other job seekers

Tip 1 : Prepare DSA well.
Tip 2 : Always remember and go through your all projects.
Tip 3 : Practice as many DSA questions as you can.

Application resume tips for other job seekers

Tip 1 : Resume should be one page only as being a fresher impacts a lot.
Tip 2 : Resumes should contain all the links for projects and certificates as it impresses the interviewer.

Final outcome of the interviewRejected

Skills evaluated in this interview

I appeared for an interview in May 2022.

Round 1 - Coding Test 

(2 Questions)

Round duration - 75 Minutes
Round difficulty - Medium

The round consisted of 2 Coding based based questions.
These question were easy for as I have already done this while preparing.

  • Q1. 

    Flip Equivalent Binary Tree Problem

    Determine whether two binary trees, given by their roots 'ROOT1' and 'ROOT2', are flip equivalent. A tree can be transformed into a flip equivalent through any number o...

  • Ans. 

    The problem is to determine if two binary trees are flip equivalent after performing flip operations on one of the trees.

    • Perform a depth-first search (DFS) on both trees simultaneously

    • At each node, check if the values are equal and the left and right subtrees are either both null or both not null

    • If the above conditions are met, recursively check the flip equivalence of the left and right subtrees

    • If any of the condition...

  • Answered by AI
  • Q2. 

    Split Array Into Increasing Subsequences Problem Statement

    You are provided with an integer array ARR of size N sorted in ascending order. Your task is to determine if it is possible to split this array i...

  • Ans. 

    The task is to determine if an integer array can be split into one or more increasing subsequences with a length of at least 3.

    • Check if the array can be split into increasing subsequences by iterating through the array.

    • Keep track of the current subsequence and its length while iterating.

    • If the difference between the current element and the previous element is not 1, start a new subsequence.

    • If the length of any subseque...

  • Answered by AI
Round 2 - Video Call 

(1 Question)

Round duration - 60 Minutes
Round difficulty - Easy

The interview started a bit late as I it to be at 11:30 am but started at 12:15pm So Had to wait. Apart from these the overall experience was great and the interviewer was also kind and had a smiling face.

  • Q1. 

    Ninja and Alternating Largest Problem Statement

    Ninja is given a sequence of numbers and needs to rearrange them so that every second element is greater than its neighbors on both sides.

    Example:

    Input:
    ...
  • Ans. 

    The task is to rearrange the given array such that every second element is greater than its left and right element.

    • Iterate through the array and check if every second element is greater than its left and right element

    • If not, swap the current element with its adjacent element to satisfy the condition

    • Continue this process until the entire array satisfies the condition

    • Return 1 if the array satisfies the condition, else re...

  • Answered by AI
Round 3 - Video Call 

Round duration - 30 Minutes
Round difficulty - Easy

10:30 PM 
Interviewer was Cool.

Round 4 - HR 

Round duration - 5 minutes
Round difficulty - Easy

At 10:00 am

Interview Preparation Tips

Eligibility criteriaNo criteria But only 8+ plus CGPA were eventually shortlisted on basis of resumeAcko interview preparation:Topics to prepare for the interview - DSA, DBMS, Puzzles, OS, System DesignTime required to prepare for the interview - 2 MonthsInterview preparation tips for other job seekers

Tip 1 : Never never try to cheat in online interview the interviewer will definitely get to know.
Tip 2 : Psuedo code presentation matters a lot so name Your variable properly and with proper indentation.
Tip 3 : Keep on trying even if You feel that's not the right answer so at least put that idea forward.
Tip 4 : Do Leetcode medium questions as much as possible As they are mostly asked in Interviews.

Application resume tips for other job seekers

Tip 1 : Avoid unnecessary details on Resume
Tip 2 : Make It look clean and also keep it of one page

Final outcome of the interviewSelected

Skills evaluated in this interview

Interview experience
5
Excellent
Difficulty level
Easy
Process Duration
2-4 weeks
Result
Selected Selected

I appeared for an interview before Jun 2023.

Round 1 - One-on-one 

(2 Questions)

  • Q1. DSA Round & Introduction Round
  • Q2. DP Question related to subsequence
Round 2 - Technical 

(2 Questions)

  • Q1. Design Parking Lot
  • Ans. 

    Design a parking lot system with multiple levels and spots for cars.

    • Create a class for ParkingLot with attributes like levels, spots per level, etc.

    • Implement methods for parking a car, removing a car, checking availability, etc.

    • Consider implementing a ticketing system for tracking parked cars.

    • Utilize data structures like arrays, lists, or maps to manage parking spots efficiently.

  • Answered by AI
  • Q2. Sort Numbers with large file
  • Ans. 

    Use external sorting algorithm like merge sort to efficiently sort numbers in a large file.

    • Break the large file into smaller chunks that can fit into memory

    • Sort each chunk individually using a sorting algorithm like merge sort

    • Merge the sorted chunks back together to get the final sorted result

  • Answered by AI

Skills evaluated in this interview

Are these interview questions helpful?
Interview experience
5
Excellent
Difficulty level
-
Process Duration
-
Result
-
Round 1 - One-on-one 

(1 Question)

  • Q1. Basics on Node.js
Interview experience
5
Excellent
Difficulty level
-
Process Duration
-
Result
-
Round 1 - One-on-one 

(2 Questions)

  • Q1. Node.js concepts
  • Q2. Schema design
Interview experience
3
Average
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
-

I applied via Campus Placement and was interviewed in Jan 2024. There were 3 interview rounds.

Round 1 - Coding Test 

Easy doable questions ( can be completed in 30 mins)

Round 2 - Technical 

(1 Question)

  • Q1. Basic DSA, OOPS, SQL questions
Round 3 - One-on-one 

(1 Question)

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

Interview Preparation Tips

Interview preparation tips for other job seekers - Prepare DSA thoroughly

Jupiter Money Interview FAQs

How many rounds are there in Jupiter Money Front end Engineer interview?
Jupiter Money interview process usually has 3 rounds. The most common rounds in the Jupiter Money interview process are Coding Test and One-on-one Round.
How to prepare for Jupiter Money Front end Engineer interview?
Go through your CV in detail and study all the technologies mentioned in your CV. Prepare at least two technologies or languages in depth if you are appearing for a technical interview at Jupiter Money. The most common topics and skills that interviewers at Jupiter Money expect are Android, Coding, Backend, Banking and CMS.

Tell us how to improve this page.

Overall Interview Experience Rating

5/5

based on 1 interview experience

Interview Questions from Similar Companies

Razorpay Interview Questions
3.5
 • 161 Interviews
Revolut Interview Questions
2.6
 • 103 Interviews
Rupeek Interview Questions
3.7
 • 65 Interviews
Freecharge Interview Questions
3.8
 • 58 Interviews
ACKO Interview Questions
3.7
 • 55 Interviews
Mobikwik Interview Questions
3.6
 • 55 Interviews
BharatPe Interview Questions
3.5
 • 43 Interviews
Yubi Interview Questions
3.4
 • 41 Interviews
Slice Interview Questions
3.2
 • 37 Interviews
View all
Customer Support Executive
23 salaries
unlock blur

₹3.8 L/yr - ₹6.5 L/yr

Software Engineer
17 salaries
unlock blur

₹20.1 L/yr - ₹35 L/yr

Customer Service Executive
17 salaries
unlock blur

₹5 L/yr - ₹6.5 L/yr

Software Development Engineer II
16 salaries
unlock blur

₹23.8 L/yr - ₹48 L/yr

Product Manager
12 salaries
unlock blur

₹19.3 L/yr - ₹32.7 L/yr

Explore more salaries
Compare Jupiter Money with

Rupeek

3.7
Compare

Razorpay

3.5
Compare

ACKO

3.7
Compare

Revolut

2.6
Compare
write
Share an Interview