Permutation in String Leetcode Solution

class Solution {
public:
    bool checkInclusion(string s1, string s2) {
        if (s1.size() > s2.size()) return false;
        vector< int> s1v (26, 0);
        for (auto c : s1) s1v[c - 'a']++;
        vector< int> s2v (26, 0);
        int l = 0, r = 0;
        while (r < s2.size()) {
            s2v[s2[r]-'a']++;
            if (r - l + 1 == s1.size()) 
                if (s1v == s2v) return true;
            if (r - l + 1 <  s1.size()) r++;
            else {
                s2v[s2[l]-'a']--;
                l++;
                r++;
            }
        }
        return false;
    }
};

class Solution {
    public boolean checkInclusion(String s1, String s2) {
        
        if(s1.length() >s2.length())return false;
        int[] data = new int[26];
        int[] test = new int[26];
        
        for(char c : s1.toCharArray())data[c-'a']++;
        
        for(int i=0;i< s1.length();i++)test[s2.charAt(i)-'a']++;        
        int n=s1.length(); 

        for(int i=0;i< s2.length()-n;i++){
            if(equalsString(test, data))return true;
            test[s2.charAt(i+n)-'a']++;     
            test[s2.charAt(i)-'a']--;            
        }
        return equalsString(test, data);
    }
    private boolean equalsString(int[] s1, int[] s2){
        
        for(int i=0;i< 26;i++)
            if(s1[i]!=s2[i])return false;        
        return true;
    }
}

class Solution:
    def checkInclusion(self, s1: str, s2: str) -> bool:
        checker = ''.join(sorted(s1))
        
        for i in range(len(s2) - len(s1)+1):
            temp = ''.join(sorted(s2[i:i+len(s1)]))
            if temp == checker:
                return True
        return False