Juspay Interview Questions — 11 DSA Problems

11 problems with full solutions in Python, Java, C++, JavaScript, Go, Rust.

Most frequently asked Juspay LeetCode questions for software engineering interviews.

• Longest Cycle in a Graph (HARD) — Depth-First Search, Breadth-First Search, Graph, Topological Sort
• Operations on Tree (MEDIUM) — Array, Hash Table, Tree, Depth-First Search, Breadth-First Search, Design
• Find Closest Node to Given Two Nodes (MEDIUM) — Depth-First Search, Graph
• Node With Highest Edge Score (MEDIUM) — Hash Table, Graph
• Longest Subsequence With Decreasing Adjacent Difference (MEDIUM) — Array, Dynamic Programming
• Set Matrix Zeroes (MEDIUM) — Array, Hash Table, Matrix
• Longest Substring Without Repeating Characters (MEDIUM) — Hash Table, String, Sliding Window
• Largest Color Value in a Directed Graph (HARD) — Hash Table, Dynamic Programming, Graph, Topological Sort, Memoization, Counting
• Shortest Path in a Weighted Tree (HARD) — Array, Tree, Depth-First Search, Binary Indexed Tree, Segment Tree
• Sliding Window Maximum (HARD) — Array, Queue, Sliding Window, Heap (Priority Queue), Monotonic Queue
• Word Ladder (HARD) — Hash Table, String, Breadth-First Search