Leetcode, Interval, Interview Questions, Google, Meta.
array becomes 0, 0, 1. All the elements are amazing number. If there are multiple positions, return the smallest one. Solution: This is a tricky problem, as it does not look to be an interval problem but more of an array problem. But we can transform it to an interval problem. For each number,