(Old) Leetcode 41 - Arrays | First Missing Positive

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

Topic: Arrays

Code:

Leetcode:

*Note* I claim no rights to this question. All rights belong to Leetcode. If I'm reviewing a solution that was from another Leetcode user or Leetcode itself I will give credit below.

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

Комментарии

I remade this video to explain it better

NideeshTerapalli

you should be a lot clearer on why we do something if we do so... you are in a hurry.. thanks

nareshnepal

bhai thoda aur explain krke btao, , , , kis chij ka jldi h

anshukumar

Hey Nideesh. I don't get one thing: You encounter 3, and you change the sign of arr[3] to negative. What if there already is some value at arr[3] which you needed to process?

mihirtrivedi

I think the last step where a[0]>0 return n+1; is invalid it should be a[0]>0 return we are setting a[0]=-a[0] when (a[i]==n) which means the nth number is present in the given after traversing this=> for(i=1 ; i<n ; i++) {
if(a[i]>0) return i;
}
if(a[0]>0) return n;
else return n+1;

if I'm wrong please correct me!
btw thanks for this video (^_^)

nayanthulkar

I closed the tab at 0:17 "The answer that they want us to return is actually the index of the array which has the first non negative number after we are done processing... "

You don't even know what the output should be.

duedares

Hi Nideesh. Thanks for making the effort to share the solution. But I didn't quite find the logic or explanation of how this approach solves the problem, as in why we chose this approach. Rather than getting to a solution, I am more interested in the approach as I prepare.

VarunVermaUSC

why do we need math.abs? isnt it guaranteed that everything at that poit in the array is a positive?

irvinge

(Old) Leetcode 41 - Arrays | First Missing Positive

(Old) Leetcode 41 - Arrays | First Missing Positive

(Remade) First Missing Positive | Arrays | Leetcode 41

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

First Missing Positive [LeetCode 41] | Arrays | Approach and Intuition

Leetcode 41 First Missing Positive (Java)

First Missing Positive | Leetcode (Hard) 41 | Arrays/HashTable

Amazon Coding Interview Question - First Missing Positive (LeetCode)

First Missing Positive - Leetcode 41 - Java

All O`one Data Structure | Leetcode 432 | All O one data structure |design DSA all operation in O(1)

41. First Positive Missing Leetcode Problem | Solution with Explanation | DSA Problem Series

First Missing Positive LeetCode | Leetcode 41 | LeetCode September Challenge

First Missing Positive | LeetCode 41. First Missing Positive | Google Coding Interview Question

First Missing Positive | Leetcode 41(Hard-tag) Solution in Hindi

Coding Interview Problem - First Missing Positive

41. First Missing Positive | Cycle Sort | Using Array as Hash | HashMap | 5 Approaches

First missing positive leetcode solution

LeetCode 41. First Missing Positive

FIRST MISSING POSITIVE | LEETCODE # 41 | PYTHON SOLUTION

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

Leetocde 41. First missing positive

leetCode #41 First Missing Positive | JSer - algorithm and JavaScript

Leetcode - First Missing Positive (Python)

41. First Missing Positive | Leetcode Hard (Remake)

Find missing number in an array