Category: Tech

Anagrams as a Matter of Secret Identity

On my quest to master algorithms in JavaScript, I make a point of cross referencing different tutorials and solutions, that I might find a happy middle ground and greater understanding. However, if you want to learn straight from the masters, I recommend you check out Stephen Grider’s Algorithms and Data Structures course on Udemy and…
objectMap from Array or String: The Snitch

While many of the other algonalogies have stories accompanying code… the code for this is a pretty direct expression for the analogy. Think of a “Snitch” an “Informant” from a cop movie… or in a historical light: “The Kindly Old Neighbor” who works for the Stasi or GPU (secret police), keeping track of your every…
Palindromes, or The Sock Draw of a Troubled Mind

A palindrome is a word like “RACECAR” or “DID”, it is the same both forwards and backwards. Today, we’re going to cover several Javascript solutions with some variations that might be useful. Where does “The Sock Draw of a Troubled Mind” come into play? That’s a good question… but it seems safe to assume that…
Breadth First Search (Trees)

For a better explanation of Breadth First Search, check out my previous algonalogy for Breadth First Search. For the example here, we’ll be going level by level and returning the averages for each level. Cast of Characters:-Wart Nose Climbing a Tree-Construction Workers-Lewis and Clark-Retired Turtle Bouncer-Wile E. Coyote-Forex Trader-Pushy Car Salesman-Shifty Eyed Shoplifter Glossary of…
Real World Use Case of a Tree

NOTE: to the prospective reader of this blog post: you may find it entirely “skippable”, unless you’re curious about how I think. This blog may appear “messy” as it’s me trying to work through an idea, breathe some life into it that I might have an easier time coding it. It’s basically a forward-looking-reflection on…
Depth First Search (Trees)

Depth First Search was previously covered in my blog here but as I’ve been exploring more programmatic “use cases” with my other Code Pattern posts, I get the impression that Depth First Search could be useful in programming some “Natural Language Processor” to check for specific meaning first and then back up to something more…
Subsequences and Gold Diggers

A common question you might face during a coding interview is to validate a subsequence. Chances are you’ll have two arrays (possibly more) and you will need to make sure that the numbers in the smallest array will appear in the same order (even if they aren’t adjacent) in the larger array. For example [1,3,5,8]…
The React-Redux Flow: A State of Dystopia

BACKGROUND: As I work through the final project of Flatiron’s curriculum, I initially found the Redux implementation to be overkill. Having completed my app using React along with State and Props, it was frustrating to attempt a Redux refactor as I found myself mostly adding code (as opposed to taking it away). Ultimately, I wiped…
Lifecycle Methods in React, and The Wheel of Karma

In React, one of the more basic concepts for class based components is that of Lifecycle Methods. When thinking in only technical context the concept seems easy enough, but the ideas blur when it comes to implementing them. With that in mind, this analogy of Karma and The Wheel of Life may help. Imagine a…
Binary Search Trees, or Networking with Schmucks

There’s are lot blog posts out there that talk about nodes, and (in my opinion) seem to overcomplicate the fundamental essence of a Binary Search Tree. With that in mind, I’ve got an algonalogy up my sleeve that makes it easy to understand and hard to forget. Have you ever been to a business networking…
Reverse String for JavaScript: or The Extra Credit Heist

This is the first of many short blogs to help memorize code. Since I aspire to mastery with JavaScript, the examples will be with JS. A note about the format: it seems “scientifically proven” that people remember stories about people (especially absurd stories) much easier than they do dry facts. Now, let’s get memorizing a…