Stuck Keyboard- Google Top Interview Questions

                        Solution in C++ :

bool solve(string s, string t) {
    int curr = 0;
    for (int i = 0; i < t.size();) {
        int j = i + 1;
        while (j < t.size() && t[j] == t[i]) j++;
        if (curr == s.size()) return false;
        if (s[curr] != t[i]) return false;
        int nextindex = curr;
        while (nextindex < s.size() && s[nextindex] == s[curr]) nextindex++;
        if (nextindex - curr < j - i) return false;
        curr = nextindex;
        i = j;
    }
    return curr == s.size();
}
                    

                        Solution in Java :

import java.util.*;

class Solution {
    public boolean solve(String s, String t) {
        int k = 0;

        for (int i = 0; i < s.length(); i++) {
            if (k >= t.length() || s.charAt(i) != t.charAt(k)) {
                return false;
            }

            int j = i;
            int cnt1 = 0;
            int cnt2 = 0;

            while (j < s.length() && s.charAt(j) == s.charAt(i)) {
                j++;
                cnt1++;
            }
            i = j - 1;

            j = k;
            while (j < t.length() && t.charAt(j) == t.charAt(k)) {
                j++;
                cnt2++;
            }
            k = j;

            if (cnt1 < cnt2)
                return false;
        }

        if (k != t.length())
            return false;
        return true;
    }
}
                    

                        Solution in Python : 
                            
from itertools import groupby, zip_longest


class Solution:
    def solve(self, typed, target):
        return all(
            x is not None and y is not None and x[0] == y[0] and len(list(x[1])) <= len(list(y[1]))
            for (x, y) in zip_longest(groupby(target), groupby(typed))
        )