Kth Missing Positive Number | LeetCode 1539

[@NatureLover-oq6uc]

Logic is just insane...dont know when i will think like this...

[@mikedelta658]

Fantastic. Thank you.

[@chandansahu2340]

finest explaination on the whole internet.

[@rahulrandhiv]

in the second approach, you don't need idx, replace it with i

[@purplewombat6735]

best explanation of this problem! I feel approach #2 was my missing key to understand approach #3

[@rohitsoni2439]

thanx for explaining

[@PJcreationss]

Very good explanation

[@digvijay1228]

Could you please explain why you took arr[idx] - (idx+1) < k condition. What was the intuition behind this. Sorry I couldn't understand, you said if arr[i] - (i+1) == 0 means no missing number, but if it is greater than zero means those many missing numbers. I just can't get to the final condition. correct if i'm wrong

[@hksubs]

Thanks , i. like how you progress the code to optimal way. Can you please explain more why you set "idx = i + 1"? can "i" be eliminated?