Testing my code was drilled into my brain when I was working at edX. For each monitoring script I wrote, there was an accompanying test script to make sure that it worked. Prior to edX, I admittedly did not write tests for my code to make sure it worked. I just relied on good ol’ […]
Author Archives: Nicholas Moy
CovidBikeData – Applying the lessons learned from edX and then some (an ongoing story)
A lot has happened in my personal life since my last post, which explains the dormancy of my site, but I’m now starting to get back in the saddle and work on some interesting stuff. Storytime After getting settled in my new apartment after my stint at edX, I was mulling over new project ideas, […]
Summer at edX
edX is a massive open online course (MOOC) provider based out of Boston, MA and it was the place of my internship for the summer as I start my career as a software engineer. I opted to be part of the Site Reliability Engineering team for the summer and suffice to say, I learned A […]
Discovering Data Structures – Binary Tree Traversal
In our last couple of posts, we talked about two things: the implementation of binary trees and recursion. First, we know that binary trees consist of a root node, that points to its own children, which then points to its own subsequent children. Second, we know that recursion is the process in which a function […]
Algorithm Concepts – Recursion
Before getting into how to traverse binary trees, whether ordered or unordered, as mentioned in my last post, we have to go into recursion, since it’s an integral part of how to do that, which brings me to the creation of a new series: Algorithm Concepts. This series that’ll show up from time to time […]
Discovering Data Structures – Binary Tree Implementation
In my last post, we talked about the binary search tree, what it is, and it’s use cases. Now, we’re going to talk about implementation. Since I’ve been working in JavaScript as of late, we’re going to use JavaScript to code it. Here. We. Go. Implementation of the base classes There are two main classes […]
Discovering Data Structures – Binary (Search) Trees
You know, you’d think I’d be taking a break on data structures and talk about other things like JavaScript, Ruby or anything less computer science-esque related. I was going down that road too, but after encountering the topic of trees on a recent code challenge, I took it as an opportunity to learn about the […]
Discovering Data Structures and Algorithms – D-D-D-DOUBLY LINKED LISTS
In what would probably be my last post on the subject of linked lists, we’re going to be talking about doubly linked lists, which is a variant of the singly-linked lists. Seeing double Let’s refresh our memories as to what a singly linked list looks like: Recall in my previous posts that a singly linked […]
Discovering Data Structures – Objects in JavaScript
According to the Mozilla developer page for objects, they define objects as the following: The Object class represents one of JavaScript’s data types. It is used to store various keyed collections and more complex entities. Objects can be created using the Object() constructor or the object initializer / literal syntax. Source Objects differ from the other (primitive) datatypes of JavaScript(Number, String, Boolean, null, […]
Discovering Data Structures – Linked Lists
As I’m preparing for different code challenges, I’m coming across different concepts that fall under the umbrella of Data Structures and Algorithms. For instance, I’m going through different questions on HackerRank and LeetCode, and come across certain questions that have us traverse through a LinkedList. I’m going to be completely honest, it took me a […]