Categorygithub.com/awesee/leetcodeproblemsmissing-ranges
package
1.6.6
Repository: https://github.com/awesee/leetcode.git
Documentation: pkg.go.dev
Overview
Dependencies
0
Dependents
0

# README

< Previous 　　　　　　　　　　　　　　　　 Next >

163. Missing Ranges (Easy)

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

Example:

Input: nums = [0, 1, 3, 50, 75], lower = 0 and upper = 99,
Output: ["2", "4->49", "51->74", "76->99"]

Related Topics

[Array]

Similar Questions

  1. Summary Ranges (Easy)