It's still a pretty big deal to know how Big O for time complexity (space complexity less so) and how to write algorithms that optimize for such. That being sai

It's still a pretty big deal to know how Big O for time complexity (space complexity less so) and how to write algorithms that optimize for such. That being said, I've never had to write anything much more complex than a Binary Search algorithm for an interview as far as DS&A goes. If I were being interviewed I would have no problem taking advantage of any standard APIs I would expect to have available to me, which includes browser APIs if it were a front-end role. Why waste valuable interview time writing a sorting algorithm instead of just using .sort()?