First Missing Positive Leetcode
ฝัง
- เผยแพร่เมื่อ 23 มิ.ย. 2022
- Leetcode 41, Leetcode 41., First Missing Positive, First Missing Positive Leetcode Java, Leetcode Java Solution, Leetcode Java, First Missing Positive leetcode java solution, Leetcode 41 First Missing Positive, Leetcode 41. First Missing Positive, FAANG interview questions, coding interview preparation,
#Leetcode, #LeetcodeJAVA, #LeetcodeJAVASolutions, #Leetcode41
Connect with me on Facebook : / pratikshabakrola
Subscribe to my channel: / @pratikshabakrola
Useful!❤
This is Video, hard question and understood in 3 mins. Great explaination.😊😊😊
Thank you!
They requested to solve it with O(n) but your are sorting the array so your solution is O(nlogn). Am I missing somthing?
No see must be wrong
Yes, exactly!
Nice😊😊😊
Thanks 😊
ma'am don't need not to be sorted to the NlogN be not needed question proper read
Solution is pretty much cool, but I think O(n) time complexity solution must also be addressed in the video.
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
@@pratikshabakrola
Approach 1:-
class Solution {
public:
int firstMissingPositive(vector& nums) {
int i,number=1;
sort(nums.begin(),nums.end());
for(i=0;i
@@pratikshabakrola😅
pretty awesome solution
Thank you Swaraj 🙏🏼
Have a nice day.
Hello Van,
Nice to hear from you.
You too have a good day and a happy weekend !
Wow solutiion....make some more videos
Hello Chetanya,
Will make more videos soon!
mam, can you make video for other leetcode problems.
Hi,
Thank you for expressing the interest. If leetcode videos receive more response, I will make more videos on that.
your solution is running in nlogn time. its not the expected solution
I don't think it was hard 🙂
glad you think so!