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

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

Suppose you were asked to design an abridged computer science (CS) program consisting of just three courses. How would you go about it? The first course would probably be an introduction to computer ...

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

Unlock the full InfoQ experience by logging in! Stay updated with your favorite authors and topics, engage with content, and download exclusive resources. In this podcast, Shane Hastie, Lead Editor ...

I see it time and again in Google interviews or new-grad hires: The way data structures and algorithms — among the most important subjects in a proper computer science curriculum — are learnt is often ...