Monthly Archives: April 2019

Shortest Path – Dijkstra’s algorithm

Here are my whiteboard notes on how to implement the Dijkstra’s algorithm to find the shortest path of a graph: Here is my simple c++ implementation of this: The above is a very simple implementation of the algorithm. It is … Continue reading

Posted in programming | Tagged , | Leave a comment

Shortest Path – Bellman Ford algorithm

Here are my notes on how to implement the Bellman Ford algorithm to find the shortest path of a graph: This is along the lines of what Rob Conery describes in The Imposter’s Handbook. And here is my c++ implementation … Continue reading

Posted in programming | Tagged , | Leave a comment

Fibonacci spiral

Here are my whiteboard plans for drawing the Fibonacci spiral. The main issues were figuring out the x and y positions of each of the squares. I knew that I would need a loop that iterates around North, West, South … Continue reading

Posted in programming | Tagged , | Leave a comment

Maximum Subarray Sum problem

I had to write down an example and work through it to figure this out. Here are my resulting whiteboard notes: A few different implementations can be found here: https://hackernoon.com/kadanes-algorithm-explained-50316f4fd8a6 I think Kadane’s algorithm can also be used to solve … Continue reading

Posted in programming | Tagged , | Leave a comment

Nth Fibonacci number matrix solution

It’s easy to implement a 2^n recursive solution and also easy to implement an iterative O(n) solution but implementing an O(log n) solution is trickier. The following has a nice summary of various solutions: https://www.geeksforgeeks.org/program-for-nth-fibonacci-number/ I just wanted to add … Continue reading

Posted in programming | Tagged , | Leave a comment

Sum of two problem

I have signed up to leetcode. The first problem I did was called “Two Sum”, where you need to find two numbers in an array that when added together match a target number. I thought I’d write some notes here … Continue reading

Posted in programming | Tagged , | Leave a comment