From f8c56dd831f9943c257bbe067c6ce105647cd483 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?=EC=97=BC=ED=98=9C=EC=A0=95?=
 <122238744+cyzlcyzl@users.noreply.github.com>
Date: Tue, 1 Sep 2026 22:43:29 +0900
Subject: [PATCH 1/2] Create 3833. Count Dominant Indices.java

---
 .../3833. Count Dominant Indices.java"        | 19 +++++++++++++++++++
 1 file changed, 19 insertions(+)
 create mode 100644 "leetcode3/\354\227\274\355\230\234\354\240\225/3833. Count Dominant Indices.java"

diff --git "a/leetcode3/\354\227\274\355\230\234\354\240\225/3833. Count Dominant Indices.java" "b/leetcode3/\354\227\274\355\230\234\354\240\225/3833. Count Dominant Indices.java"
new file mode 100644
index 00000000..dc257113
--- /dev/null
+++ "b/leetcode3/\354\227\274\355\230\234\354\240\225/3833. Count Dominant Indices.java"	
@@ -0,0 +1,19 @@
+// nums[0] ~ nums[length -1] 합으로 평균을 구함
+// O(n)
+
+class Solution {
+    public int dominantIndices(int[] nums) {
+        if (nums.length == 1) return 0;
+
+        int sum = 0;
+        for (int i = 0; i<nums.length; i++) sum += nums[i];
+
+        int cnt = 0;
+        for (int i = 0; i<nums.length-1; i++) {
+            sum -= nums[i];
+            float avg = sum / (nums.length - i - 1);
+            if (nums[i] > avg) cnt++;
+        }
+        return cnt;
+    }
+}

From f1f6cfbe20b2db14b1161a1c5fa24e09822b1602 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?=EC=97=BC=ED=98=9C=EC=A0=95?=
 <122238744+cyzlcyzl@users.noreply.github.com>
Date: Tue, 1 Sep 2026 22:44:23 +0900
Subject: [PATCH 2/2] Create 877. Stone Game.java

---
 .../877. Stone Game.java"                                    | 5 +++++
 1 file changed, 5 insertions(+)
 create mode 100644 "leetcode3/\354\227\274\355\230\234\354\240\225/877. Stone Game.java"

diff --git "a/leetcode3/\354\227\274\355\230\234\354\240\225/877. Stone Game.java" "b/leetcode3/\354\227\274\355\230\234\354\240\225/877. Stone Game.java"
new file mode 100644
index 00000000..f50c98f7
--- /dev/null
+++ "b/leetcode3/\354\227\274\355\230\234\354\240\225/877. Stone Game.java"	
@@ -0,0 +1,5 @@
+class Solution {
+    public boolean stoneGame(int[] piles) {
+        return true;
+    }
+}