threeal / leetspace

A dedicated workspace and archive for my LeetCode submissions
https://leetcode.com/threeal
MIT License
1 stars 1 forks source link

Solve Problem 1893. Check if All the Integers in a Range Are Covered #1813

Closed threeal closed 1 week ago

threeal commented 2 weeks ago

This issue suggests solving the problem 1893. Check if All the Integers in a Range Are Covered. Since the test constraint is small, we can check the numbers using a bitmap of size 64. We can use the binary AND operation to fill and verify if the given range is covered.