Problem
Given an array and Q queries, each query is two integers L, R (0-based, inclusive). For each query, print the most frequent number in the range [L, R]. If tie, print the smallest one.
Input format
Input
input.txt
- The first line contains N and Q (1 ≤ N ≤ 100, 1 ≤ Q ≤ 20). - The second line contains N integers. - The next Q lines: two integers L and R.
Output format
Output
output.txt
- Q lines: most frequent number in each query.
Example
input
6 2 1 2 2 3 1 2 0 3 2 5
output
2 2
💬 Discussion
Loading...💬
No comments yet. Be the first to start the discussion!
💻 No output yet.
Click Run in the editor to execute your code with the custom input.
Sample cases (from the problem)
Sample Case 1
Input
6 2 1 2 2 3 1 2 0 3 2 5
Expected output
2 2
Solve it your way first
Community solutions unlock after you submit a passing solution. Don't peek.
Ready to solve this challenge?
Create a free account to write code, submit solutions, and track your progress.
⌨️ Keyboard Shortcuts
Code Editor
Run Code
Ctrl
Enter
Submit Code
Ctrl
Shift
Enter
Format Code
Shift
Alt
F
Toggle Comment
Ctrl
/
Undo
Ctrl
Z
Redo
Ctrl
Y
Navigation
Global Search
/
Show Shortcuts
?
Close Modal
Esc