Home Problem Set Companies Projects Live Scene Contribute

Loading Question...

Locking the tree of space - Juspay Hiring Challenge Coding Assesment Round - Juspay Hiring Challenge Interview Question | Codinzhub

CodinzHub

Home Problem Set Companies Projects Live Scene Contribute

Locking the tree of space - Juspay Hiring Challenge Coding Assesment Round

You have a world map represented as an M-Ary tree. You need to define three operations on it: lock(X, uid), unlock(X, uid), and upgradeLock(X, uid), where X is the name of a node in the tree and uid is the user who is performing the operation.

Example 1:

Input:[7,2,5,"World","Asia","Africa","China","India","SouthAfrica","Egypt","1 China 9","2 India 9","3 Asia 9","2 India 9","2 Asia 9"]

Output:["true","true","true","false","true"]

Constraints:

1 < N < 5 * 10^5
1 < m < 30
1 < Q < 5 * 10^5
1 < length of NodeName < 20

solution.cpp

Run code to see test results

00:00 / 69:42

Locking the tree of space - Juspay Hiring Challenge Coding Assesment Round

HardMed•341 views

Example 1:

Input:

[7,2,5,"World","Asia","Africa","China","India","SouthAfrica","Egypt","1 China 9","2 India 9","3 Asia 9","2 India 9","2 Asia 9"]

Output:["true","true","true","false","true"]

Constraints:

1 < N < 5 * 10^5
1 < m < 30
1 < Q < 5 * 10^5
1 < length of NodeName < 20

HardMed•341 views

Time Complexity

Space Complexity

Asked at

Juspay Hiring Challenge

Author: Amit Dayal

Software Engineer

Expert in Data Structures & Algorithms. Building tools to help developers crack FAANG interviews.

Reviewed by Senior Engineers

GitHub LinkedIn

Up Next

Data Frame - Flipkart Grid 8.0

Flipkart Grid 8.0 • Pending

Megastore Partitioning - Flipkart Grid 8.0

Flipkart Grid 8.0 • Pending

Marathon Checkpoints - Flipkart Grid 8.0

Flipkart Grid 8.0 • Pending

SQL - Flipkart Grid 8.0

Flipkart Grid 8.0 • Pending

Last updated Jul 2026

Data Frame

Flipkart Grid 8.0 • Pending