I’ve been reviewing sorting and heaps — so why not do both?!

A heap is an array, visualized as a binary tree. Heaps tend to have the following methods: insert, pop/delete, and lookup/peek. Insert and pop…

I wanted to learn more about how hash tables work, so I decided to implement one. I investigated three popular concepts:

Have you heard of WikiRace? Basically, it’s a game that challenges players to see how many clicks it takes to get from one Wikipedia page to another.

Example: It takes 3 clicks to get from ‘Python’ to ‘Ringo Starr.’