From cc3f81a95bbc2bdc9de2af0d8e844e4d3f6573a4 Mon Sep 17 00:00:00 2001
From: Vedeesh Dwivedi <vedeesh6@gmail.com>
Date: Tue, 21 Oct 2025 12:38:35 +0530
Subject: [PATCH] Add LC_smallestmissnonnegintafterop class

---
 .../LC_smallestmissnonnegintafterop.java      | 31 +++++++++++++++++++
 1 file changed, 31 insertions(+)
 create mode 100644 src/test/java/LeetCode/Smallest_Missing_Non-negative_Integer_After_Operations/LC_smallestmissnonnegintafterop.java

diff --git a/src/test/java/LeetCode/Smallest_Missing_Non-negative_Integer_After_Operations/LC_smallestmissnonnegintafterop.java b/src/test/java/LeetCode/Smallest_Missing_Non-negative_Integer_After_Operations/LC_smallestmissnonnegintafterop.java
new file mode 100644
index 00000000..dfa8d5e7
--- /dev/null
+++ b/src/test/java/LeetCode/Smallest_Missing_Non-negative_Integer_After_Operations/LC_smallestmissnonnegintafterop.java
@@ -0,0 +1,31 @@
+class LC_smallestmissnonnegintafterop {
+    public int findSmallestInteger(int[] nums, int value) {
+        int[] modularDivisionRes = new int[value];
+        for (int n : nums) {
+            int modDivValue = n % value;
+            if (modDivValue < 0) {
+                modDivValue += value;
+            }
+            modularDivisionRes[modDivValue]++;
+        }
+
+        int min = modularDivisionRes[0];
+        int position = 0;
+        for (int i = 0; i < value; i++) {
+            if (modularDivisionRes[i] < min) {
+                position = i;
+                min = modularDivisionRes[i];
+            }
+        }
+        return value * min + position;
+    }
+
+    static {
+        LC_smallestmissnonnegintafterop s = new LC_smallestmissnonnegintafterop();
+        int[] arr = new int[1];
+        for (int i = 0; i < 250; i++){
+            s.findSmallestInteger(arr, 1);
+        }
+
+    }
+}