Technical Interviews Today and Tomorrow

I would define interviewing as follows: The process of identifying the individuals who can achieve greatness. Great companies need to select employees capable of achieving greatness on their own. Then, and only then, can a company be used as a catalyst to achieve that greatness to benefit both the company and the individual. Remember, employees are selling their […]

Binary Trees and Traversals

Everyday Algorithms: This may be a bit of a divergence from my regular “Everyday Algorithms” series, however I feel it is important. Thus far, most algorithm’s I have discussed have been directly related to real life events. I.e. flipping pancakes, planning a road trip, etc. That being said, I feel it is important to cover […]

Merge Sort in Go (Golang)

Merge Sort was invented by John von Neumann in 1945, and is an algorithm belonging to the “divide and conquer” class of algorithms. Meaning, the algorithm splits an input into various pieces, sorts them and then merges them back together. Runtime of Merge Sort If we rephrase this algorithm: Divide the array into various “chunk” to process Merge the […]