Counting Bits (#338)
Given an integer n, return an array ans of length n + 1 such that for each i (0 <= i <= n), ans[i] is the number of 1's in the binary representation of i.
Company Tags: Microsoft, Google
Core Concept: Bit Manipulation, Dynamic Programming