Hacker Newsnew | past | comments | ask | show | jobs | submitlogin

You can do that for O(N), but the problem can be solved in O(k).


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

Search: