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

#javascript #devchallenge #programming #webdev

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/

Fork this challenge
Write your solution
Test it against the provided test cases
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

Build seamlessly, securely, and flexibly with MongoDB Atlas. Try free.

MongoDB Atlas lets you build and run modern apps in 125+ regions across AWS, Azure, and Google Cloud. Multi-cloud clusters distribute data seamlessly and auto-failover between providers for high availability and flexibility. Start free!

Learn More

Top comments (1)

James Curran • Feb 15

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();