Does anyone see a better way to do this problem?

constraints are N <= 1000 and -1000 <= node value <= 1000 <a href="https://leetcode.com/problems/maximum-distinct-path-sum-in-a-binary-tree/description/>

constraints are N <= 1000 and -1000 <= node value <= 1000 <a href="https://leetcode.com/problems/maximum-distinct-path-sum-in-a-binary-tree/description/.

Time complexity is O(n^2 * logn * n/W). Got AC in C++ but don't think I can link my submission here. 2/ Run a dfs. At each node, we consider all pairs of two children in its subtree. Each of those children tells us (sumToNode, bitsetToNode). We can aggregate these and update our result. It looks cubic in time but is actually squared. O(n^2 * n/W)