News for hackers. Stuff that matters.
Re:Why Linked Lists Are an Interview Staple by Animats on Thursday June 06, 2019 @03:17AM (#20112279)
"determine if a linked list has a cycle in it."

That's only hard if you can't put a depth count field in each list node, and can't use much memory outside the list. If you can do either of those things, it's easy.

Many of the classic list algorithms assume that memory is expensive but random access is free. Today, memory is cheap but random access to a lot of it is expensive.

Re:Why Linked Lists Are an Interview Staple by Kiro on Thursday June 06, 2019 @04:18AM (#20112562)
Easy is relative. I've don't even know what a linked list is, much less able the implement one and I've been programming for 10 years.
Re:Why Linked Lists Are an Interview Staple by mruts on Thursday June 06, 2019 @12:30PM (#20116126)
That says a lot more about you than the interview question.
Re:Why Linked Lists Are an Interview Staple by GGfpc on Thursday June 06, 2019 @08:52AM (#20114027)
You've never used a linked list in 10 years?