description: You are given two strings s and t, both consisting of lowercase English letters. You are going to type the string s character by character, from the first character to the last one.
  
  When typing a character, instead of pressing the button corresponding to it, you can press the "Backspace" button. It deletes the last character you have typed among those that aren't deleted yet (or does nothing if there are no characters in the current string). For example, if s is "abcbd" and you press Backspace instead of typing the first and the fourth characters, you will get the string "bd" (the first press of Backspace deletes no character, and the second press deletes the character 'c'). Another example, if s is "abcaa" and you press Backspace instead of the last two letters, then the resulting text is "a".
  
  Your task is to determine whether you can obtain the string t, if you type the string s and press "Backspace" instead of typing several (maybe zero) characters of s.
  
  Input
  
  The first line contains a single integer q (1 ≤ q ≤ 10^5) — the number of test cases.
  
  The first line of each test case contains the string s (1 ≤ |s| ≤ 10^5). Each character of s is a lowercase English letter.
  
  The second line of each test case contains the string t (1 ≤ |t| ≤ 10^5). Each character of t is a lowercase English letter.
  
  It is guaranteed that the total number of characters in the strings over all test cases does not exceed 2 ⋅ 10^5.
  
  Output
  
  For each test case, print "YES" if you can obtain the string t by typing the string s and replacing some characters with presses of "Backspace" button, or "NO" if you cannot.
  
  You may print each letter in any case (YES, yes, Yes will all be recognized as positive answer, NO, no and nO will all be recognized as negative answer).
  
  Example
  
  Input
  
  
  4
  ababa
  ba
  ababa
  bb
  aaa
  aaaa
  aababa
  ababa
  
  
  Output
  
  
  YES
  NO
  NO
  YES
  
  Note
  
  Consider the example test from the statement.
  
  In order to obtain "ba" from "ababa", you may press Backspace instead of typing the first and the fourth characters.
  
  There's no way to obtain "bb" while typing "ababa".
  
  There's no way to obtain "aaaa" while typing "aaa".
  
  In order to obtain "ababa" while typing "aababa", you have to press Backspace instead of typing the first character, then type all the remaining characters.
solution: #include <bits/stdc++.h>
  using namespace std;
  const long double PI = acos(-1);
  const long long int INF = 1e18;
  const long long int MOD = 1e9 + 7;
  inline long long int mod_pow(long long int a, long long int b) {
    long long int res = 1;
    a %= MOD;
    while (b) {
      if (b & 1) res = (res * a) % MOD;
      a = (a * a) % MOD;
      b >>= 1;
    }
    return res;
  }
  inline long long int mod_inv(long long int a, long long int b) {
    return mod_pow(a, MOD - 2);
  }
  int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    long long int TT = 1;
    cin >> TT;
    while (TT--) {
      long long int n, m, k = 0;
      string s, x;
      cin >> s >> x;
      k = x.length() - 1;
      long long int pos = s.length() - 1;
      for (long long int i = (s.length() - 1); i >= (0); --i) {
        if (k == -1) break;
        if (s[i] == x[k] && (abs(pos - i) % 2 == 0)) {
          pos = i - 1;
          k--;
        }
      }
      if (k == -1)
        cout << "YES\n";
      else
        cout << "NO\n";
    }
    return 0;
  }
  