Lets geek out. The HackerNoon library is now ranked by reading time created. Start learning by what others read most. A full stack developer is an engineer who can handle all the work of databases, ...

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 ...

* Given a binary tree, return the level order traversal of its nodes' values. (ie, from left to right, level by level).

Budapest was the fastest growing European city in the 19th century and about a quarter of its population was Jewish. Jews in Eastern Europe have functioned like the canary in the mine: what happened ...