StringsAndThings.java

package io.zipcoder;


import java.util.regex.Matcher;
import java.util.regex.Pattern;

/**
 * @author tariq
 */
public class StringsAndThings<base> {

    /**
     * Given a string, count the number of words ending in 'y' or 'z' -- so the 'y' in "heavy" and the 'z' in "fez" count,
     * but not the 'y' in "yellow" (not case sensitive). We'll say that a y or z is at the end of a word if there is not an alphabetic
     * letter immediately following it. (Note: Character.isLetter(char) tests if a char is an alphabetic letter.)
     * example : countYZ("fez day"); // Should return 2
     * countYZ("day fez"); // Should return 2
     * countYZ("day fyyyz"); // Should return 2
     */
    public Integer countYZ(String input) {

        Integer count = 0;

        // f e z   d a y
        // 0 1 2 3 4 5 6
        for (int i = 0; i < input.length(); i++) {
            if (input.charAt(i) == 'y' || input.charAt(i) == 'z') {
                if (i == input.length() - 1) {
                    count++;
                } else if (!Character.isLetter(input.charAt(i + 1))) {
                    count++;
                }
            }

        }
        return count;
    }

    /**
     * Given two strings, base and remove, return a version of the base string where all instances of the remove string have
     * been removed (not case sensitive). You may assume that the remove string is length 1 or more.
     * Remove only non-overlapping instances, so with "xxx" removing "xx" leaves "x".
     * <p>
     * example : removeString("Hello there", "llo") // Should return "He there"
     * removeString("Hello there", "e") //  Should return "Hllo thr"
     * removeString("Hello there", "x") // Should return "Hello there"
     */
    public String removeString(String base, String remove) {

        String removeString = base.replace(remove, "");
        System.out.println(removeString);

        return removeString;

    }


    /**
     * Given a string, return true if the number of appearances of "is" anywhere in the string is equal
     * to the number of appearances of "not" anywhere in the string (case sensitive)
     * <p>
     * example : containsEqualNumberOfIsAndNot("This is not")  // Should return false
     * containsEqualNumberOfIsAndNot("This is notnot") // Should return true
     * containsEqualNumberOfIsAndNot("noisxxnotyynotxisi") // Should return true
     */
    public Boolean containsEqualNumberOfIsAndNot(String input) {

        Pattern isP = Pattern.compile("is");
        Matcher isM = isP.matcher(input);
        Pattern notP = Pattern.compile("not");
        Matcher notM = notP.matcher(input);

        int matchIs = 0;
        int matchNot = 0;

        while (isM.find()) {
            matchIs++;
        }

        while (notM.find()) {
            matchNot++;
        }

        return (matchIs == matchNot);

    }




    /**
     * We'll say that a lowercase 'g' in a string is "happy" if there is another 'g' immediately to its left or right.
     * Return true if all the g's in the given string are happy.
     * example : gHappy("xxggxx") // Should return  true
     *           gHappy("xxgxx") // Should return  false
     *           gHappy("xxggyygxx") // Should return  false
     */
    public Boolean gIsHappy(String input){
        String gIsHappy = "";
        for (int i = 0; i < input.length(); i++ ) {
            if (input.charAt(i) == 'g') {
                if (input.charAt(i-1) == 'g' || input.charAt(i+1) == 'g') {
                    gIsHappy = "happy";
                } else {
                    gIsHappy = "sad";
                }
            }
        }
        return (gIsHappy == "happy");
    }


    /**
     * We'll say that a "triple" in a string is a char appearing three times in a row.
     * Return the number of triples in the given string. The triples may overlap.
     * example :  countTriple("abcXXXabc") // Should return 1
     *            countTriple("xxxabyyyycd") // Should return 3
     *            countTriple("a") // Should return 0
     */
    public Integer countTriple(String input){
        int count = 0;
//        int length = input.length();
//        int lengthMinusOne = input.length()-1;
        for (int i = 0; i < input.length()-1; i++){
//            int lengthMinusFour = input.length() - 3;
            if (i < input.length() - 3) {
//                char charAti = input.charAt(i);
//                char charAtiPlusOne = input.charAt(i + 1);
//                char charAtiPlusTwo = input.charAt(i + 2);
               if (input.charAt(i) == input.charAt(i + 1)) {
                   if (input.charAt(i + 1) == input.charAt(i + 2)) {
                       count++;
                   }
               }

            }

    }
        return count;
    }
}