Some days, I’m in need of some comfort. I’m tired, emotionally drained, or just feeling besieged by the world. On these days, I try to recognize my physical, mental and emotional state, and I ask myself what I need.

Dynamic Programming is a technique in computer programming that helps to efficiently solve a class of problems that have overlapping subproblems and optimal substructure property.

Dijkstra's Algorithm works on the basis that any subpath B -> D of the shortest path A -> D between vertices A and D is also the shortest path between vertices B and D.