solulubeta
Sign in
NeetCode 150 / Trees
07.14 · Problem

Binary Tree Maximum Path Sum

Hard DFS returns best downward path, records best turning path 1 video LC 124 Pro

This problem is part of solulu Pro

A path is a sequence of nodes where each adjacent pair is connected by an edge, and no node appears twice. It doesn't have to pass through the root and must contain at least one node. Return the maximum sum of values…

Lifetime ₹1,999 ₹999 · Launch offer
Mark this problem as solved when you are finished.

Item 59 of 150 · updated 2026-10-12