Data Access Times Translated to Distances (with Pictures)
This well-known article, Numbers Everyone Should Know, was intriguing, but it was hard to mentally get a handle on the scale of the numbers. Here are »
Finishing the Learning Phase
Back on August 8, I talked about how I was going to change up my study schedule for the interview. I discovered that it was difficult »
Cryptography & Compression
Today I studied cryptography and compression, so I'm trucking along. These topics are not on the coaching docs I've seen, but I added them to round »
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 »
Important: Pick One Language for the Coding Interview
I wanted to clarify the programming language requirement for the interview. I was under the impression that I needed C++ or Java to do the interview, »
How to Run Valgrind in CLion, for C and C++ Programs
I needed this for myself, and Googled around but didn't find anything satisfactory, but now after a little work, I'm all set with Valgrind. Wouldn't you »
Dijkstra's Algorithm in Python 3
Greed is good. And Dijkstra's algorithm is greedy. Dijkstra's algorithm not only calculates the shortest (lowest weight) path on a graph from source vertex S to »
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 »