Juspay LeetCode interview questions

Explore Juspay questions from the all problems list. Search by title or topic, filter by difficulty, and track solved problems on this device.

Time range

Problems in range

Solved

0 / 19

Range progress

Problem list

Select a problem to open it on LeetCode.

Problem	Difficulty	Frequency	Acceptance
Operations on Tree Array Hash Table Tree +3 MEDIUM	Medium	100.0%	0.5%
Find Closest Node to Given Two Nodes Depth-First Search Graph Theory MEDIUM	Medium	84.4%	0.5%
Longest Subsequence With Decreasing Adjacent Difference Array Dynamic Programming MEDIUM	Medium	81.0%	0.2%
Longest Cycle in a Graph Depth-First Search Breadth-First Search Graph Theory +3 HARD	Hard	76.9%	0.5%
Node With Highest Edge Score Hash Table Graph Theory MEDIUM	Medium	74.6%	0.5%
Toggle Light Bulbs Array Hash Table Sorting +1 EASY	Easy	74.6%	0.7%
Sliding Window Maximum Array Queue Sliding Window +3 HARD	Hard	68.7%	0.5%
Minimum Number of Operations to Make Array Continuous Array Hash Table Binary Search +1 HARD	Hard	68.7%	0.5%
Largest Color Value in a Directed Graph Hash Table String Dynamic Programming +5 HARD	Hard	60.5%	0.6%
Minimum Cost Homecoming of a Robot in a Grid Array Greedy MEDIUM	Medium	60.5%	0.5%
Shortest Path in a Weighted Tree Array Tree Depth-First Search +2 HARD	Hard	54.7%	0.4%
Set Matrix Zeroes Array Hash Table Matrix MEDIUM	Medium	46.5%	0.6%
Maximum Score From Removing Substrings String Stack Greedy MEDIUM	Medium	46.5%	0.7%
Gas Station Array Greedy MEDIUM	Medium	46.5%	0.5%
Asteroid Collision Array Stack Simulation MEDIUM	Medium	46.5%	0.5%
Merge Intervals Array Sorting Quicksort MEDIUM	Medium	46.5%	0.5%
Maximum Product Subarray Array Dynamic Programming MEDIUM	Medium	46.5%	0.4%
Container With Most Water Array Two Pointers Greedy MEDIUM	Medium	46.5%	0.6%
Number of Islands Array Depth-First Search Breadth-First Search +2 MEDIUM	Medium	46.5%	0.7%

Showing 1–19 of 19 matching problems · All Problems

Juspay LeetCode Interview Questions | Grind Practice