Problem

Return a list of ranges missing from [lower, upper] given a sorted integer array.

Given a sorted integer array nums (with no duplicates) and two integers lower and upper, return all the missing ranges from lower to upper (inclusive).

Each range should be represented as a string in the format "lower->upper" (if lower != upper) or just the number (if lower == upper).