Remove Element Pull Request

[HoangJames]

Pull Request Template

Description

Given an array nums and a value val, remove all instances of that value in-place and return the new length.

Approach involves using two pointers (fast and slow). Iterate through the array with the fast pointer, if the value at fast does not match the value, then we just need to swap value of the slow pointer with the fast pointer. We can then increment slow pointer after each swap (fast pointer is incremented after each iteration). At the end, the array is modified in place and effectively all occurrences of the 'value' is moved to the end of the array. The value of 'slow' gives the length of the modified array where there are no occurrences of 'value'.

Put check marks:

Have you made changes in README file ?

• Added problem & solution under correct topic.
• Specified Space & Time complexity.
• Specified difficulty level, tag & Note(if any).

How Has This Been Tested?

Please describe the tests that you ran to verify your changes. Please also note any relevant details for your test configuration.

• Test A
• Test B
  Accepted Solution on LeetCode

Make sure all below guidelines are followed else PR will get Reject:

• My code follows the style guidelines of this project
• I have performed a self-review of my own code
• I have commented my code so that it is easy to understand
• I have made corresponding changes to the documentation
• My changes generate no new warnings
• Any dependent changes have been merged and published in downstream modules

[welcome]

I can tell this is your first pull request! Thank you I'm so honored. 🎉🎉🎉 I'll take a look at it ASAP!

[welcome]

Your code looks great! Congrats, I've gone ahead and merged your first pull request! Keep it up!