Problem
Given an array, find the smallest window (subarray) that must be sorted to make the whole array sorted. Print its length. If already sorted, print 0.
Input format
Input
input.txt
- The first line contains N (1 ≤ N ≤ 100). - The second line contains N integers.
Output format
Output
output.txt
- The length of the minimal unsorted subarray.
Example
input
6 1 3 5 4 2 6
output
4
💬 Discussion
Loading...💬
No comments yet. Be the first to start the discussion!
💻 No output yet.
Click Run in the editor to execute your code with the custom input.
Sample cases (from the problem)
Sample Case 1
Input
6 1 3 5 4 2 6
Expected output
4
Solve it your way first
Community solutions unlock after you submit a passing solution. Don't peek.
Ready to solve this challenge?
Create a free account to write code, submit solutions, and track your progress.
⌨️ Keyboard Shortcuts
Code Editor
Run Code
Ctrl
Enter
Submit Code
Ctrl
Shift
Enter
Format Code
Shift
Alt
F
Toggle Comment
Ctrl
/
Undo
Ctrl
Z
Redo
Ctrl
Y
Navigation
Global Search
/
Show Shortcuts
?
Close Modal
Esc