UTpaper

Free mock tests & test series

Question 196Asked in CIL MT Systems, 24 Aug 2026 (3:00 PM, CBT-26)

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…

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?
  1. AO(n) time, O(n) space
  2. BO(1) time, O(1) space
  3. CO(n log n) time, O(1) space
  4. DO(n2) time, O(1) space
Show answerHide answer

Correct answer: (D) O(n2) time, O(1) space

From CIL MT Systems PYQ, 24 Aug 2026 (3:00 PM, CBT-26)

This is question 196 of CIL MT Systems PYQ, 24 Aug 2026 (3:00 PM, CBT-26). See all questions of this paper with answers, or attempt the paper as a timed online test to get your score and all-India rank.