---
title: "Discussion on \"LC 41.  First Missing Integer (Hard)\" | Hashnode"
description: "Discussion on \"LC 41.  First Missing Integer (Hard)\". Problem Statement\nGiven an unsorted integer array A, return the smallest missing positive integer.\nYou must implement an algorithm that runs in O(n) time and uses O(1) auxiliary space.  \n\n\nExample 1\nI"
url: "https://hashnode.com/posts/lc-41-first-missing-integer-hard/6a31826a8132161697826237"
---

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

Discussion

# [LC 41. First Missing Integer (Hard)](https://simranbali-dsa.hashnode.dev/lc-41-first-missing-integer-hard?utm_source=hashnode&utm_medium=feed)

Problem Statement Given an unsorted integer array A, return the smallest missing positive integer. You must implement an algorithm that runs in O(n) time and uses O(1) auxiliary space. Example 1 I

Jun 16 · 6 min read · simranbali-dsa.hashnode.dev  
Read the article

-   [#dsa](https://hashnode.com/tag/dsa)
-   [#arrays](https://hashnode.com/tag/arrays)
-   [#java](https://hashnode.com/tag/java)
-   [#data-structures-and-algorithms](https://hashnode.com/tag/data-structures-and-algorithms)

## Written by

[Simran Bali](https://hashnode.com/@simranbali-ace04)

@simranbali-ace04 · Delhi, India

  
[View profile](https://hashnode.com/@simranbali-ace04)

Trying to get 1% better every day

Not an expert, just someone who has restarted more times than I'd like to admit. Learning DSA, building projects, and documenting the journey as I work towards becoming a better engineer.

## Responses 1

Markdown supported · ⌘↵ to post

[Yash Bavadiya](https://hashnode.com/@xevrion)

[Jun 16](https://hashnode.com/posts/lc-41-first-missing-integer-hard/6a31826a8132161697826237/comment/6a318737cc7573f38ff87b48)

Amazing explanation!
