Jan 3, 2021Chapter 3. — Sequential LogicWe continue on in our journey, today is Chapter 3: Sequential Logic of Building a Modern Computer From First Principles. Last time we took a look at Boolean Arithmetic and we saw how we could start to create the ALU using these arithmetic chips. These chips are called combinational chips…Computer Science5 min read
Dec 27, 2020Chapter 2. — Boolean ArithmeticThis week I will be continuing a review of Building a Modern Computer from First Principles. Last week we learned a little bit about Boolean Logic now let’s check out chapter 2: Boolean Arithmetic. The Central Processing Unit (CPU) is the electronic circuitry within a computer that executes instructions that…Java Script4 min read
Dec 20, 2020Building a Modern Computer from First Principles — Chap. 1 : Boolean LogicLately I’ve been reading the book Building a Modern Computer from First Principles and I thought it would be good to reiterate some of the things I have learned so far. …Computer Science4 min read
Dec 14, 2020Advent of Code — Day 2Since its December and Advent of Code is happening, I thought we may as well give a few a go. Today we will look at the day 2, Password Philosophy problem. The passwords in our database have been corrupted and now we must go through these passwords and flag the…Java Script4 min read
Dec 7, 2020Intro to Fabric.jsToday we will be looking at a fun library I have been working with recently called Fabric.js. Fabric provides us with an interactive object model that is on top of the native canvas element. It allows us to easily add objects to the canvas and manipulate them in various ways…Javasript3 min read
Nov 29, 2020Word Ladder — BFSToday’s problem will be Word Ladder. Alright first things first let’s discuss what this question is asking us for. We start with a beginWord and an endWord. We want to find the SHORTEST transformation sequence (other words, shortest path) from the beginWord to the endWord. …Java Script3 min read
Nov 22, 2020Determine if Two Strings are ‘Close’Today’s question will be Determine if Two Strings are ‘Close’: The question asks us if after performing certain operations, are the words ‘close’ (can we attain word2 from performing operations on word1). The first operation allows us to swap any two existing characters. If we think about swapping any two…Java Script2 min read
Nov 15, 2020Array Manipulation — Spiral MatrixTodays problem is a fun one! Let’s take a look at Spiral Matrix.Java Script3 min read
Nov 7, 2020Jump GameTodays problem will be Jump Game.Java Script1 min readJump GameTodays problem will be Jump Game.----
Nov 1, 2020Largest Values From Labels — Lets Get GreedyLargest Values From Labels — Lets Get Greedy Today’s problem will be Largest Values from Labels. The question asks us to return the largest possible sum of the subset S. This means we should probably order our items from largest to smallest, and then we can take the items if…Algorithms2 min readLargest Values From Labels — Lets Get GreedyToday’s problem will be Largest Values from Labels.The question asks us to return the largest possible sum of the subset S. This means we should probably order our items from largest to smallest, and then we can take the items if…----