Add q41

[rakshitgondwal]

This is a template on how to fill out a PR properly.

Description

• Language Used: C++

• Approach Used:
  Put each number in its right place.
  For example:
  When we find 5, then swap it with A[4].
  At last, the first place where its number is not right, return the place + 1.

• Question(s) Solved: 1

• Issue(s) Closes: [FEATURE]: Add solution to Q41 to Q50 of Leetcode #24

We only need to keep track of which ones of the first n positive integers occur in the array. To do this with no extra space, we can treat the array like a boolean array, where sign(arr[i]) indicates whether the i-th positive integer is present or not. First, we replace all non-positive values with n + 1, since we'll only use these indices as storage space. Then, for every one of the first n positive numbers in the array, we turn the value at their corresponding index negative. Finally, all we need to do is check for the first positive value, which will give us the first missing positive. If we find no such index, then all natural numbers up to n are present, so we return n + 1.

Related Issue

Acceptance Criteria

Type of Changes

	Type
	🐛 Bug fix
	✨ New feature
	🔨 Refactoring
	💯 Add tests
	🔗 Update dependencies
	📜 Docs

Testing Steps / QA Criteria

[DugarRishab]

Please give the file an extension

[DugarRishab]

Give the file an extension

[rakshitgondwal]

Give the file an extension

Done!

[DugarRishab]

GREAT !!