Last active
April 24, 2021 00:30
-
-
Save chygoz2/540ca2dcf141b8340b3194b4eeb5da8b to your computer and use it in GitHub Desktop.
Algo friday 2 solution
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
function removeInstance(nums, val) { | |
if (!Array.isArray(nums)) throw new Error('Invalid input') | |
return nums.filter(entry => entry !== val).length | |
} |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Very well said and I totally agree that in terms of algorithm complexity,
O(n/2)
is effectivelyO(n)
. You got a clean solution nevertheless!