Array - 50: Find first missing positive number in given array

[@amangupta4202]

I saw 2-3 videos of this particular question but still was not able to understand this. Your video explains it all. Thank you.

[@CodingSimplified]

Thanks for your nice feedback. Keep Watching.

[@vaibhavjaiswal7811]

Can't believe this video has such less views. This is better than the Aman Dhattarwal's one. Sir, just please uploading these videos.

[@CodingSimplified]

Thanks for your nice feedback. Keep Watching.

[@abhishekjaiswal6492]

best explanation than others

[@CodingSimplified]

Thanks for your nice feedback. Keep Watching.

[@rafatparvren9249]

Your's explanation level is superbbbbb🔥

[@CodingSimplified]

Thanks Rafat for your feedback. Keep Watching.

[@opmishra8336]

simple and clear explained!

[@CodingSimplified]

Thanks for your nice feedback. Keep Watching.

[@codecrafts5263]

I have an approach. Let's make a set of all positive numbers present in given array. Then iterate a new loop. In the loop, if any consecutive number doesn't match, break it. The point where it was broken, the value of i is the answer

[@shanukatiyar2742]

i was thinking same thing

[@codecrafts5263]

@@shanukatiyar2742 yes it's a nice one

[@ridimamittal4064]

THANK YOU SOOO MUCH ! :)

[@CodingSimplified]

Glad you liked it. Keep Watching.

[@manikantasai6118]

@@CodingSimplified Andhariki oke reply icchi ammayi kanapadagaane marchesaavu .

[@bharathKumar-or6gd]

Great explanation , superbb

[@shouvikdatta6831]

Why did you you use "else i++ "?
Can I write directly i++? Inside the while loop...

[@seraj_valley]

alwys love ur lectures sir ,,you

[@CodingSimplified]

Thanks for your nice feedback. Keep Watching.

[@shyguy6424]

I couldn't understand the time complexity. Are you sure its O(n). It would be great help if you can explain the complexity part in details. In your example the loop runs 10 times even though you have only 7 elements. Could it happen that the loops runs about n*n times ? In an array where every elements have to swipe multiple times?

[@ajaykumarcheekati7562]

Its not n*n, it’s n + n = 2n which is o(n)

[@divyanshsingh6163]

sir why didnt you code this in nLOGn?That is faster than O(n)?

[@CodingSimplified]

O(n*logn) is slower than O(n). Hope it helps you. Thanks.

[@rajeshvenkatraman7805]

what if the array is [ 100,900,-100,120] like this?

[@jameysiddiqui6910]

great explanation

[@CodingSimplified]

Thanks for your nice feedback. Keep Watching.

[@ujjwaltarika9469]

Thank you!!

[@CodingSimplified]

Thanks for your nice feedback. Keep watching.

[@piratekingamv9991]

Bruhhh sooo good

[@CodingSimplified]

Thanks for your nice feedback. Keep Watching.

[@surajrao4792]

but it is giving TLE sir for this method

[@Everdonebruhhhhhhhhhhhhhhhhhh]

what if array contains 0

[@snehavedpathak3573]

+1 subscriber

[@Khabibullah]

Suup!!!

[@CodingSimplified]

Thanks for your nice feedback. Keep Watching.

[@sankethkharvi6155]

u lost me at 6.45

[@ronanhughes891]

I tell you what, you programmers are clever as fuck but by Jesus can you not simply explain anything without throwing in random numbers for no reason or other answers to other questions that aren’t anything to do with the question in mind 😂