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: //package com.company;
  
  
  
  import javax.naming.ldap.HasControls;
  import java.io.*;
  import java.util.*;
  
  public class Main implements Runnable {
      int size[];
      static int e9 = 1000000007;
      int max = Integer.MIN_VALUE;
      long max1 = Long.MIN_VALUE;
      long min1 = Long.MAX_VALUE;
      long fib[][];
      static class FastReader {
          BufferedReader br;
          StringTokenizer st;
  
          public FastReader() {
              br = new BufferedReader(new
                      InputStreamReader(System.in));
          }
  
          String next() {
              while (st == null || !st.hasMoreElements()) {
                  try {
                      st = new StringTokenizer(br.readLine());
                  } catch (IOException e) {
                      e.printStackTrace();
                  }
              }
              return st.nextToken();
          }
  
          int nextInt() {
              return Integer.parseInt(next());
          }
  
          long nextLong() {
              return Long.parseLong(next());
          }
  
          double nextDouble() {
              return Double.parseDouble(next());
          }
  
          String nextLine() {
              String str = "";
              try {
                  str = br.readLine();
              } catch (IOException e) {
                  e.printStackTrace();
              }
              return str;
          }
      }
      int parent[];
      int rank[];
      ArrayList<ArrayList<Integer>> arrayLists;
      long fib1[][];
      long r[];
      int n;
      int m;
      long co=0;
      long v[];
      int arr[][];
      int u=0;
      HashMap<Long,Long> hashMap=new HashMap<>();
      ArrayList<Long> arrayList;
      long ans=0;
      public static void main(String[] args) throws IOException {
          new Thread(null,new Main(),"Main",1<<28).start();
      }
  
      public void run() {
          FastReader scanner = new FastReader();
  //            Scanner scanner = new Scanner(System.in);
  //            BufferedReader bufferedReader=new BufferedReader(new InputStreamReader(System.in));
          PrintWriter printWriter = new PrintWriter(System.out);
          long t=scanner.nextLong();
          high:while (t-- > 0) {
              String s=scanner.next();
              String s1=scanner.next();
              int e1=s.length()-1;
              int e2=s1.length()-1;
              if(s.length()<s1.length()){
                  printWriter.println("No");
              }
              else{
                  while (e1>=0&&e2>=0){
                      if(s.charAt(e1)!=s1.charAt(e2)){
                          e1-=2;
                      }
                      else{
                          e1--;
                          e2--;
                      }
                  }
                  if(e2<0){
                      printWriter.println("Yes");
                  }
                  else{
                      printWriter.println("No");
                  }
              }
          }
          printWriter.flush();
      }
      static long mod=1_000_000_007;
      public long lcm(long a,long b){
          return (a*b)/gcd(a,b);
      }
      public long mul(long a, long b) {
  //        System.out.println(a+" "+b);
          return ((a)*(b));
      }
      public long fact(int x) {
          long ans=1;
          for (int i=2; i<=x; i++) ans=mul(ans, i);
          return ans;
      }
      public long fastPow(long base, long exp) {
          if (exp==0) return 1;
          long half=fastPow(base, exp/2);
          if (exp%2==0) return mul(half, half);
          return mul(half, mul(half, base));
      }
      public long modInv(long x) {
          return fastPow(x, mod-2);
      }
      public long nCk(int n, int k) {
          return mul(fact(n), mul(modInv(fact(k)), modInv(fact(n-k))));
      }
      public void parent(int n){
          parent=new int[n+1];
          size=new int[n+1];
          rank=new int[n+1];
          for (int i = 0; i <=n; i++) {
              parent[i]=i;
              rank[i]=0;
  //            size[i]=1;
          }
      }
      public void union(int i,int j){
          int root1=find(i);
          int root2=find(j);
  //            if(root1 != root2) {
  //                parent[root2] = root1;
  ////                sz[a] += sz[b];
  //            }
          if(root1==root2){
              return;
          }
          if(rank[root1]>rank[root2]){
              parent[root2]=root1;
              size[root1]+=size[root2];
          }
          else if(rank[root1]<rank[root2]){
              parent[root1]=root2;
              size[root2]+=size[root1];
          }
          else{
              parent[root2]=root1;
              rank[root1]+=1;
              size[root1]+=size[root2];
          }
      }
      public int find(int p){
          if(parent[p]!=p){
              if(parent[p]==-1){
                  return parent[p];
              }
              parent[p]=find(parent[p]);
          }
          return parent[p];
      }
      public double dist(double x1,double y1,double x2,double y2){
          double e=(x2-x1)*(x2-x1)+(y2-y1)*(y2-y1);
          double e1=Math.sqrt(e);
          return e1;
      }
      public void make(int p){
          parent[p]=p;
          rank[p]=1;
      }
      Random rand = new Random();
      public void sort(int[] a, int n) {
          for (int i = 0; i < n; i++) {
              int j = rand.nextInt(i + 1);
              int tmp = a[i];
              a[i] = a[j];
              a[j] = tmp;
          }
          Arrays.sort(a, 0, n);
      }
      public long gcd(long a,long b){
          if(b==0){
              return a;
          }
          return gcd(b,a%b);
      }
      //    public void dfs(ArrayList<Integer> arrayList){
  //        for (int i = 0; i < arrayList.size(); i++) {
  //            if(v1[arrayList.get(i)]==false){
  //                v1[arrayList.get(i)]=true;
  //                dfs(arrayLists.get(i));
  //            }
  //        }
  //    }
      public double fact(double h){
          double sum=1;
          while(h>=1){
              sum=(sum%e9)*(h%e9);
              h--;
          }
          return sum%e9;
      }
      public long primef(double r){
          long c=0;
          long ans=1;
          long g=0;
          while(r%2==0){
              c++;
              r=r/2;
          }
          if(c>0){
              ans*=2;
          }
          c=0;
  //            System.out.println(ans+" "+r);
          for (int i = 3; i <=Math.sqrt(r) ;i+=2) {
              g=0;
              while(r%i==0){
  //                    System.out.println(i);
                  c++;
                  g++;
                  r=r/i;
              }
              if(c>0){
                  ans*=i;
              }
              c=0;
          }
          if(r>2){
              ans*=r;
          }
          return ans;
      }
      public long divisor(double r){
          long c=0;
  //        if(n==3)
  //            System.out.println(r+" "+n+" "+k+" "+"l");
          for (int i =2; i <=Math.sqrt(r); i++) {
              if(r%i==0){
                  if(r/i==i){
                      c++;
                  }
                  else{
                      if(r/i<n){
                          c+=2;
                      }else{
                          c++;
                      }
                  }
              }
          }
          return c;
      }
  }
  class Pair {
      long x;
      long y;
      int z;
      public Pair(long x,long y) {
          this.x = x;
          this.y = y;
  //        this.z=z;
      }
  
  //     @Override
  //    public int hashCode() {
  //        int hash = 37;
  //        return this.x * hash + this.y;
  //    }
  //
  //    @Override
  //    public boolean equals(Object o1) {
  //        if (o1 == null || o1.getClass() != this.getClass()) {
  //            return false;
  //        }
  //        Pair o = (Pair) o1;
  //        if (o.x == this.x && o.y == this.y) {
  //            return true;
  //        }
  //        return false;
  //    }
  }
  class Sorting implements Comparator<Pair> {
      public int compare(Pair p1, Pair p2) {
          if(p1.x==p2.x){
              return Long.compare(p1.y,p2.y);
          }else {
              return Long.compare(p1.x, p2.x);
          }
      }
  }
  class Edge{
      int s=0;
      int d=0;
      int c=0;
      public Edge(int s,int d,int c){
          this.s=s;
          this.d=d;
          this.c=c;
      }
  }
  