hard20 pts · first answer countsarraysin-place
Smallest missing positive integer
What is the smallest missing positive integer in [3, 4, -1, 1], and which O(n), O(1)-space idea finds it?
Discussion 0
Join free to post in the discussion.
Related questions
- Cost of reading arr[i]Backend Developer
- Inserting at the front of an arrayBackend Developer
- Why push is amortized O(1)Backend Developer
- Changing one character of a stringBackend Developer
- Reversing a simple stringBackend Developer
- slice vs spliceBackend Developer
- Index of the last elementBackend Developer
- indexOf and NaNBackend Developer