There was one online test, and following it, there was a hackathon on trees and graphs. I was not able to clear it. If you are preparing for Juspay, be well-versed with DSA.

Q: Given an n-ary tree of resources arranged hierarchically such that the height of the tree is O(Log N) where N is the total number of nodes (or resources). A process needs to lock a resource node in order to use it. But a node cannot be locked if any of its descendant or ancestor is locked. 1 answer