forked from krishna14kant/Data-Structures-
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy path977B.cpp
37 lines (36 loc) · 853 Bytes
/
977B.cpp
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
//🎃🎃🎃😎😎😁🤓☣☣☣☣☣dark_coder☣☣☣☣☣😎😎😁🤓🎃🎃🎃
#include <bits/stdc++.h>
using namespace std;
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define all(x) (x).begin(), (x).end()
#define li long long int
#define pi pair<int, int>
int main()
{
IOS
string s;
int n;
cin >> n >> s;
int mx = -1, nt=0;
char f[2]={s[0],s[1]};
for (int i = 0; i < n; i++)
{
nt = 0;
for (int j = i + 1; j < n; j++)
{
if (s[i] == s[j] && s[i + 1] == s[j + 1])
nt++;
}
if (nt > mx)
{
mx = nt;
f[0]=s[i];
f[1]=s[i + 1];
}
}
cout<<f[0]<<f[1];
return 0;
}