He's so invested in reading it out that he even pronounced changed to chang-ed. Wow whatever the reason seems to be feel like we should empower more videos like this

Very sort and best Explanation

with space complexity can have better solution it keep two array of min and max element till any index from l to r and r to L?

Great explanation

amazing !!

class Solution{ public: vector printUnsorted(int arr[], int n) { int s, e, max, min; vectorv; // step 1(a) of above algo for (s = 0; s { if (arr[s] > arr[s+1]) break; } if (s == n-1) { v.push_back(0); v.push_back(0); return v; } // step 1(b) of above algo for(e = n - 1; e > 0; e--) { if(arr[e] break; } // step 2(a) of above algo max = arr[s]; min = arr[s]; for(int i = s + 1; i max) max = arr[i]; if(arr[i] min = arr[i]; } // step 2(b) of above algo for( int i = 0; i { if(arr[i] > min) { s = i; break; } } // step 2(c) of above algo for( int i = n -1; i >= e+1; i--) { if(arr[i] { e = i; break; } } v.push_back(s); v.push_back(e); return v; } };

Thanks for reading the solution, I cannot read texts.

@ahishnar1568

3 жыл бұрын

try hard to think about solution by yourself first, atleast reach somewhat closer to the solution then look at the solution by GFG. if anyone seeing the solution directly without thinking anything about the solution then it is very difficult to get the solution because in that case you need a very well formed explaination by someone who is really good in explaining the solutions which is very hard to find. So it is better to try the above approach which I told. :)

Is this called expaination or reading ppts? I wonder!

@ahishnar1568

3 жыл бұрын

It is called as explaining by reading ppt's. :)

Fails for arrays with repeated element. A : [ 1, 1, 10, 10, 15, 10, 15, 10, 10, 15, 10, 15 ]

@ahishnar1568

3 жыл бұрын

I think the provided solution only possible for an array having non repeating elements.