개발이 하고 싶어요

#22 Fat Fingers

Freddy has a really fat left pinky finger, and every time Freddy tries to type an A, he accidentally hits the CapsLock key!

Given a string that Freddy wants to type, emulate the keyboard misses where each A supposedly pressed is replaced with CapsLock, and return the string that Freddy actually types. It doesn't matter if the A in the string is capitalized or not. When CapsLock is enabled, capitalization is reversed, but punctuation is not affected.

Examples:

"The quick brown fox jumps over the lazy dog."

-> "The quick brown fox jumps over the lZY DOG."

"The end of the institution, maintenance, and administration of government, is to secure the existence of the body politic, to protect it, and to furnish the individuals who compose it with the power of enjoying in safety and tranquillity their natural rights, and the blessings of life: and whenever these great objects are not obtained, the people have a right to alter the government, and to take measures necessary for their safety, prosperity and happiness."

-> "The end of the institution, mINTENnce, ND dministrTION OF GOVERNMENT, IS TO SECURE THE EXISTENCE OF THE BODY POLITIC, TO PROTECT IT, nd to furnish the individuLS WHO COMPOSE IT WITH THE POWER OF ENJOYING IN Sfety ND TRnquillity their nTURl rights, ND THE BLESSINGS OF LIFE: nd whenever these greT OBJECTS re not obtINED, THE PEOPLE Hve  RIGHT TO lter the government, ND TO Tke meSURES NECESSry for their sFETY, PROSPERITY nd hPPINESS."

"aAaaaaAaaaAAaAa"

-> ""

If the given string is null, return null.

If the given string is "", the answer should be evident.

Happy coding!

public class Kata {
    public static String fatFingers(String str) {
      if (str == null) return null;
    
      boolean capsLock = false;
      char[] chars     = str.toCharArray();

      for (int i = 0; i < chars.length; i++) {
        char c = chars[i];
        if (c == 'A' || c == 'a') {
          capsLock = capsLock ? false : true;
        } 
        else if (capsLock) {
          if (Character.isUpperCase(c))
              chars[i] = Character.toLowerCase(c);
          else if (Character.isLowerCase(c))
              chars[i] = Character.toUpperCase(c);
        }
      }
      
      String result = new String(chars);
             result = result.replaceAll("[Aa]","");
      
      return result;
    }
}

# Scramblies

Complete the function scramble(str1, str2) that returns true if a portion of str1 characters can be rearranged to match str2, otherwise returns false.

Notes:

Only lower case letters will be used (a-z). No punctuation or digits will be included.

Performance needs to be considered

Examples

scramble('rkqodlw', 'world') ==> True

scramble('cedewaraaossoqqyt', 'codewars') ==> True

scramble('katas', 'steak') ==> False

public class Scramblies {
    
    public static boolean scramble(String str1, String str2) {
        // your code
    		List<Character> chars1 = str1.chars().mapToObj(e->(char)e).collect(Collectors.toList());
    		List<Character> chars2 = str2.chars().mapToObj(e->(char)e).collect(Collectors.toList());
    		for (Character character : chars2) {
    			if(!chars1.contains(character))
    				return false;
    			chars1.remove(character);
    		}
    		return true;
    } 
}

#Calculate String Rotation

Write a function that receives two strings and returns n, where n is equal to the number of characters we should shift the first string forward to match the second.

For instance, take the strings "fatigue" and "tiguefa". In this case, the first string has been rotated 5 characters forward to produce the second string, so 5 would be returned.

If the second string isn't a valid rotation of the first string, the method returns -1.

Examples:

"coffee", "eecoff" => 2

"eecoff", "coffee" => 4

"moose", "Moose" => -1

"isn't", "'tisn" => 2

"Esham", "Esham" => 0

"dog", "god" => -1

public class CalculateRotation {
  static int shiftedDiff(String first, String second){
    for(int i=0; i< second.length(); i++){
        if(second.equals(first))
            return i;
        second = second.substring(1)+second.charAt(0);
    }
    return -1;
  }
}

public class CalculateRotation {
  static int shiftedDiff(String first, String second){
    if(first.length() !=  second.length())
      return -1;
    return (second+second).indexOf(first);
  }
}