Ad
ivan.ccvs.javier.hd

NumbersVsLetters

You will be given a String which will be composed of different groups of letters and numbers separated by a blank space.

You will have to calculate for each group whether the value of the sum of the letters is greater, equal or less than the multiplication of the numbers. When the values are equal the group will not count towards the final value.

The value of each letter corresponds to its position in the English alphabet so a=1, b=2, c=3 ... x=24, y=25 and z=26. If there are more groups that have a greater numeric value you will return 1. If the alphabetic value is greater for more groups, you will return -1. If the sum of groups that have greater numeric value is equal to the sum of groups that have greater alphabetic value you will return 0.

Example:

("a1b 42c") ->
a1b(lettersValue(1(a)+2(b)=3)>numbersValue(1))->-1(letters win)
42c(lettersValue(3(c))<numbersValue(4*2=8))->1(numbers win)
returns 0 since 1-1=0(draw)

("12345 9812") ->returns 1
("abc def") -> returns -1
("abcdef 12345") ->returns 0 since the first group has a greater letter value and the second group has a greater numeric value
("a1b2c3") ->returns 0 since the sum of the letters (1(a)+2(b)+3(c)) is equal to the multiplication of the numbers (1*2*3)
("z27jk 99sd")->
//z27jk
26('z')+10('j')+11('k')>2*7-> 47>14 -> -1
//99sd
9*9>19('s')+4('d')->81>23->1
//returns
1-1->0
("a1 b3 44e")->returns 0+1+1=2->1(positive number means numbers win)

Notes:

  • There won't be any uppercase letters
  • Special characters such as # or $ do not have any value
  • There might be empty Strings
Code
Diff
  • import java.util.HashMap;
import java.util.Map;
public class NumbersVsLetters{
  
  public static int numbersVsLetters(String str) {
    
	    if (str.isEmpty() || str.isBlank()) return 0;
	    Map<Character, Integer> allChars = fillMap();
	    int score = 0;
	    int numberMultiplication = -1;
	    int characterSum = 0;
	    for (char c : str.toCharArray()) {
	        if (c == ' ') {
	            if (numberMultiplication > 0) score += Integer.compare(numberMultiplication, characterSum);
	            else if (characterSum > 0) score--;
	            numberMultiplication = -1;
	            characterSum = 0;
	        } else if (Character.isDigit(c)) numberMultiplication = Character.getNumericValue(c) * Math.abs(numberMultiplication);
            else if (Character.isAlphabetic(c)) characterSum += allChars.get(c);
	    }
	    if (numberMultiplication > 0) score += Integer.compare(numberMultiplication, characterSum);
	    else if (characterSum > 0) score--;
	    return Integer.compare(score, 0);
	}

	public static Map<Character, Integer> fillMap(){
		Map<Character, Integer> allChars = new HashMap<>();
		for (int i = 0; i < 26; i++) {
			char c = (char) ('a' + i);
		    allChars.put(c, i + 1);
		}
		return allChars;
	}
  
}
    • import java.util.HashMap;
    • import java.util.Map;
    • public class NumbersVsLetters{
    • public static int numbersVsLetters(String str) {
    • if (str.isEmpty() || str.isBlank()) return 0;
    • Map<Character, Integer> allChars = fillMap();
    • int score = 0;
    • int numberMultiplication = -1;
    • int characterSum = 0;
    • for (char c : str.toCharArray()) {
    • if (c == ' ') {
    • if (numberMultiplication > 0) score += Integer.compare(numberMultiplication, characterSum);
    • else if (characterSum > 0) score--;
    • numberMultiplication = -1;
    • characterSum = 0;
    • } else if (Character.isDigit(c)) numberMultiplication = Character.getNumericValue(c) * Math.abs(numberMultiplication);
    • else if (Character.isAlphabetic(c)) characterSum += allChars.get(c);
    • }
    • if (numberMultiplication > 0) score += Integer.compare(numberMultiplication, characterSum);
    • else if (characterSum > 0) score--;
    • return Integer.compare(score, 0);
    • }
    • public static Map<Character, Integer> fillMap(){
    • Map<Character, Integer> allChars = new HashMap<>();
    • for (int i = 0; i < 26; i++) {
    • char c = (char) ('a' + i);
    • allChars.put(c, i + 1);
    • }
    • return allChars;
    • }
    • }
ivan.ccvs.marino.bn

Discover the value

Code
Diff
  • import java.util.HashMap;
import java.util.Map;
public class NumbersVsLetters{
  
  public static int opt2(String s) {
		Map<String, Integer> map = new HashMap<>();
		int result = 0,num=1,letr=0;
		boolean correcto= false;
		for (int i = 0; i < 26; i++) {
			map.put(Character.toString('a' + i), i + 1);
		}

		// map.forEach((a,b)->System.out.println(a+"-"+b));

		String numeros = "", letras = "";
		for (int c = 0; c < s.length(); c++) {
			if (!String.valueOf(s.charAt(c)).equals(" ") && s.length()!=c+1) {
				if (String.valueOf(s.charAt(c)).matches("^\\d$")) {
					//numeros = numeros + s.charAt(c);
					correcto=true;
					num=num*s.charAt(c);
				} else if (String.valueOf(s.charAt(c)).matches("^[a-z]$")) {
					//letras = letras + s.charAt(c);
				}

			} else {
				
				
				correcto=false;
				numeros="";letras="";
			}

		}

		System.out.println(numeros);
		System.out.println(letras);

		return result;
	}
  
