How to Rock the Programming Portion of Your Interview
Well, it's taken many months to get to this point, because I had a lot to learn. With no formal computer science training and not knowing »
Machine Learning: The Future has Arrived
I wanted to spend a good bit of time gaining deeper knowledge and more experience with machine learning and data science, but just ran out of »
Computing Convex Hull in Python
Geometric algorithms involve questions that would be simple to solve by a human looking at a chart, but are complex because there needs to be an »
Maximum Flow, Minimum Cut and the Ford-Fulkerson Method
Today I'm studying flow graphs and disjoint sets data structure. Maximum flow falls into the category of combinatoric optimization problems. The Ford-Fulkerson method, published in 1956, »
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 »