_1817.java

packagecom.fishercoder.solutions.secondthousand;

importjava.util.HashMap;
importjava.util.HashSet;
importjava.util.Map;
importjava.util.Set;
importjava.util.TreeMap;

publicclass_1817 {
publicstaticclassSolution1 {
publicint[] findingUsersActiveMinutes(int[][] logs, intk) {
Map<Integer, Set<Integer>> map = newHashMap<>();
for (int[] log : logs) {
intuser = log[0];
if (!map.containsKey(user)) {
map.put(user, newHashSet<>());
 }
Set<Integer> set = map.get(user);
set.add(log[1]);
 }
int[] result = newint[k];
TreeMap<Integer, Integer> treeMap = newTreeMap<>();
for (intkey : map.keySet()) {
intuam = map.get(key).size();
treeMap.put(uam, treeMap.getOrDefault(uam, 0) + 1);
 }
for (intkey : treeMap.keySet()) {
result[key - 1] = treeMap.get(key);
 }
returnresult;
 }
 }
}