News for hackers. Stuff that matters.

A comment on In defense of coding interviews. Parent comment

Re:In defense of coding interviews by arethuza on Sunday May 29, 2022 @04:10AM (#31547383)
What would you do if a candidate said with a smile "I'm pretty sure it is O(n!)"?
[ Parent | on HN ]
Re:In defense of coding interviews by enedil on Sunday May 29, 2022 @07:16AM (#31548207)
Parent commenter asked for little o, not for big O. So to be safe, better say n^o(n^2).
[ Parent | on HN ]
Re:In defense of coding interviews by robertlagrant on Sunday May 29, 2022 @02:08PM (#31551292)
Hah this is the best comment.
[ Parent | on HN ]
Re:In defense of coding interviews by xigoi on Sunday May 29, 2022 @11:17AM (#31549783)
“So you want to put code into production without having a better estimation of its time complexity than O(n!)?”
[ Parent | on HN ]