We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
  1. Prepare
  2. Algorithms
  3. Strings
  4. Weighted Uniform Strings
  5. Discussions

Weighted Uniform Strings

  • jasanign
     + 1 comment

    same here. I was using arraylist too. Instead of using HashSet, after taking a look at editorial, I figured out I could have replaced hashmap with hashset.

    import java.util.*;

public class Solution {

    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        //ArrayList<Integer> posW = new ArrayList<>();
        Map<Integer, Integer> posW = new HashMap<>();
        /**
        Map<Character, Integer> allW = new HashMap<>();
        int counter = 0;
        for(char i = 'a'; i <= 'z'; i++){
            allW.put(i, ++counter);
        }
        */
        String s = in.next();
        for(int i = 0; i < s.length();i++){
            char temp = s.charAt(i);
            int counter = 1;
            posW.put((temp-96) * counter, 0);
            while(i+1 < s.length() && temp == s.charAt(i+1)){
                i++;
                counter++;
                posW.put((temp-96) * counter,0);
            }
        }
        /*
        for(int i = 0; i < posW.size(); i++){
            System.out.print(posW.get(i)+", ");
        }
        System.out.println();
        */
        int n = in.nextInt();
        for(int a0 = 0; a0 < n; a0++){
            int x = in.nextInt();
            if(posW.containsKey(x)){
                System.out.println("Yes");
            } else {
                System.out.println("No");
            }
        }
    }
}