From c7a13c306c58f122223d7c6d7e251bf279392508 Mon Sep 17 00:00:00 2001
From: JHLEE325 <82587652+JHLEE325@users.noreply.github.com>
Date: Wed, 25 Feb 2026 21:49:42 +0900
Subject: [PATCH] =?UTF-8?q?[20260225]=20BOJ=20/=20G5=20/=20=EB=AC=B8?=
 =?UTF-8?q?=EC=9E=90=EC=97=B4=20=EA=B2=8C=EC=9E=84=202=20/=20=EC=9D=B4?=
 =?UTF-8?q?=EC=A4=80=ED=9D=AC?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 ...354\227\264 \352\262\214\354\236\204 2.md" | 47 +++++++++++++++++++
 1 file changed, 47 insertions(+)
 create mode 100644 "JHLEE325/202602/25 BOJ G5 \353\254\270\354\236\220\354\227\264 \352\262\214\354\236\204 2.md"

diff --git "a/JHLEE325/202602/25 BOJ G5 \353\254\270\354\236\220\354\227\264 \352\262\214\354\236\204 2.md" "b/JHLEE325/202602/25 BOJ G5 \353\254\270\354\236\220\354\227\264 \352\262\214\354\236\204 2.md"
new file mode 100644
index 00000000..94e15bf3
--- /dev/null
+++ "b/JHLEE325/202602/25 BOJ G5 \353\254\270\354\236\220\354\227\264 \352\262\214\354\236\204 2.md"	
@@ -0,0 +1,47 @@
+```java
+import java.io.*;
+import java.util.*;
+
+public class Main {
+    public static void main(String[] args) throws IOException {
+        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
+        int T = Integer.parseInt(br.readLine());
+
+        while (T-- > 0) {
+            String W = br.readLine();
+            int K = Integer.parseInt(br.readLine());
+
+            if (K == 1) {
+                System.out.println("1 1");
+                continue;
+            }
+
+            List<Integer>[] pos = new ArrayList[26];
+            for (int i = 0; i < 26; i++) pos[i] = new ArrayList<>();
+
+            for (int i = 0; i < W.length(); i++) {
+                pos[W.charAt(i) - 'a'].add(i);
+            }
+
+            int minLen = Integer.MAX_VALUE;
+            int maxLen = -1;
+
+            for (int i = 0; i < 26; i++) {
+                if (pos[i].size() < K) continue;
+
+                for (int j = 0; j <= pos[i].size() - K; j++) {
+                    int len = pos[i].get(j + K - 1) - pos[i].get(j) + 1;
+                    minLen = Math.min(minLen, len);
+                    maxLen = Math.max(maxLen, len);
+                }
+            }
+
+            if (minLen == Integer.MAX_VALUE) {
+                System.out.println("-1");
+            } else {
+                System.out.println(minLen + " " + maxLen);
+            }
+        }
+    }
+}
+```