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: import java.io.*;
  import java.lang.*;
  import java.util.*;
  
  //* --> number of prime numbers less then or equal to x are  -->  x/ln(x)
  //* --> String concatenation using the + operator within a loop should be avoided. Since the String object is immutable, each call for concatenation will
  // result in a new String object being created.
  // THE SIEVE USED HERE WILL RETURN A LIST CONTAINING ALL THE PRIME NUMBERS TILL N
  public class a_approach1 {
      static FastScanner sc;
      static PrintWriter pw;
  
      static class FastScanner {
          InputStreamReader is;
          BufferedReader br;
          StringTokenizer st;
  
          public FastScanner() {
              is = new InputStreamReader(System.in);
              br = new BufferedReader(is);
          }
  
          String next() throws Exception {
              while (st == null || !st.hasMoreElements())
                  st = new StringTokenizer(br.readLine());
              return st.nextToken();
          }
  
          int nextInt() throws Exception {
              return Integer.parseInt(next());
          }
  
          long nextLong() throws Exception {
              return Long.parseLong(next());
          }
  
          int[] readArray(int num) throws Exception {
              int arr[] = new int[num];
              for (int i = 0; i < num; i++)
                  arr[i] = nextInt();
              return arr;
          }
  
          String nextLine() throws Exception {
              return br.readLine();
          }
      }
  
      public static boolean power_of_two(int a) {
          if ((a & (a - 1)) == 0) {
              return true;
          }
          return false;
      }
  
      static boolean PS(double x) {
          if (x >= 0) {
              double i = Math.sqrt(x);
              if (i % 1 != 0) {
                  return false;
              }
              return ((i * i) == x);
          }
          return false;
      }
  
      public static int[] ia(int n) {
          int ar[] = new int[n];
          return ar;
      }
  
      public static long[] la(int n) {
          long ar[] = new long[n];
          return ar;
      }
  
      public static void print(int ans, int t) {
          System.out.println("Case" + " " + "#" + t + ":" + " " + ans);
      }
  
      static long mod = 1000000007;
      static int max = Integer.MIN_VALUE;
      static int min = Integer.MAX_VALUE;
  
      public static void sort(long[] arr) {// because Arrays.sort() uses quicksort which is dumb
          // Collections.sort() uses merge sort
          ArrayList<Long> ls = new ArrayList<Long>();
          for (long x : arr)
              ls.add(x);
          Collections.sort(ls);
          for (int i = 0; i < arr.length; i++)
              arr[i] = ls.get(i);
      }
  
      public static long fciel(long a, long b) {
          if (a == 0)
              return 0;
          return (a - 1) / b + 1;
      }
  
      static boolean[] is_prime = new boolean[1000001];
      static ArrayList<Integer> list = new ArrayList<>();
      static long n = 1000000;
  
      public static void sieve() {
          Arrays.fill(is_prime, true);
          is_prime[0] = is_prime[1] = false;
          for (int i = 2; i * i <= n; i++) {
              if (is_prime[i]) {
                  for (int j = i * i; j <= n; j += i)
                      is_prime[j] = false;
              }
          }
          for (int i = 2; i <= n; i++) {
              if (is_prime[i]) {
                  list.add(i);
              }
          }
      }
  
      public static void main(String args[]) throws java.lang.Exception {
          sc = new FastScanner();
          pw = new PrintWriter(System.out);
          StringBuilder s = new StringBuilder();
          int t = sc.nextInt();
          while (t-- > 0) {
              String str = sc.next();
              String ttr = sc.next();
              int i = str.length() - 1;
              int j = ttr.length() - 1;
              while (i >= 0 && j >= 0) {
                  if (str.charAt(i) == ttr.charAt(j)) {
                      i--;
                      j--;
                  } else {
                      i -= 2;
                  }
              }
              if (j >= 0) {
                  s.append("NO");
              } else {
                  s.append("YES");
              }
              if (t > 0) {
                  s.append("\n");
              }
          }
          pw.print(s);
          pw.close();
      }
  }