Hiring process8 levels
  1. 1 IQ Test
  2. 2 Additional Online Test (If Required)
  3. 3 Office Interview with Hiring Manager
  4. 4 Unpaid Test Task (Motivation Check)
  5. 5 Paid Test Task and Follow-Up Interview
  6. 6 Iterative Paid Test Tasks
  7. 7 Office Verification
  8. 8 Final Interview with the Founder

Problems > Favourite Bigram

Favourite Bigram

Difficulty: 1200 3000 ms 128 MB

strings

Print the most frequent two-character substring (bigram); ties break lexicographically.

Input: one line with a lowercase string of length ≥ 2.

Output: the winning bigram.

Constraints:

  • 2 ≤ |S| ≤ 105

Sample Tests

Input 1
ababab
Output 1
ab
Input 2
aabb
Output 2
aa

Read the Editorial Statistics

Discussion (opens after you solve — no spoilers before)

No comments yet.

Submit Your Solution

Log in or create a free account to run and submit code.
Ctrl+Enter submit · Ctrl+Space autocomplete · F11 fullscreen