We’ll start with the most far-reaching addition, which the spec describes as “a new Iterator global with associated static and prototype methods for working with iterators.” The most exciting part of ...

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

We can use the previous approach, where we calculated all sum subarray using Carry Forward technique. Instead of keeping track of maximum, we can simply add the sums in a variable. Instead of ...