First missing positive leetcode solution

First missing positive Integer #41 | JavaScript Solution | coding interview question asked by google amazon and Microsoft
leet code
#leetcode #javaScript #interview
Follow me for technology updates
* groups/AlgoAndDSinJavaScript
* techsith1
* / patelhemil
* / techsith

[@sogggy]

Did you have a link to your codepen? The last solution is fails when the input is [3,4,-1,1] on leetcode. Also on the last solution it looks like you have a nested for loop, shouldn't time complexity be O(n^2)?
thank you for all your tutorials

[@Noobmaster69_bro]

your last solution, isn't time complexity there O(n^2) , since u used, one for loop inside the other ? We need O(n) right?

[@saurabhchauhan232]

Thank you !

[@InterviewNest]

You're welcome! Thanks for watching!

[@vishal_sharma_rha]

Thank you sir 🤟

[@InterviewNest]

Welcome 👍

[@himanshubansal6425]

Thank you for posting problem

[@InterviewNest]

Thanks for watching!

[@Tesudzi]

this is so high lever 4 me, thank you syr for sharing your knowledge.
can you give any advises to grow faster in solving problems out of brute force? thanks

[@InterviewNest]

Brute force would be to go from 1 see if its there, and then 2 to see if its there. for the length of the array.

[@viratpatil]

Where is the link of entire series pls ?

[@InterviewNest]

here is the link for the series. more videos to come.. czcams.com/play/PLUunrGF1sBI9dCUOESmb5aU8DQE0vqJ_n.html

[@viratpatil]

@@InterviewNest Thanks Cheerw