StringsAndThings.java

package io.zipcoder;


import java.util.Locale;

/**
 * @author tariq
 */
public class StringsAndThings {

    /**
     * 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) {
        int result = 0;
        String[] words = input.split(" ");
        for (String word : words
        ) {
            if (word.endsWith("y") || word.endsWith("z")) {
                result += 1;
            }

        }
        return result;
    }

    /**
     * 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 result = "";
        result = base.replace(remove, "");
        return result;
    }

    /**
     * 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) {
        Boolean result = false;
        String[] inputSplitIntoLetters = input.split("");
        int countOfIs=0;
        int countOfNot=0;
        for(int i=0;i<inputSplitIntoLetters.length-1;i++){
            if(inputSplitIntoLetters[i].equals("i")&&inputSplitIntoLetters[i+1].equals("s")){
                countOfIs++;
            }
            if(inputSplitIntoLetters[i].equals("n")&&inputSplitIntoLetters[i+1].equals("o")&&inputSplitIntoLetters[i+2].equals("t")){
                countOfNot++;
        }
        }
       if(countOfIs == countOfNot){
           result=true;
       }

        return result;
    }









    /**
     * 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) {
        Boolean result = false;
        String[] letter = input.split("");
        for (int i = 0; i < letter.length - 1; i++) {
            if (letter[i].equals("g") && letter[i + 1].equals("g")) {
                result = true;
            }
            if (i > 0) {
                if (letter[i].equals("g") && letter[i - 1].equals("g")) {
                    result = true;
                }
            }
            }
            return result;
        }


    /**
     * 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 result=0;
        String[] letter = input.split("");
        for(int i=0;i<letter.length-1;i++){
            if(letter[i].equals(letter[i+1]) && letter[i+1].equals(letter[i+2])){
                result++;
            }
        }
        return result;
    }
}