Lets geek out. The HackerNoon library is now ranked by reading time created. Start learning by what others read most. Lets geek out. The HackerNoon library is now ranked by reading time created. Start ...

Insights, news and analysis of the crypto market straight to your inbox ...

Preparing for coding interviews can be a real challenge with developers often spending several weeks reviewing and learning new material. The truth is, that most developers never quite feel fully ...

Given a non-empty 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 ...

Note: Some of the code here is old and was written when I was learning C++. It might be possible that code is not safe or making wrong assumptions. Please use with caution. Pull requests are always ...