Problem Statement

Given a list of words, find all pairs of unique indices such that the concatenation of the two words is a palindrome.

For example, given the list [“code”, “edoc”, “da”, “d”], return [(0, 1), (1, 0), (2, 3)].

A Museum You Should Visit

Fossil Butte National Monument is about 20 miles from Kemmerer, Wyoming, and well worth a visit.

I bought a TP-Link powerline ethernet starter kit.

I visited the Vedauwoo, Wyoming climbing area just over 25 years after my rock climbing accident there.

I fell about 30 feet on July 3, 1989, leading to an emergency room visit, 3 days in the hospital, and 9 weeks of knees-to-toes casts.

On September 2, 2024. I went back for a visit, as a tourist. I haven’t been rock climbing since early 1990.

Is tungsten carbide magnetic?

You can’t use the World Wide Web to find a definitive answer!

It turns out you can buy little cubes of various elements from sketchy Amazon marketplace vendors.

Naturally, I wanted some Tungsten, because of its incredible density.

Previously, in July 2021, I had tried to remove garbage collection from the possible variables affecting my iterative mergesort. I transliterated the Go code to a plain C version that could not have any garbage collection. The C code benchmarked very similarly to the Go code.

As a way to see if merely accessing the linked list node’s memory causes the mergesort performance drops, I wrote two non-sorting functions and benchmarked them to try to distinguish

• accessing the nodes’ data
• modifying .Next pointers

I read JRR Tolkien’s The Hobbit for the first time since at least Junior High, or maybe even before.