MORGAN STANLEY OA Help : Interview Help

D done ✅

C done ✅

A and B done ✅

dm me fast 💯 @cp_wala

https://leetcode.com/CookiesWasTaken/ Want to purchase this Leetcode Guardian Account? 😍

https://leetcode.com/Virus_ARzk/ https://leetcode.com/rohitashwa01/ Anyone wants these IDs? Very cheap price, dm me ☠️

if anyone wants to buy this Codeforces id, dm me @cp_wala https://codeforces.com/profile/Loki_Coder

if anyone wants to buy this Codeforces id, dm me @cp_wala https://codeforces.com/profile/Loki_Coder

🥳🥳

D done

@cp_Wala dm fast

B done ✅

A done

Get ready for CF

Bhai koi AtCoder de raha hai to please Q2 ka testcase explain kardo 🥺 @cp_wala

void code() { int n; cin >> n; vector arr(n); for (int &i : arr) cin >> i; int minIndex = 0; for (int i = 0; i < n; i++) if (arr[i] < arr[minIndex]) minIndex = i; int res = minIndex; for (int i = minIndex; i < n - 1; i++) if (arr[i] > arr[i + 1]) res = -1; cout << res << endl; } // E // Enjoy ❤️

E solution Find the smallest element index and if the array is sorted from there then print its index otherwise if not sorted print -1