Help me out in this

#1


what is space complkexity in this approach?

#2

@aman212yadav are u there ?

#3

hello @shivammishra20121999

space complexity is O(N) …because in worst case u will be storing all elements

#4

@aman212yadav https://leetcode.com/problems/first-missing-positive/
but above solution is accepted why irrespective its sc is o(n)?

#5

O(N) space is acceptable.
that O(1) space is follow up constraint ie they want u to come up with O(1) space approach if u have solved it using o(n) space

#6

@aman212yadav i tried a lot you know any logic whose sc is o(1)?

#7

use same array for keeping track of available positive numbers .
in that way u can solve ur problem without using any extra space

#8

@aman212yadav let me try

#9

refer this for better clarity ->link

#10

@aman212yadav thks bro i am struggling for doing it in o(1) space for last two hrs?
thks

#11

I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.

On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.