0% completed
I believe this is a simpler and more streight forward approach O(N) on avg (maybe O(NllogN) worst?
adi berkowitz
Dec 10, 2024
0
29
0
Dec 10, 2024
EASY solution sorting and using two pointers /O(nlogn)
Isabela Vlls
Nov 26, 2024
0
22
0
Nov 26, 2024
My solution / Easier approach
Mohammed Dh Abbas
Jun 29, 2024
0
58
0
Jun 30, 2024
Error/Mistake in the Algorithm Walkthrough
Abdullah AlKheshen
Jun 28, 2024
0
24
0
Jun 28, 2024
Got easier solution(python)
Fei Chen
Apr 16, 2024
0
42
0
Apr 16, 2024
issue with test case [1, 2, 5, 3, 7, 10, 9, 12]
Faraz
Mar 1, 2024
0
29
1
Jul 22, 2024
Issue with test case [22, 34, 59, 60, 75, 76, 81].
rvadhith
Feb 6, 2024
1
13
0
Mar 1, 2024
bad test case
Dang Nguyen
Feb 5, 2024
1
13
0
Mar 1, 2024
Time Complexity 3N
AnonymousDeshapriya
Jan 5, 2024
0
19
0
Jan 5, 2024
This solution is absolutely impossible to crack during an interview, only memorize it beforehand
Mikhail Putilov
Aug 19, 2023
1
93
0
Jul 29, 2024
def shortest_window_sort(arr): if len(arr) < 2: return 0 start,end= -1,-2 ...
Ike Nwankwo
Mar 8, 2023
0
14
0
Mar 8, 2023
how do u get the intuition to do this?
Pratheek Sankeshi
Dec 28, 2022
2
90
2
Mar 11, 2025
Python 3 solution fails on LC equivalent 581. Shortest Unsorted Continuous Subar...
J
Nov 18, 2022
0
38
1
Nov 18, 2022
subarray_max = -math.inf subarray_min = math.inf for k in range(low, high+1):...
Jharol Rivera
Jun 2, 2022
0
27
2
Jul 9, 2023