0 0 votes A list of $n-1$ integers is provided, where each integer is in the range of $1$ to $n$, and there are no duplicates. One integer is missing from the list. What is the time and space complexity if we apply a brute force algorithm to find the missing integer?$\mathrm{O}(n)$ time, $\mathrm{O}(n)$ space$\mathrm{O}(n \log n)$ time, $\mathrm{O}(1)$ space$\mathrm{O}(n^{2})$ time, $\mathrm{O}(1)$ space$\mathrm{O}(1)$ time, $\mathrm{O}(1)$ space Others cil-2026 + – Shubham Sharma 2 16 views answer comment Share Follow Print 0 reply Please log in or register to add a comment.