JUSPAY Front end Developer Interview Questions, Process, and Tips for Experienced

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 ...read more
  View Answers (3)
• 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 ‘...read more
  View Answers (3)

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 s...read more
  View Answers (2)
• Q2. Technical Questions

  What are the different lifecycle methods in React?

   Explain Strict Mode in React.

  How to prevent re-renders in React?

  View Answers (1)