It’s been a while since my last article, but I’m trying to get back on the horse, so here we go! Article #4 is pretty straightforward, I’m just going to talk about two pretty easy problems that I did on BinarySearch the other day.
Given an integer square (n by n)
matrix, return its transpose. A transpose of a matrix switches the row and column indices. That is, for every
matrix[r][c] = matrix[c][r].
n ≤ 100
Transposing a matrix is extremely useful in higher-level applications of computer science, such as the construction of deep neural networks…
What does it really mean to “go green”? Uncle Google says it means to “pursue knowledge and practices that can lead to more environmentally friendly and ecologically responsible decisions and lifestyles, which can help protect the environment and sustain its natural resources for current and future generations.” Individual acts to save the environment have gained lots of traction in recent years; we take special care to recycle and reuse, and we feel proud. …
Hey everyone, this is article #2 and I’m going to be departing from the data structures and algorithms I talked about last time. There probably won’t be any real patterns to how I write…just going with whatever idea hits me.
In this piece, I thought I’d talk about the gold standard and basically how money works in the United States. Money is a tricky business — it’s supposed to represent the material value of something, but almost every nation has its own currency and the exchange rates change literally by the day. …
Hey everyone, this is article #1, and in this piece, I’m going to be talking about the least frequently used cache algorithm (LFU). This algorithm can be used to manage memory. The cache has a finite amount of slots available for storing data; when all the slots are occupied, the algorithm will clear the block of data that was least frequently accessed and replace it with a new entry. If there are multiple blocks of data that have been accessed the same number of times, the algorithm evicts the block that was accessed less recently. …