Upload Button Icon Add office photos

Filter interviews by

JUSPAY Front end Developer Interview Questions, Process, and Tips

Updated 12 Nov 2021

JUSPAY Front end Developer Interview Experiences

1 interview found

I was interviewed in Aug 2021.

Round 1 - Coding Test 

(2 Questions)

Round duration - 180 Minutes
Round difficulty - Medium

It had some coding questions related to graph.

  • Q1. Dijkstra's shortest path

    You have been given an undirected graph of ‘V’ vertices (labelled from 0 to V-1) and ‘E’ edges. Each edge connecting two nodes u and v has a weight denoting the distance between th...

  • Ans. 

    The question is about finding the shortest path distance from a source node to all vertices in an undirected graph.

    • The graph is represented by the number of vertices and edges, followed by the edges and their distances.

    • The task is to find the shortest path distance from the source node (0) to all other nodes.

    • If a node is disconnected from the source node, print the maximum positive integer value (2147483647).

    • Implement ...

  • Answered by AI
  • Q2. Check If Path Exists

    You are given a directed and unweighted graph of 'V' vertices and 'E' edges. All edges are given in a 2-dimensional array ‘Edges’ in which ‘Edges[i][0]’ and ‘Edges[i][1...

  • Ans. 

    The task is to check if there exists a path from a given source vertex to a destination vertex in a directed and unweighted graph.

    • Read the number of test cases.

    • For each test case, read the number of vertices and edges.

    • Read the edges of the graph.

    • Read the source and destination vertices.

    • Implement a graph traversal algorithm (e.g., BFS or DFS) to check if a path exists from the source to the destination.

    • Print 'true' if a

  • Answered by AI
Round 2 - Coding Test 

(2 Questions)

Round duration - 180 Minutes
Round difficulty - Hard

The round was really tough only 1 coding question was asked

  • Q1. Encode N-ary tree to binary tree

    You have been given an N-ary tree ‘N’ nodes with node ‘1’ as head of the tree. Encode the above N-ary tree into a binary tree such that if only the encoded binary tree was ...

  • Ans. 

    The task is to encode an N-ary tree into a binary tree and then decode the binary tree back into the original N-ary tree.

    • Encode the N-ary tree by representing each node as a binary tree node with its first child as the left child and subsequent children as the right child.

    • To decode the binary tree, traverse the binary tree and for each node, create a new N-ary tree node with its left child as the first child and subseq...

  • Answered by AI
  • Q2. Technical Questions

    What are the different lifecycle methods in React?

     Explain Strict Mode in React.

    How to prevent re-renders in React?

  • Ans. 

    Lifecycle methods in React, Strict Mode, and preventing re-renders.

    • Lifecycle methods in React include componentDidMount, componentDidUpdate, componentWillUnmount, etc.

    • Strict Mode is a tool for highlighting potential problems in React components.

    • To prevent re-renders in React, use shouldComponentUpdate or React.memo.

  • Answered by AI

Interview Preparation Tips

Professional and academic backgroundI completed Computer Science Engineering from Bharati Vidyapeeth's College of Engineering. Eligibility criteriaPassouts 2020/2021JUSPAY interview preparation:Topics to prepare for the interview - Strings, Arrays, Sorting algorithms, Linked List, Loops, Sliding windows, Graphs, Trees, OOPS, DSA, DBMSTime required to prepare for the interview - 3 monthsInterview preparation tips for other job seekers

Tip 1 : Do atleast 2 projects
Tip 2 : Complete competitive programming
Tip 3 : Practice more interview Questions particular to the company applying to

Application resume tips for other job seekers

Tip 1 : Don't lie on resume
Tip 2 : Try to wrap resume in one page

Final outcome of the interviewRejected

Skills evaluated in this interview

Interview questions from similar companies

Interview experience
4
Good
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
Not Selected

I applied via Naukri.com and was interviewed in Sep 2024. There were 2 interview rounds.

Round 1 - HR 

(2 Questions)

  • Q1. Past experience
  • Q2. How much da u know
Round 2 - Technical 

(2 Questions)

  • Q1. Merge sort in js
  • Ans. 

    Merge sort is a divide and conquer algorithm that divides the input array into two halves, sorts them, and then merges the sorted halves.

    • Divide the array into two halves recursively

    • Sort each half using merge sort recursively

    • Merge the sorted halves back together

  • Answered by AI
  • Q2. Hoising based question

Skills evaluated in this interview

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

I applied via Naukri.com and was interviewed in Feb 2024. There were 2 interview rounds.

Round 1 - Aptitude Test 

Good and nice and it was well organized.

Round 2 - HR 

(1 Question)

  • Q1. What was ur experience?
  • Ans. 

    I have over 5 years of experience in front end development, working on various projects and technologies.

    • Developed responsive websites using HTML, CSS, and JavaScript

    • Worked with frameworks like React and Angular to build interactive user interfaces

    • Optimized website performance and implemented SEO best practices

    • Collaborated with designers and backend developers to deliver high-quality products

  • Answered by AI

Interview Preparation Tips

Interview preparation tips for other job seekers - Nice
Interview experience
4
Good
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
Not Selected

I applied via Naukri.com and was interviewed in Sep 2024. There were 2 interview rounds.

Round 1 - HR 

(2 Questions)

  • Q1. Past experience
  • Q2. How much da u know
Round 2 - Technical 

(2 Questions)

  • Q1. Merge sort in js
  • Ans. 

    Merge sort is a divide and conquer algorithm that divides the input array into two halves, sorts them, and then merges the sorted halves.

    • Divide the array into two halves recursively

    • Sort each half using merge sort recursively

    • Merge the sorted halves back together

  • Answered by AI
  • Q2. Hoising based question

Skills evaluated in this interview

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

I applied via Naukri.com and was interviewed in Feb 2024. There were 2 interview rounds.

Round 1 - Aptitude Test 

Good and nice and it was well organized.

Round 2 - HR 

(1 Question)

  • Q1. What was ur experience?
  • Ans. 

    I have over 5 years of experience in front end development, working on various projects and technologies.

    • Developed responsive websites using HTML, CSS, and JavaScript

    • Worked with frameworks like React and Angular to build interactive user interfaces

    • Optimized website performance and implemented SEO best practices

    • Collaborated with designers and backend developers to deliver high-quality products

  • Answered by AI

Interview Preparation Tips

Interview preparation tips for other job seekers - Nice

Tell us how to improve this page.

Interview Questions from Similar Companies

Paytm Interview Questions
3.3
 • 740 Interviews
PhonePe Interview Questions
4.0
 • 289 Interviews
Razorpay Interview Questions
3.6
 • 145 Interviews
Freecharge Interview Questions
4.0
 • 49 Interviews
MagicPin Interview Questions
3.1
 • 48 Interviews
Mobikwik Interview Questions
4.0
 • 44 Interviews
Stylebaazar Interview Questions
4.0
 • 28 Interviews
Tokopedia Interview Questions
4.1
 • 27 Interviews
Meritto Interview Questions
3.7
 • 21 Interviews
View all
Software Engineer
26 salaries
unlock blur

₹5 L/yr - ₹12 L/yr

Softwaretest Engineer
20 salaries
unlock blur

₹2 L/yr - ₹5 L/yr

Software Development Engineer
19 salaries
unlock blur

₹18 L/yr - ₹30 L/yr

Product Engineer
15 salaries
unlock blur

₹16 L/yr - ₹22 L/yr

Senior Software Engineer
14 salaries
unlock blur

₹3 L/yr - ₹4 L/yr

Explore more salaries
Compare JUSPAY with

Razorpay

3.6
Compare

Paytm

3.3
Compare

PhonePe

4.0
Compare

Payed

2.8
Compare

Calculate your in-hand salary

Confused about how your in-hand salary is calculated? Enter your annual salary (CTC) and get your in-hand salary
Did you find this page helpful?
Yes No
write
Share an Interview