Oracle's Remove Element LeetCode Solution Explained -JavaScript

In this tutorial, I demonstrate how Remove Element problem can be approached easily and sans using anything more than O(n) time complexity & O (1) space complexity as required by the problem statement (do this by modifying the input array in-place with O(1) extra memory). In-place simply means without using a spare or extra array, to only work within the given array and find the quanity of numbers that are not equal to the given value (val) number.