Missing Space Complexity

Computer Science Level 3

Suppose that out of the integers from 1 to \(n\), you are given \( n - 2 \) of them.

What is the order of space needed for an algorithm to find out these 2 missing numbers?

Extra Credit: Generalise for \(k\) missing numbers.



Problem Loading...

Note Loading...

Set Loading...