GATE CSE 2024 Session 2 Q35: Minimum replacements to make an array non-decreasing
- Algorithms
- 1 mark
- NAT
- No negative marking
Question
Let be an array containing integer values. The distance of is defined as the minimum number of elements in that must be replaced with another integer so that the resulting array is sorted in non-decreasing order. The distance of the array is ___________
Try it: numerical answer: type the value
Show answer and explanation
Answer: 3 (official GATE 2024 final answer key)
Concept used: Elements kept unchanged must form a non-decreasing subsequence, so distance = − longest non-decreasing subsequence.
First step: Find the longest non-decreasing subsequence of , for example .
Full step-by-step solution
Detailed working, common mistakes and linked mock tests will be available with a free GATEiit account. Log-in is coming soon.
Share this question
Source: official GATE 2024 Session 2 CS question paper and final answer key, organised by IISc Bangalore. Question paper · Answer key
More Algorithms PYQs
- 2026 Session 1 · Q17Solve nested recurrences T1 = 4T1(n/2) + T2, T2 = 5T2(n/4) + log n
- 2026 Session 1 · Q41Shortest paths with at most k edges: two statements
- 2026 Session 1 · Q47Condition forcing a vertex into every minimum vertex cover
- 2026 Session 1 · Q49Cycle and cut properties of MSTs with distinct weights
- 2026 Session 1 · Q50Impossible DFS discovery/finish orderings for a DAG edge
- 2026 Session 1 · Q55Properties of 2-colorable (bipartite) graphs