Longest Substring K Distinct HARD Strings Sorting Searching 50 XP 0 solved

Problem

Given an array and K, find the length of the longest contiguous subarray with at most K distinct numbers.

Input format

Input input.txt

- The first line contains N and K (1 ≀ N ≀ 100, 1 ≀ K ≀ N). - The second line contains N integers.

Output format

Output output.txt

- The maximal length.

Example

input
7 2
1 2 1 2 3 2 2
output
4

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

πŸ” Interactive Debugger

0 / 0

Analyzing your code...

πŸ“¦ Variables

No variables yet

πŸ“š Call Stack
main() line 1
πŸ“€ Output
We use cookies

Essential cookies are always active. You can choose to enable preference and analytics cookies. Learn more