Grokking Microsoft Coding Interview

0% completed

​
Hidden Document
Hidden Document Content Hidden Document Content Hidden Document Content Hidden Document Content Hidden Document Content Hidden Document Content Hidden Document Content Hidden Document Content Hidden Document Content Hidden Document Content Hidden Document Content Hidden Document Content Hidden Document Content Hidden Document Content Hidden Document Content Hidden Document Content Hidden Document Content Hidden Document Content Hidden Document Content Hidden Document Content Hidden Document Content Hidden Document Content Hidden Document Content Hidden Document Content

.....

.....

.....

Like the course? Get enrolled and start learning!
D

Davide Pugliese

· 2 years ago

         TreeMap<Integer, Integer> map = new TreeMap<>((a, b) -> b - a);

        for (int i = 0; i < num.length(); i++) {
            var key = num.charAt(i) - '0';
             System.out.println("Key above is: " + key);
            map.put(key, map.getOrDefault(key, 0) + 1);
        }

        boolean odd = false;
        int k = -1;
        Deque<Character> stack = new ArrayDeque<>();
        Deque<Character> queue = new ArrayDeque<>();
        
        for (var entry: map.entrySet()) {
             var key = entry.getKey(); 
            for (int i = 0; i < entry.getValue() / 2; i++) {
                    queue.offer((char)(key + (int)'0'));
            } 
            if (entry.getValue() % 2 == 1 && odd == false) {
                
                k = key;
M

mailman14736

· 2 months ago

Your implementation of the solution checker is wrong.....

input: "00001" gives Expected: "0" when it clearly should be Expected "1".

Oddly enough, the example code in your solution page correctly outputs "1"