Path Sum II at Arista Networks
Medium61.7% acceptance
This problem has 62.5% frequency at Arista Networks.
Problem Description
Given the `root` of a binary tree and an integer `targetSum`, return _all**root-to-leaf** paths where the sum of the node values in the path equals _`targetSum` _. Each path should be returned as a list of the node**values** , not node references_. A **root-to-leaf** path is a path starting from th...
Read full problem and hintsTopics
Also asked at 10 companies
More Arista Networks Questions
Restore IP AddressesMediumCourse Schedule IIMediumMaximum Depth of Binary TreeEasyBinary Tree Maximum Path SumHardKth Largest Element in a StreamEasy
View all Arista Networks questions