Find if integer exists within a list of ranges

Question

Given an array N of 1,000,000 unique integers ranging from 0 to 1,999,999. What is the fastest way to filter out integers that do not exist within any range inside of M - where M is a fixed group of 10 random ranges each with integers ranging from 0 to 1,999,999?

Short sample with smaller numbers:

Given this set N of unique integers: [1,5,7,8,20,22,30] and this set M of ranges: [(1,6) , (19,21), (23,50)]

Find what values of N exist within any range of M (inclusive bounds)

Solution: [1,5,20,30]

Java is preferred (to run time/complexity tests) but any other language is fine

Answer 1

Using python3. Hope this is helpful

import numpy as np
ranges = [(1,6) , (19,21), (23,50)]
nums = [1,5,7,8,20,22,30]

max = ranges[-1][1]
ind_array = np.zeros(max)

for r in ranges:
  ind_array[r[0]-1:r[1]] = 1

lst = []
for n in nums:
  if ind_array[n-1] == 1:
    lst.append(n)

print(lst)