Leetcode 163. Missing Ranges

Given a sorted array of distinct integers and inclusive lower/upper bounds, find all numbers or continuous ranges within [lower, upper] that are not present in the array and return each missing entry as a string ("x" for a single number or "a->b" for a range).

Asked at:

Meta

Question Timeline

See when this question was last asked and where, including any notes left by other candidates.

Company

Level

Region

Mid December, 2025

Meta

Mid-level

Late September, 2025

Meta

Senior

Mid June, 2025

Meta

Senior

Get Premium to View All 7 Reports

Comments

Your account is free and you can post anonymously if you choose.

Hello Interview Premium

Recent interview questions

System Design Guided Practice

Exclusive content

Learn More

Leetcode 163. Missing Ranges

Question Timeline

Comments

Questions

Learn

Links

Legal

Contact