Leetcode Problem 2368. Reachable Nodes With Restrictions

2368. Reachable Nodes With Restrictions

Leetcode Solutions

Create a boolean array seen to keep track of visited nodes, initializing all entries to false.
Mark all restricted nodes as visited in the seen array.
Initialize a queue and enqueue the starting node 0, marking it as visited.
Set ans to 0, which will keep count of the reachable nodes.
While the queue is not empty: a. Dequeue the front node curr_node from the queue. b. Increment ans by 1. c. For each neighbor of curr_node, if it is not visited, mark it as visited and enqueue it.
After the queue is empty, return ans as the result.

Programming Language

Purpose:

General Question

Debug My Code

image/screenshot of info(optional)

Full Screen