  //Segunda opcion a considerar
	public static int numbersVsLetters(String str) {
	    if (str.isEmpty() || str.isBlank()) return 0;
	    Map<Character, Integer> allChars = new HashMap<>();
	    for (int i = 0; i < 26; i++) {
	        char c = (char) ('a' + i);
	        allChars.put(c, i + 1);
	    }
	    int score = 0;
	    int numberMultiplication = 1;
	    int characterSum = 0;
	    boolean hasNumber = false;
	    boolean hasCharacter = false;
	    for (char c : str.toCharArray()) {
	        if (c == ' ') {
	            if (hasNumber) score += Integer.compare(numberMultiplication, characterSum);
	            else if (hasCharacter) score--;
	            numberMultiplication = 1;
	            characterSum = 0;
	            hasNumber = false;
	            hasCharacter = false;
	        } else if (Character.isDigit(c)) {
	            numberMultiplication *= Character.getNumericValue(c);
	            hasNumber = true;
	        } else if (Character.isAlphabetic(c)) {
	            characterSum += allChars.get(c);
	            hasCharacter = true;
	        }
	    }
	    if (hasNumber) score += Integer.compare(numberMultiplication, characterSum);
	    else if (hasCharacter) score--;
	    return Integer.compare(score, 0);
	}
  
}
    • import java.util.HashMap;
    • import java.util.Map;
    • public class DiscoverTheValue{
    • public class NumbersVsLetters{
    • public static int opt2(String s) {
    • Map<String, Integer> map = new HashMap<>();
    • int result = 0,num=1,letr=0;
    • boolean correcto= false;
    • for (int i = 0; i < 26; i++) {
    • map.put(Character.toString('a' + i), i + 1);
    • }
    • // map.forEach((a,b)->System.out.println(a+"-"+b));
    • String numeros = "", letras = "";
    • for (int c = 0; c < s.length(); c++) {
    • if (!String.valueOf(s.charAt(c)).equals(" ") && s.length()!=c+1) {
    • if (String.valueOf(s.charAt(c)).matches("^\\d$")) {
    • //numeros = numeros + s.charAt(c);
    • correcto=true;
    • num=num*s.charAt(c);
    • } else if (String.valueOf(s.charAt(c)).matches("^[a-z]$")) {
    • //letras = letras + s.charAt(c);
    • }
    • } else {
    • correcto=false;
    • numeros="";letras="";
    • }
    • }
    • System.out.println(numeros);
    • System.out.println(letras);
    • return result;
    • }
    • //Segunda opcion a considerar
    • public static int discover(String valor) {
    • if(valor.isEmpty()||valor.isBlank()) return 0;
    • HashMap<String, Integer> values = new HashMap<>();
    • for(int i=0;i<26;i++) {
    • values.put(Character.toString('a'+i), i+1);
    • }
    • boolean hasNumber = false;
    • int score = 0, numberMultiplication = 1, characterSum = 0, stringPosition = 0;
    • while(stringPosition<valor.length()) {
    • boolean firstEmptySpace = true;
    • while(String.valueOf(valor.charAt(stringPosition)).equals(" ") && stringPosition<valor.length()-1) {
    • stringPosition++;
    • if(firstEmptySpace) {
    • firstEmptySpace = false;
    • if(hasNumber)score+=Integer.compare(numberMultiplication, characterSum);
    • else score--;
    • }
    • numberMultiplication =1;
    • characterSum=0;
    • hasNumber=false;
    • }
    • if(Character.isDigit(valor.charAt(stringPosition))) {
    • numberMultiplication*=Character.getNumericValue(valor.charAt(stringPosition));
    • hasNumber = true;
    • }
    • else if(Character.isAlphabetic(valor.charAt(stringPosition))) characterSum+=values.get(String.valueOf(valor.charAt(stringPosition)));
    • if(stringPosition==valor.length()-1) {
    • if(hasNumber)score+=Integer.compare(numberMultiplication, characterSum);
    • else score--;
    • }
    • stringPosition++;
    • }
    • return Integer.compare(score, 0);
    • public static int numbersVsLetters(String str) {
    • if (str.isEmpty() || str.isBlank()) return 0;
    • Map<Character, Integer> allChars = new HashMap<>();
    • for (int i = 0; i < 26; i++) {
    • char c = (char) ('a' + i);
    • allChars.put(c, i + 1);
    • }
    • int score = 0;
    • int numberMultiplication = 1;
    • int characterSum = 0;
    • boolean hasNumber = false;
    • boolean hasCharacter = false;
    • for (char c : str.toCharArray()) {
    • if (c == ' ') {
    • if (hasNumber) score += Integer.compare(numberMultiplication, characterSum);
    • else if (hasCharacter) score--;
    • numberMultiplication = 1;
    • characterSum = 0;
    • hasNumber = false;
    • hasCharacter = false;
    • } else if (Character.isDigit(c)) {
    • numberMultiplication *= Character.getNumericValue(c);
    • hasNumber = true;
    • } else if (Character.isAlphabetic(c)) {
    • characterSum += allChars.get(c);
    • hasCharacter = true;
    • }
    • }
    • if (hasNumber) score += Integer.compare(numberMultiplication, characterSum);
    • else if (hasCharacter) score--;
    • return Integer.compare(score, 0);
    • }
    • }