Leetcode - First Missing Positive (Python)

Показать описание

September 2020 Leetcode Challenge
Leetcode - First Missing Positive

Timothy H Chang

Рекомендации по теме

Комментарии

Watching you build upon the previous solutions is what makes the "optimal" solution much easier to be understood. There's another approach that multiplies the "seen" numbers by -1 instead of adding the modulo.
Thank you for your videos!

A beauty of this solution is using -1 index which is specific and perfect for Python!

lianghe

Thanks for the nice solution! I have a question about it. Based on the desc of the problem, nums[I] could go as high 2^32-1. So if adding those numbers with N, it would go beyond the MAX integer for many other languages such as Java. I know it is not an issue with Python, but would it still add storage (numbers from 32 bits to 64 bits), thus the memory complexity becomes o(N)?

lianghe

thanks tim! really appreciate the explanation for the O(1) space! i was wondering if a solution like this is still 0(1) space:

if not nums:
return 1
nums = [num for num in nums if num > 0]
nums = set(nums)
if not nums:
return 1

candidate = 1
while candidate <= max(nums) + 1:
if candidate not in nums:
return candidate
candidate += 1
return candidate

i mean i have to fiddle with the first allocation of nums first. but the extra candidate vars is still technically constant?

janmichaelaustria

The last solution is so sneaky, its brilliant!

samarthasthana

Please do videos explaining different search algorithms

danielshea

how quickly did u derive the solution urself?

qazaqempire

If you include the question number you'd get better SEO as people copy and paste the whole question title into youtube

oooo-rcyf

There is a bug in you last solution : if nums[i] > 0: check should be : if nums[i]%N > 0:

laofengs

what the fuck? How am i supposed to come up with this in the interview bruv?

rosefromdead

Leetcode - First Missing Positive (Python)

First Missing Positive - Leetcode 41 - Python

Leetcode - First Missing Positive (Python)

Leetcode | 41. First Missing Positive | Hard | Java Solution

First Missing Positive Leetcode

Amazon Coding Interview Question - First Missing Positive (LeetCode)

FIRST MISSING POSITIVE | LEETCODE # 41 | PYTHON SOLUTION

First Missing Positive | LeetCode 41 | C++, Java, Python | BITWISE operation

First Missing Positive - Leetcode 41 - Java

(Old) Leetcode 41 - Arrays | First Missing Positive

First Missing Positive | In Depth Intuition | Clean Code | Leetcode 41 | codestorywithMIK

first missing positive | first missing positive leetcode | leetcode 41 | array

First Missing Positive Python Solution - LeetCode #41

LeetCode 41. First Missing Positive

Leetcode 41 First Missing Positive (Java)

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

41. First Missing Positive Python LeetCode Solution #leetcode #python #codingproblems #coding

BS-16. Kth Missing Positive Number | Maths + Binary Search

(Remade) First Missing Positive | Arrays | Leetcode 41

41. First Missing Positive | leetcode daily challenge | DSA | Shashwat Tiwari Hindi

First Missing Positive Leetcode Solution | Python

First Missing Integer Interviewbit solution | First Missing Positive Leetcode Solution

#41: First Missing Positive - LeetCode Solutions

Find the First Missing Positive Int | Hard Interview Question on LeetCode

First missing positive leetcode solution