a

Author: anishLearnsToCode

Diff for: src/FirstMissingPositive.java

@@ -3,7 +3,7 @@
 // S: O(1)
 
 public class FirstMissingPositive {
-    public static int firstMissingPositive(int[] nums) {
+    public int firstMissingPositive(int[] nums) {
         int n = nums.length;
 
         // Use cycle sort to place positive elements smaller than n at the correct index
@@ -32,8 +32,4 @@ private static void swap(int[] nums, int i, int j) {
         nums[i] = nums[j];
         nums[j] = temp;
     }
-
-    public static void main(String[] args) {
-        System.out.println(firstMissingPositive(new int[] {3, 4, -1, 1}));
-    }
 }