Problem Description A React expert A is constantly being troubled by a React newbie B. The expert wants to block certain followers from his network in such a way that B can no longer reach out to him. In this problem, the social network is modeled as a directed graph

Problem Description You are given a forest (it may contain a single tree or more than one tree) with N nodes. Each node has an integer value ranging from 0 to (N-1). You need to determine the depth of the forest at which the maximum number of nodes are present.

Problem Description You are given a forest with N nodes, where each node has an integer value from 0 to N-1. Each node's parent is described by an array, where the value at index i indicates the parent of node i. Your task is to perform a level

Problem Description You are given a forest with N nodes, where each node has an integer value from 0 to N-1. For two given nodes x1 and x2, your task is to find their nearest common ancestor. The forest can consist of one or more trees. The root of each

Problem Description You are given a maze with N cells. Each cell may have multiple entry points but not more than one exit (i.e., entry/exit points are unidirectional doors like valves). You need to find the sum of the largest sum cycle in the maze. * Each cell is

Problem Description You are given a maze with N cells, where each cell may have multiple entry points but no more than one exit (i.e., entry/exit points are unidirectional like valves). The cells are numbered from 0 to N-1. You are tasked with finding the nearest meeting cell

Problem Description You are given a maze with N cells, where each cell may have multiple entry points but no more than one exit. The cells are numbered from 0 to N-1. The task is to find the node with the maximum weight. The weight of a node is defined

Problem Description You are given a world map represented as an M-ary tree. Each node in the tree represents a location with a unique name. There are three types of operations to be performed on this tree: 1. lock(X, uid): Locks the subtree rooted at node X by user

Problem Description JS newbie A wants to learn React from B and wants to figure out who in his network can introduce him to B in the shortest time period. The social network is modeled as a directed graph where: * N is the total number of members in the network.