Posts published in “Hard”

Problem:

Given n points on a 2D plane, find the maximum number of points that lie on the same straight line.

Idea:

count by slope

Time complexity: O(n^2)

Space complexity: O(n)

Solution:

C++ / long

Problem:

Given a binary tree, find the maximum path sum.

For this problem, a path is defined as any sequence of nodes from some starting node to any node in the tree along the parent-child connections. The path must contain at least one node and does not need to go through the root.

For example:
Given the below binary tree,

Return 6.

Idea:

Recursion

Time complexity O(n)

Space complexity O(h)

Solution: Recursion

Python3

Related Problems:

Mission News Theme by Compete Themes.