Fun with Tries
I'm a fan of tries. I can't claim that I've used them in practice, but I wish I had. They're super! Common uses: substring search spell »
Retaining Computer Science Knowledge
I've been asked numerous times, "How do you remember all the stuff you've been studying?" Here's my method that will keep all the good stuff in »
Tackling Entropy
I've heard the term "entropy" over the years and never understood it until now. I used to think entropy was randomness, and it's kind of related. »
An Experiment in Sorting in Linear Time
Yes, you can sort in linear time, as long as you're avoiding comparisons. Radix sort and counting sort are two examples. They both avoid comparisons, and »
Context Switch in My Coding Interview Study Plan
Time management can be tough. I found myself spending way too long on some subjects. Some take more time than others. Graphs, trees and sorting take »
Graphs and Dynamic Programming
I've been learning graphs and dynamic programming somewhat interleaved. Dynamic programming tends to help solve graph problems because: Every problem solvable by dynamic programming can be »
So Much Sorting
I put on my sorting hat and watched many, many videos on sorting. The videos covered: bubble sort selection sort insertion sort heap sort merge sort »
My Summer Reading List
Technically, I started reading in April, but look at that stack! I'm not spending too much time reading on a daily basis right now. I want »
Working to Become a Unix/Linux Master Plumber
I've been reading an old but great book, The Unix Programming Environment (1984), by Brian Kernighan (of K&R C fame) and Rob Pike. I »
Priority Queues: Heap Implementation
I made a departure after studying binary search trees to visit priority queues and heaps. I had planned to do this one later, but it kept »