PRINT TRUE IF FIRST STRING IS A SUBSTRING OF FIRST STRING,ELSE PRINT FALSE

 PRINT TRUE IF FIRST STRING IS A SUBSTRING OF FIRST STRING,ELSE PRINT FALSE

NOTE:* symbol can replace n number of characters

Input: Spoon Sp*n  Output: TRUE

          Zoho   *o*o   Output: TRUE

          Man    n*       Output:FALSE

          Subline line    Output:TRUE


PROGRAM:

import java.util.*;
public class zohostring {

    public static void checkContains(String s1,String s2)
    {
        String s3="";
        int flag=0;
        for(int i=0;i<s1.length();)
        {
            for(int j=0;j<s2.length();j++)
            {
                if(s2.charAt(j)=='*')
                {
                    s3+=s1.charAt(i);
                    s2=s2.substring(0,j)+String.valueOf(s1.charAt(i))+s2.substring(j+1,s2.length());
                
                    if(s1.equals(s2) || s1.length()==s2.length())
                    {
                        break;
                    }
                    else{
                       
                        if(!s2.contains("*"))
                        {
                            s2=s2.substring(0,j+1)+"*"+s2.substring(j+1,s2.length());
                        }
                        else{
                            i++;
                        }
                        
                  
                    }
                }
                else{
                    s3+=s2.charAt(j);
                    i++;
                }
            }
            
            if(s1.contains(s3))
            {
                System.out.println("True");
                flag=1;
                break;
            }
          
        }
        if(flag==0)
        {
            System.out.println("False");
        }
    }
    public static void main(String args[])
    {
        Scanner sc=new Scanner(System.in);
        String s1=sc.next();
        String s2=sc.next();
        checkContains(s1,s2);
        
    }
    
}

Comments

Post a Comment

Popular posts from this blog

PROGRAM TO FIND FACTORIAL OF A NUMBER USING RECURSION

 PROGRAM TO FIND FACTORIAL OF A NUMBER  USING RECURSION  I/P: 3 O/P: 6 SOLUTION: package   N umbers ; import   java . util .*; public   class   Factorial  {      static   int   factorial ( int   n ) {          return  ( n  >  1 )  ?   n  *  factorial ( n - 1 )  :   1 ;        }         public   static   void   main ( String []  args ) {              Scanner   sc = new   Scanner ( System . in );             int   n  =  sc . nextInt ();                          int   result  ...
Read more

PROGRAM TO FIND THE COUNT OF PARTICULAR NUMBER IN AN ARRAY

  PROGRAM TO FIND THE COUNT OF PARTICULAR NUMBER IN AN ARRAY I/P: 5 1 0 2 0 0 O/P: 3 This program explains how many zeros present in the zero PROGRAM: import   java . util .*; public   class   ZeroCount  {      public   static   void   main ( String   args [])     {          Scanner   sc = new   Scanner ( System . in );          int   iNum = sc . nextInt ();          int   arr []= new   int [ iNum ];          for ( int   i = 0 ; i < iNum ; i ++)         {              arr [ i ]= sc . nextInt ();         }          int   count = 0 ; ...
Read more

TELEPHONE BOOK USING HASHMAP

  Sample Input 3 sam 99912222 tom 11122222 harry 12299933 sam edward harry Sample Output sam=99912222 Not found harry=12299933 Explanation We add the following    (Key,Value)  pairs to our map so it looks like this: We then process each query and print  key=value  if the queried   is found in the map; otherwise, we print  Not found . Query 0:   sam Sam is one of the keys in our dictionary, so we print  sam=99912222 . Query 1:   edward Edward is not one of the keys in our dictionary, so we print  Not found . Query 2:   harry Harry is one of the keys in our dictionary, so we print  harry=12299933 . SOLUTION: package   H acker R ank_problems . practice_problems ; import   java . util .*; import   java . io .*; public   class   TelephoneBook {      public   static   void   main ( String  [] argh ){          Scanne...
Read more