diff --git "a/LiiNi-coder/202510/08 PGM \354\227\260\354\206\215\353\220\234 \353\266\200\353\266\204 \354\210\230\354\227\264\354\235\230 \355\225\251.md" "b/LiiNi-coder/202510/08 PGM \354\227\260\354\206\215\353\220\234 \353\266\200\353\266\204 \354\210\230\354\227\264\354\235\230 \355\225\251.md"
new file mode 100644
index 00000000..ab0df25b
--- /dev/null
+++ "b/LiiNi-coder/202510/08 PGM \354\227\260\354\206\215\353\220\234 \353\266\200\353\266\204 \354\210\230\354\227\264\354\235\230 \355\225\251.md"	
@@ -0,0 +1,33 @@
+```java
+import java.util.*;
+
+class Solution {
+    public int[] solution(int[] sequence, int k) {
+        int[] answer = {-1, -1};
+        int l = 0, r = 0, sum = 0;
+        Deque<Integer> q = new ArrayDeque<>();
+        while(r <= sequence.length){
+            if(sum == k){
+                if(answer[0] == -1 || (r - l - 1) < (answer[1] - answer[0])){
+                    answer[0] = l;
+                    answer[1] = r -1;
+                }
+            }
+            
+            
+            if(sum >= k){
+                sum -= q.poll();
+                l++;
+            }else{
+                if(r == sequence.length)
+                    break;
+                sum += sequence[r];
+                q.add(sequence[r]);
+                r++;
+            }
+        }
+        return answer;
+    }
+}
+
+```