The code is very readable, which is good, but indexOf() is an O(n) time function by itself, so the overall time complexity becomes O(n^2), and the space complexity becomes O(n) since you're creating a new array (original).
Thank you for explaining... Even though I'm not good at Big O notation, I can understand ur explanation.
Are you sure you want to hide this comment? It will become hidden in your post, but will still be visible via the comment's permalink.
Hide child comments as well
Confirm
For further actions, you may consider blocking this person and/or reporting abuse
We're a place where coders share, stay up-to-date and grow their careers.
The code is very readable, which is good, but indexOf() is an O(n) time function by itself, so the overall time complexity becomes O(n^2), and the space complexity becomes O(n) since you're creating a new array (original).
Thank you for explaining... Even though I'm not good at Big O notation, I can understand ur explanation.