Mihir sol

class Solution {
public:
    int findUnsortedSubarray(vector<int>& l1) {
        vector<int> l2(l1.begin(),l1.end());
        sort(l2.begin(),l2.end());
        if(l1 == l2) return 0;
        int len = l1.size();
        int st = 0, ed = len-1;
        while(st < len && l1[st] == l2[st]) st++;
        while(ed > -1  && l1[ed] == l2[ed]) ed--;
        return ed - st + 1;
    }
};