Daily JavaScript Challenge #JS-100: Find Smallest Missing Positive Integer

Daily JavaScript Challenge: Find Smallest Missing Positive Integer

Hey fellow developers! 👋 Welcome to today's JavaScript coding challenge. Let's keep those programming skills sharp!

The Challenge

Difficulty: Medium

Topic: Array Manipulation

Description

Write a function that finds the smallest positive integer that is missing from an unsorted array of integers. Your function should run with an expected time complexity of O(n).

Ready to Begin?

https://www.dpcdev.com/

1. Fork this challenge
2. Write your solution
3. Test it against the provided test cases
4. Share your approach in the comments below!

Want to Learn More?

Check out the documentation about this topic here: https://leetcode.com/problems/first-missing-positive/

Join the Discussion!

• How did you approach this problem?
• Did you find any interesting edge cases?
• What was your biggest learning from this challenge?

Let's learn together! Drop your thoughts and questions in the comments below. 👇

---

This is part of our Daily JavaScript Challenge series. Follow me for daily programming challenges and let's grow together! 🚀

javascript #programming #coding #dailycodingchallenge #webdev

Comments

[James Curran]

In C#

int[] array = { -1, 4, 2, 1, 9, 10 };

var hash = array.Where(a => a > 0 ).ToHashSet();
Enumerable.Range(1, Int32.MaxValue).First(e => hash.Add(e) ).Dump();