Untitled

import java.io.BufferedReader;
import java.io.FileReader;
import java.io.IOException;

public class RegExp {

    public static void main(String[] args) {
        String str1 = args[1];
        String str2 = args[2];
        int s2Count = Integer.parseInt(args[3]);

        try {
            BufferedReader reader = new BufferedReader(new FileReader(args[0]));
            String line;
            while ((line = reader.readLine()) != null) {
                // Check if it is a palindrome
                boolean isPalindrome = isPalindrome(line);

                // Check if it contains a specific string str_1
                boolean containsStr1 = containsString(line, str1);

                // Check if it contains a specific string str_2 equal to or more than n times
                boolean containsStr2N = containsStringNTimes(line, str2, s2Count);

                // Check if it contains the string a^{m}Xb^{2m}
                boolean containsStringAB = containsStringAB(line, str1, str2);

                // Print the output in the required format
                System.out.printf("%s,%s,%s,%s\n",
                        isPalindrome ? "Y" : "N",
                        containsStr1 ? "Y" : "N",
                        containsStr2N ? "Y" : "N",
                        containsStringAB ? "Y" : "N");
            }
            reader.close();

        } catch (IOException e) {
            e.printStackTrace();
        }
    }public static boolean isPalindrome(String inputStr) {
        int left = 0;
        int right = inputStr.length() - 1;
        while (left < right) {
            if (inputStr.charAt(left) != inputStr.charAt(right)) {
                return false;
            }
            left++;
            right--;
        }
        return true;
    }

    public static boolean containsString(String str, String substr) {
        return str.contains(substr);
    }

    public static boolean containsStringNTimes(String str, String substr, int n) {
        int count = 0;
        int pos = 0;
        while ((pos = str.indexOf(substr, pos)) != -1) {
            count++;
            pos ++;
        }
        return count >= n;
    }

    public static boolean containsStringAB(String str, String a, String b) {
        int aCount = 0;
        int bCount = 0;
        boolean foundA = false;
    
        // Step 1: Find the position of the first occurrence of 'a' or 'A'
        int pos = 0;
        while (pos < str.length()) {
            if (str.charAt(pos) == 'a' || str.charAt(pos) == 'A') {
                foundA = true;
                break;
            }
            pos++;
        }
    
        // Step 2: Increment the position to point to the substring after 'a' or 'A'
        if (foundA) {
            pos++;
    
            // Step 3: Count the occurrences of 'b' or 'B'
            while (pos < str.length()) {
                if (str.charAt(pos) == 'b' || str.charAt(pos) == 'B') {
                    bCount++;
                } else {
                    break;
                }
                pos++;
            }
        }
    
        // Check if 'b' or 'B' count is twice the 'a' or 'A' count
        aCount = foundA ? 1 : 0; // if 'a' or 'A' found, count it
        return bCount == 2 * aCount;
    }
}