InterviewBit Problems   Maximum Unsorted Subarray : Unsolved


About the Maximum Unsorted Subarray : Unsolved category (1)
'int' object is not iterable (2)
Just needed help with an edge case (in case of repeating similar elements) (1)
Easy approach in Java (1)
Best approach watch this video (1)
Its giving runtime error for this testcase: 12 1 1 10 10 15 10 15 10 10 15 10 15. Please suggest what's wrong (1)
Maximum Unsorted Subarray question (2)
Can anybody tell me why my code is not working? (3)
How is my code exceeding time limit even though there's just one for loop? (2)
Here is the O(n) solution! (1)
O(n) working solution (1)
Why O(nlogn) solution is accepted in C++ ?! (3)
Incorrect Output for below input (2)
Wrong Expected Output (read comment) (2)
Simplest Solution in C++ using a sorted Array (1)
Better approach than editorial (2)
Output is incorrect from interview bit (1)
Pure functional solution (1)
Memory limit exceeded, make more optimal (4)
Expected output and custom output are put of sync? (1)
Ambiguous Test Case Checking (1)
Incorrect output for test case (4)
The editorial python solution is O(nlogn) (2)
Incorrect output for test cases (1)
What's wrong with the input (1)
Why my output is 1 for input array [1 ,3 ,2 ,4 ,5]? (1)
Expected output is not correct for test case (1)
Difference Method (1)
For A : [ 1, 2, 2, 3, 3, 5, 6, 6, 14, 17, 18, 17, 18, 15, 15, 17, 19, 14, 19, 18 ], Shouldn't answer be {10, 19}? (2)
Weak trivial test cases (1)