---
title: "Discussion on \"Problem: First Missing Positive\" | Hashnode"
description: "Discussion on \"Problem: First Missing Positive\". Given an unsorted integer array nums, return the smallest missing positive integer.\nYou must implement an algorithm that runs in O(n) time and uses constant extra space.\n\nExample 1:\n  Input: nums = [1,2,0]\n  Output: 3\nExample 2:\n   Input: nums = [3,4..."
url: "https://hashnode.com/posts/problem-first-missing-positive/62f34f55408d676b1b58bf7a"
---

[Feed](https://hashnode.com/feed) /

Discussion

# [Problem: First Missing Positive](https://mackph.hashnode.dev/problem-first-missing-positive?utm_source=hashnode&utm_medium=feed)

Given an unsorted integer array nums, return the smallest missing positive integer. You must implement an algorithm that runs in O(n) time and uses constant extra space. Example 1: Input: nums = \[1,2,0\] Output: 3 Example 2: Input: nums = \[3,4...

Aug 10, 2022 · 1 min read · mackph.hashnode.dev  
Read the article

-   [#java](https://hashnode.com/tag/java)
-   [#problem-solving-skills](https://hashnode.com/tag/problem-solving-skills)
-   [#java-programming](https://hashnode.com/tag/java-programming)
-   [#java-language](https://hashnode.com/tag/java-language)

## Written by

[ANKUSH KUMAR](https://hashnode.com/@akankushjnvku)

@akankushjnvku · India

  
[View profile](https://hashnode.com/@akankushjnvku)

I am an intermediate back-end developer, graphic and Adobe designer working for the past few years.

({MERN Stack Developer at mackph}) | <Ex-Internshala Student Partner(ISP 16)> | <5 star coder at Hackerrank> | <Self employed at Mackph> | <GSSoC '22 Contributor> | <Ex-Campus Ambassador at International MUN>

## Responses

Markdown supported · ⌘↵ to post

No responses yet.