diff --git a/solution/1500-1599/1535.Find the Winner of an Array Game/solution.cs b/solution/1500-1599/1535.Find the Winner of an Array Game/solution.cs
deleted file mode 100644
index 8f495550493d3..0000000000000
--- a/solution/1500-1599/1535.Find the Winner of an Array Game/solution.cs	
+++ /dev/null
@@ -1,17 +0,0 @@
-public class Solution {
-    public int GetWinner(int[] arr, int k) {
-        int maxElement = arr[0], count = 0;
-        for (int i = 1; i < arr.Length; i++) {
-            if (maxElement < arr[i]) {
-                maxElement = arr[i];
-                count = 1;
-            } else {
-                count++;
-            }
-            if (count == k) {
-                break;
-            }
-        }
-        return maxElement;
-    }
-}
diff --git a/solution/2300-2399/2389.Longest Subsequence With Limited Sum/solution.cs b/solution/2300-2399/2389.Longest Subsequence With Limited Sum/solution.cs
deleted file mode 100644
index 17a35674faffb..0000000000000
--- a/solution/2300-2399/2389.Longest Subsequence With Limited Sum/solution.cs	
+++ /dev/null
@@ -1,22 +0,0 @@
-public class Solution {
-    public int[] AnswerQueries(int[] nums, int[] queries) {
-        int[] result = new int[queries.Length];
-        Array.Sort(nums);
-        for (int i = 0; i < queries.Length; i++) {
-            result[i] = getSubsequent(nums, queries[i]);
-        }
-        return result;
-
-    }
-
-    public int getSubsequent(int[] nums,int query) {
-        int sum = 0;
-        for (int i = 0; i < nums.Length; i++) {
-            sum += nums[i];
-            if (sum > query) {
-                return i;
-            }
-        }
-        return nums.Length;
-    }
-}