First Missing Positive | Leet code 41 | Theory explained + Python code

This video is a solution to Leet code 41, First Missing Positive. I explain the question, go over how the logic / theory behind solving the question and finally solve it using Python code.
Comment below if you have a better solution to this problem!
Let me know if you have any feedback and don't forget to subscribe for more videos!
Code: leetcode.com/problems/first-m...)
More leetcode questions solved:
• Add and Search Word - ...
Timestamps:
0:00 Question
1:21 Solution Explained
11:05 Python Code
Gear used:
Mic: amzn.to/3awi3b6
Drawing pad: amzn.to/2O7PaaU

[@shihengguan684]

can someone explain to me why we need the abs() function? I thought the first loop will give us all positive values?

[@mhalton]

He confused the whole thing even more than it was!

[@whitewolf8637]

Perfectly Done

[@saianishmalla2646]

Thank you!

[@nawendusingh2858]

Thanks and keep up the good work

[@ishayadav5221]

Great work!

[@saianishmalla2646]

Thanks!

[@mrcodercodes7684]

Keep It up Will help a Lot of Coder

[@saianishmalla2646]

Thanks and will do !

[@user-id4cx1gw5f]

Hey man! Great job on the video, definitely see the pattern of converting the positive to negative numbers in previous questions. I have a question about the cleaning up part, why do we set it to the max positive number, is it possible to also set it to just the value 1?
Thank you!

[@mrcodercodes7684]

Anish Bro i made a pull request on GitHub and tried making your readme file more attractive . pls accept it

[@saianishmalla2646]

I'll check it out :)