Difficulty : Easy

Topics : Array

Platform : Leetcode

Problem Statement

You are given a sorted unique integer array nums.

A range [a,b] is the set of all integers from a to b (inclusive).

Return the smallest sorted list of ranges that cover all the numbers in the array exactly. That is, each element of nums is covered by exactly one of the ranges, and there is no integer x such that x is in one of the ranges but not in nums.

Each range [a,b] in the list should be output as:

"a->b" if a != b

"a" if a == b

Problem Statement Simplified

Get back the range of continuous numbers in the array.

Mistakes and Learning

Forgot to check for the leftover at the end of the for loop — always need to check the end-of-data scenario.

Forgot to check if nums.…