Leetcode 171: Missing Ranges

Sept. 20, 2017

Plan to work on the algorithm called "Missing Ranges". The leetcode discussion link is here.

Problem statement:

Given a sorted integer array where the range of elements are [lower, upper] inclusive, return its missing ranges.

For example, given [0, 1, 3, 50, 75], lower = 0 and upper = 99, return ["2", "4->49", "51->74", "76->99"].