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: /*
   * To change this license header, choose License Headers in Project Properties.
   * To change this template file, choose Tools | Templates
   * and open the template in the editor.
   */
   
  /**
   *
   * @author wilso
   */
  import java.io.BufferedReader;
  import java.io.IOException;
  import java.io.InputStreamReader;
  import java.io.PrintWriter;
  import java.util.*;
  public class codeforces {
      static final long MOD2 = 998_244_353;
      static final long X = 10000000000L;
      public static void main(String[] args) {
          FastScanner sc = new FastScanner();
          PrintWriter pw = new PrintWriter(System.out);
  //        Scanner sc = new Scanner(System.in);
          int tc = sc.ni();
  //        int tc = 1;
          for (int rep = 0; rep < tc; rep++) {
              String s = sc.next();
              String t = sc.next();
              pw.println(solve(s, t));
          }
          
          pw.close();
      }
      static String solve(String s, String t) {
          int j = t.length() - 1;
          int i = s.length() - 1;
          while (i >= 0) {
              if (s.charAt(i) == t.charAt(j)) {
                  j--;
                  i--;
              }
              else {
                  i -= 2;
              }
              if (j == -1) return "YES";
          }
          return "NO";
      }
  
   
   
      static int greaterThan(long[] arr, long target) {
  	int lo = 0, hi = arr.length- 1;
  	while(lo < hi) { // observe this time it is "<" operator, not "<="
  		int mid = lo + (hi-lo)/2;
  		if(arr[mid] <= target) lo = mid+1;
  		else hi = mid;
  	}
  	return arr[lo] > target ? lo : -1;
  }
      static int smallerThan(long[] arr, long target) {
  	int lo = 0, hi = arr.length- 1;
  	while(lo < hi) {
  		int mid = lo + (hi-lo+1)/2; // Note that I used ceil here otherwise it could go in infinite loop
  		if(arr[mid] < target) lo = mid;
  		else hi = mid-1;
  	}
  	return arr[lo] < target ? lo : -1;
  }
    
      static int[] reduce(int[] temp) {
          int[] frac = new int[] {temp[0], temp[1]};
          int curr = gcd(frac[0], frac[1]);
          while (curr != 1) {
              frac[0] /= curr;
              frac[1] /= curr;
              curr = gcd(frac[0], frac[1]);
          }
          return frac;
      }
      static int summation(int x) {
          return x * (x+1) / 2;
      }  
      static long summation(long x) {
          return x*(x+1) / 2;
      }
      static long pow(long num, long exp, long mod){
          long ans=1;
          for(int i=1;i<=exp;i++){
              ans=(ans*num)%mod;
          }
          return ans;
      }
      static boolean isPrime(int n)
      {
   
          if (n <= 1)
              return false;
          else if (n == 2)
              return true;
          else if (n % 2 == 0)
              return false;
          for (int i = 3; i <= Math.sqrt(n); i += 2) {
              if (n % i == 0)
                  return false;
          }
          return true;
      }
      static int gcd(int a, int b)
      {
          if (a == 0)
              return b; 
          return gcd(b % a, a); 
      }
      static long gcd(long a, long b) {
          if (a == 0) return b;
          return gcd(b % a, a);
      }
      static int lcm(int a, int b)
      {
          return (a / gcd(a, b)) * b;
      }
      public static void sort(int[] arr) {
          Random rgen = new Random();
          for (int i = 0; i < arr.length; i++) {
              int r = rgen.nextInt(arr.length);
              int temp = arr[i];
              arr[i] = arr[r];
              arr[r] = temp;
          }
          Arrays.sort(arr);
      }
      public static void sort(long[] arr) {
          Random rgen = new Random();
          for (int i = 0; i < arr.length; i++) {
              int r = rgen.nextInt(arr.length);
              long temp = arr[i];
              arr[i] = arr[r];
              arr[r] = temp;
          }
          Arrays.sort(arr);
      }
      static int charint(char c) {
          return Integer.parseInt(String.valueOf(c));
      }
      
      /* */
      //printing methods
      /* */
      //WOW!
      /* */
      public static void printArr(PrintWriter pw, int[] arr) {
          StringBuilder sb = new StringBuilder();
          for (int x : arr) {
              sb.append(x + "");
          }
          sb.setLength(sb.length() - 1);
          pw.println(sb.toString());
      }
      public static void printArr2d(PrintWriter pw, int[][] arr) {
          StringBuilder sb = new StringBuilder();
          for (int[] row : arr) {
              for (int x : row) {
                  sb.append(x + " ");
              }
              sb.setLength(sb.length() - 1);
              sb.append("\n");
          }
          pw.println(sb.toString());
      }
  }
   
  class FastScanner {
      BufferedReader br;
      StringTokenizer st;
   
      public FastScanner() {
          br = new BufferedReader(new InputStreamReader(System.in), 32768);
          st = null;
      }
   
      String next() {
          while (st == null || !st.hasMoreElements()) {
              try {
                  st = new StringTokenizer(br.readLine());
              } catch (IOException e) {
                  e.printStackTrace();
                  
              }
          }
          return st.nextToken();
      }
   
      int ni() {
          return Integer.parseInt(next());
      }
   
      int[] intArray(int N) {
          int[] ret = new int[N];
          for (int i = 0; i < N; i++)
              ret[i] = ni();
          return ret;
      }
   
      long nl() {
          return Long.parseLong(next());
      }
   
      long[] longArray(int N) {
          long[] ret = new long[N];
          for (int i = 0; i < N; i++)
              ret[i] = nl();
          return ret;
      }
   
      double nd() {
          return Double.parseDouble(next());
      }
   
      String nextLine() {
          String str = "";
          try {
              str = br.readLine();
          } catch (IOException e) {
              e.printStackTrace();
          }
          return str;
      }
  }
   
  class MultiSet {
      TreeMap<Long, Integer> map = new TreeMap<>();
      private int size = 0;
      public MultiSet() {
      }
      public void add(Long val) {
          map.put(val, map.getOrDefault(val, 0) + 1);
          size++;
      }
      public void remove(Long val) {
          map.put(val, map.get(val) - 1);
          if (map.get(val) == 0) {
              map.remove(val);
          }
          size--;
      }
      public int size() {
          return size;
      }
      public Long higher(Long val) {
          return map.higherKey(val);
      }
      public Long lower(Long val) {
          return map.lowerKey(val);
      }
      public Long ceiling(Long val) {
          return map.ceilingKey(val);
      }
      public Long floor(Long val) {
          return map.floorKey(val);
      }
      public Long first() {
          return map.firstKey();
      }
      public Long last() {
          return map.lastKey();
      }
      public boolean isEmpty() {
          return map.isEmpty();
      }
  }