Leetcode-Basic/EqualizeFrequency.java at main · kavya-7777/Leetcode-Basic · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
<<<<<<< HEAD
//2423. Remove Letter To Equalize Frequency

class Solution {
    public boolean equalFrequency(String word) {
        HashMap<Character, Integer> map = new HashMap<>();
        for(char c : word.toCharArray()){
            map.put(c, map.getOrDefault(c, 0) + 1);
        }
        for(char c : word.toCharArray()){
            map.put(c, map.get(c) - 1);
            if(map.get(c) == 0) map.remove(c);
            if(allEqual(map)) return true;
            map.put(c, map.getOrDefault(c, 0) + 1);
        }
        return false;
    }

    public boolean allEqual(HashMap<Character, Integer> map){
        int first = -1;
        for(int freq : map.values()){
            if(first == -1) first = freq;
            else if(first != freq) return false;
        }
        return true;
    }

=======
//2423. Remove Letter To Equalize Frequency

class Solution {
    public boolean equalFrequency(String word) {
        HashMap<Character, Integer> map = new HashMap<>();
        for(char c : word.toCharArray()){
            map.put(c, map.getOrDefault(c, 0) + 1);
        }
        for(char c : word.toCharArray()){
            map.put(c, map.get(c) - 1);
            if(map.get(c) == 0) map.remove(c);
            if(allEqual(map)) return true;
            map.put(c, map.getOrDefault(c, 0) + 1);
        }
        return false;
    }

    public boolean allEqual(HashMap<Character, Integer> map){
        int first = -1;
        for(int freq : map.values()){
            if(first == -1) first = freq;
            else if(first != freq) return false;
        }
        return true;
    }

>>>>>>> be6ce0b427078b1421d5dd74adb2300dc02daeec
}