Practice Real Company Assessment Patterns • Latest 2025–2026 Mock Tests

Programming Exercises

Implement a function to find the smallest positive integer missing from an unsorted array

Hard

Problem Statement

Implement a function to find the smallest positive integer missing from an unsorted array

Sample Input

[3, 4, -1, 1]

Sample Output

2

Limits

Time: 2s · Memory: 256 MB

Code Editor
00:00
import java.util.*; public class Main { public static int firstMissingPositive() { int[] nums = {3, 4, -1, 1}; // Your code here return 0; } }
Log in or sign up to run or submit your code.Log inSign up
Input
[3, 4, -1, 1]
Expected Output
2