Available question text
The source lists this question by title. A full statement is not available in this collection.
Check the source for more detail. You can use the workspace to record questions, notes, and an approach.
This entry contains problem metadata. Read the source for the complete statement.
Related questions
Continue with questions that share topics or the same question type.
- Maximum Subgraph Score in a Tree
Coding · Array · Depth-First Search · Dynamic Programming
- Count Pairs of Connectable Servers in a Weighted Tree Network
Coding · Array · Depth-First Search · Tree
- Binary Tree Cameras
Coding · Binary Tree · Depth-First Search · DP on Trees
- Binary Tree Maximum Path Sum
Coding · Binary Tree · Depth-First Search · DP on Trees
Sources · 2 references
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
LeetCode · 1 record
No company association
Official problem listing
Count Non Adjacent Subsets in a Rooted Tree
Source snapshot: Nov 13, 2026
Verified official problem metadata. This is not evidence of a recent interview ask.
View source
LeetCode company tags · 1 record
Infosys
Archived company tags
Count Non Adjacent Subsets in a Rooted Tree
Source window: all_time
Source snapshot: Oct 20, 2026
Historical tags, not proof of a recent interview ask. Snapshot: 2026-10-20.
View source