BaseCS
An illustrated series of articles explaining core computer science topics from first principles: linked lists, trees, heaps, hash tables, graphs, sorting algorithms, dynamic programming and compilers. Written for people without a CS degree, it relies on hand-drawn diagrams rather than code or heavy math, which makes abstract ideas stick. The series is complete rather than ongoing, and Medium may limit how many articles you can read without an account.
Guide
Interview Prep
Vaidehi Joshi
Beginner
Free
An illustrated series of articles explaining core computer science topics from first principles: linked lists, trees, heaps, hash tables, graphs, sorting algorithms, dynamic programming and compilers. Written for people without a CS degree, it relies on hand-drawn diagrams rather than code or heavy math, which makes abstract ideas stick. The series is complete rather than ongoing, and Medium may limit how many articles you can read without an account.
Ready to start?
Opens on Vaidehi Joshi 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.