KingAshiru/RemoveInstance

## RemoveInstance
class Solution:
    def removeElement(self, nums, val) -> int:
        # check for edge cases of None array, None value, or invalid values such as strings
        if not nums:
            return 0
        if (not val) or (type(val) is not int) or (type(val) is not float):
            return len(nums)

        nextNonKey = 0
        i = 0

        # The idea is to check each element from the first index,
        # If the element is a val we don't want to remove, we update that position using the nextNonKey tracker
        # When we are done with all operations in the loop, nextNonKey would be the length of our desired array of values.

        while i < len(nums):
            if nums[i] != val:
                nums[nextNonKey] = nums[i]
                nextNonKey += 1
            i += 1

        return nextNonKey

        # The while loop takes O(N), where N is the length of nums array
        # Since the operation is done in place, we create no extra space, space complexity is O(1)
        # In total we have Time - O(N), Space - O(1)
	class Solution:
	def removeElement(self, nums, val) -> int:
	# check for edge cases of None array, None value, or invalid values such as strings
	if not nums:
	return 0
	if (not val) or (type(val) is not int) or (type(val) is not float):
	return len(nums)

	nextNonKey = 0
	i = 0

	# The idea is to check each element from the first index,
	# If the element is a val we don't want to remove, we update that position using the nextNonKey tracker
	# When we are done with all operations in the loop, nextNonKey would be the length of our desired array of values.

	while i < len(nums):
	if nums[i] != val:
	nums[nextNonKey] = nums[i]
	nextNonKey += 1
	i += 1

	return nextNonKey

	# The while loop takes O(N), where N is the length of nums array
	# Since the operation is done in place, we create no extra space, space complexity is O(1)
	# In total we have Time - O(N), Space - O(1)