Interviews by Kevin Naughton Jr.
A compact reference for the data structures and algorithms that come up again and again: linked lists, trees, tries, heaps, graphs, sorting, greedy approaches, bitmasks and runtime analysis, each explained in a few plain sentences with its time complexity. It also links online judges and has a directory of worked solutions. The top of the README promotes a paid newsletter; the reference sections below it are the free part worth reading.
GitHub repo
Interview Prep
Kevin Naughton Jr.
Beginner
Free
A compact reference for the data structures and algorithms that come up again and again: linked lists, trees, tries, heaps, graphs, sorting, greedy approaches, bitmasks and runtime analysis, each explained in a few plain sentences with its time complexity. It also links online judges and has a directory of worked solutions. The top of the README promotes a paid newsletter; the reference sections below it are the free part worth reading.
Ready to start?
Opens on Kevin Naughton Jr. in a new tab.
Stuck on something specific?
Writing only gets you so far. If you want an answer to your situation rather than the general case, book a session and we will work through it together. Sessions are free for approved Sefism members, and a few slots open each week.
Follow along
New writing, resources and project ideas land here first.