Test Recursion

Given two strings s and t, write a function to check if s contains all characters of t (in the same order as they are in string t).

public class Solution {

    public static boolean checkSequence(String a, String b) {

        /* Your class should be named Solution

         * Don't write main().

         * Don't read input, it is passed as function argument.

         * Return output and don't print it.

         * Taking input and printing output is handled automatically.

         */

         if(b.length() == 0){

             return true;

         }

         if(a.length() == 0){

             return false;

         }

         //check if the first character match

         if(a.charAt(0)  == b.charAt(0)){

             return checkSequence(a.substring(1), b.substring(1));

         }

         else{

            //  move to the next character

            return checkSequence(a.substring(1), b);

         }

    }

}