Share runnable code, everywhere. 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
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
// { autofold
import java.io.*;
import java.lang.annotation.*;
import java.lang.instrument.*;
import java.lang.invoke.*;
import java.lang.management.*;
import java.lang.ref.*;
import java.lang.reflect.*;
import java.math.*;
import java.net.*;
import java.nio.*;
import java.nio.channels.*;
import java.nio.channels.spi.*;
import java.nio.charset.*;
import java.nio.charset.spi.*;
import java.nio.file.*;
import java.nio.file.attribute.*;
import java.nio.file.spi.*;
import java.text.*;
import java.text.spi.*;
import java.util.*;
import java.util.concurrent.*;
import java.util.concurrent.atomic.*;
import java.util.concurrent.locks.*;
import java.util.jar.*;
import java.util.logging.*;
import java.util.prefs.*;
import java.util.regex.*;
import java.util.spi.*;
import java.util.zip.*;
//}
public class Main {
public int getSum(int n) {
int sum=0;
while(n>0)
{
sum += n%10;
n/=10;
}
return sum;
}
public int countLargestGroup(int n1) {
HashMap<Integer, Integer> map = new HashMap<>();
for(int i=1; i<=n1; i++)
{
if(i<10)
map.put(i, 1);
else
{
int n = getSum(i);
if(map.containsKey(n))
{
int temp = map.get(n);
map.put(n, temp+1);
}
else
{
map.put(n, 1);
}
}
}
int max=Integer.MIN_VALUE;
int num=0;
for(int n : map.values())
{
if(n>max)
{
max=n;
num=1;
}
else if(n==max)
num++;
}
return num;
}
public static void main (String[] args) {
// Write your code here.
// Click on "RUN" to execute it.
System.out.println("Hello World!");
}
}