Algorithm Coding

Think in steps, not leaps. Binary Tree Maximum Path Sum Given the root of a non-empty binary tree, return the maximum path sum of any non-empty path. A path in a binary tree

Own today, build tomorrow. Number of Connected Components in an Undirected Graph There is an undirected graph with n nodes. There is also an edges array, where edges[i] = [a, b] means that

Simplicity is the ultimate sophistication. Graph Valid Tree Given n nodes labeled from 0 to n - 1 and a list of undirected edges (each edge is a pair of nodes), write a

Code is communication. Course Schedule You are given an array prerequisites where prerequisites[i] = [a, b] indicates that you must take course b first if you want to take course a. The pair

Write code that makes sense tomorrow, not just today. Pacific Atlantic Water Flow You are given a rectangular island heights where heights[r][c] represents the height above sea level of the cell