Minimum Replacements to Sort the Array
Algorithms: Searching, Sorting & Big-O
Implement algorithmic solution for **Minimum Replacements to Sort the Array** (Hard level).
Input parameters: `data`.
// EXAMPLES
Example 1:
Input:
Input: 2Output:
4Explanation: Result for example 1 of Minimum Replacements to Sort the Array.
Example 2:
Input:
Input: 5Output:
10Explanation: Result for example 2 of Minimum Replacements to Sort the Array.
// CONSTRAINTS
1 <= len(input) <= 10^5Time Complexity target: O(N) or O(N log N)Space Complexity target: O(1) or O(N)Evaluated against 600 test cases.
solution.py