Hacker News new | past | comments | ask | show | jobs | submit login

Personally I only ask super easy questions because you should at least be able to talk about something trivial. Yet unfortunately the question “find the second largest number in an array of numbers” has a high failure rate as the first question, because there are a lot of people lying on their resume just throwing spaghetti at the walls.



Thats to easy man arr.sort((o,O)=>o<=O)[1]

One for you: Write a recursive function that finds the second largest number in an array of numbers.





Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact

Search: