First Missing Positive Leetcode

[@ChenMosh]

your solution is running in nlogn time. its not the expected solution

[@oded6188]

They requested to solve it with O(n) but your are sorting the array so your solution is O(nlogn). Am I missing somthing?

[@harshitkumar8988]

No see must be wrong

[@mhamadfawaz4677]

Yes, exactly!

[@sahilsaifi4962]

This is Video, hard question and understood in 3 mins. Great explaination.😊😊😊

[@pratikshabakrola]

Thank you!

[@unemployedbro]

@@pratikshabakrola need to solve o(n)

[@sonasrimu4520]

Useful!❤

[@nitin_kaushik16]

Solution is pretty much cool, but I think O(n) time complexity solution must also be addressed in the video.

[@pratikshabakrola]

Hello Nitin, Thank you for pointing that out. If you would like to share anything on that, please add it in the comments here. I highly appreciate it. Thank you

[@nitin_kaushik16]

@@pratikshabakrola Approach 1:- class Solution { public: int firstMissingPositive(vector& nums) { int i,number=1; sort(nums.begin(),nums.end()); for(i=0;i

[@India_68]

​@@pratikshabakrola😅

[@India_68]

Nice😊😊😊

[@pratikshabakrola]

Thanks 😊

[@abishekb4968]

Thanku

[@vanvothe4817]

Have a nice day.

[@pratikshabakrola]

Hello Van, Nice to hear from you. You too have a good day and a happy weekend !

[@jacobblack2544]

ma'am don't need not to be sorted to the NlogN be not needed question proper read

[@sandeepmishra6478]

I was just watching you only😄😄

[@rutikbodkeacademy1247]

mam, can you make video for other leetcode problems.

[@pratikshabakrola]

Hi, Thank you for expressing the interest. If leetcode videos receive more response, I will make more videos on that.

[@swaraj7710]

pretty awesome solution

[@pratikshabakrola]

Thank you Swaraj 🙏🏼

[@chetanyapratapsingh7068]

Wow solutiion....make some more videos

[@pratikshabakrola]

Hello Chetanya, Will make more videos soon!

[@RajChauhan-iu3dc]

I don't think it was hard 🙂

[@pratikshabakrola]

glad you think so!