Generally there has always been some pre-existing parser or a basic regex that t... | Hacker News

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

		lazide on Dec 25, 2022 \| parent \| context \| favorite \| on: Challenging algorithms and data structures every p... Generally there has always been some pre-existing parser or a basic regex that took 30 seconds to write that I’ve done that with. Maybe I’m blessed?

tptacek on Dec 25, 2022 [–]

Could be! I've never had to draw a Bresenham line, but I'm sure lots of people have. :)

In-memory skiplists, I'm still skeptical of.

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