Open in app

Sign In

Write

Sign In

Regina Furness
Regina Furness

97 Followers

Home

About

Mar 22, 2021

Implementing a Trie in JavaScript Part 2

Last week I wrote part one of this series of blogs. We learned how to insert a word into a trie, as well as determine whether or not the trie contains a given word. …

Trie

7 min read

Implementing a Trie in JavaScript Part 2
Implementing a Trie in JavaScript Part 2
Trie

7 min read


Mar 15, 2021

Implementing a Trie in JavaScript Part 1

A trie is a tree data structure that is useful for searching and retrieving data. Most often used with strings, where each character of the string is a single node in the tree, which will then have a child node that is the following character of the string. In this…

Trie Data Structure

3 min read

Implementing a Trie in JavaScript Part 1
Implementing a Trie in JavaScript Part 1
Trie Data Structure

3 min read


Mar 8, 2021

Rotate a Square Matrix by 90 Degrees in JavaScript

In this blog I’m going to teach you one method for rotating a square matrix 90 degrees clockwise, in place. I came across this question on leetcode. I thought I would have trouble remembering the steps to solve this problem, so I wanted to write a blog about it. …

Rotating Matrix

4 min read

Rotate a Square Matrix by 90 Degrees in JavaScript
Rotate a Square Matrix by 90 Degrees in JavaScript
Rotating Matrix

4 min read


Mar 1, 2021

Dijkstra’s Algorithm in JavaScript

Dijkstra’s Algorithm is an algorithm to find the shortest path between vertices in a graph. It was created by Edsger W. Dijkstra, a Dutch computer scientist. Given a source vertex, the algorithm will find the shortest path between that vertex and all other vertices in the graph (returning infinity if…

Java Script

6 min read

Dijkstra’s Algorithm in JavaScript
Dijkstra’s Algorithm in JavaScript
Java Script

6 min read


Feb 22, 2021

Representing a Weighted Graph with an Adjacency Matrix in JavaScript

I recently came across an implementation of an undirected weighted graph using an adjacency matrix. Prior to this, I was used to seeing graphs represented using adjacency lists. To keep this blog focused, today I’ll only be writing about representing a weighted graph using an adjacency matrix, and will assume…

Java Script

4 min read

Representing a Weighted Graph with an Adjacency Matrix in JavaScript
Representing a Weighted Graph with an Adjacency Matrix in JavaScript
Java Script

4 min read


Feb 15, 2021

Bit Manipulation Part II

Last week I took a quick look at bit manipulation. I learned about bitwise operators, as well as how to represent positive base 10 numbers in binary (base 2). …

Binary

7 min read

Bit Manipulation Part II
Bit Manipulation Part II
Binary

7 min read


Feb 8, 2021

First Look at Bit Manipulation

Recently, while doing leetcode problems I came across a problem in which the most optimal solution was the result of bit manipulation. I knew bits were the 0’s and 1’s in binary, but that was about it. I decided to dig a little deeper and share what I’ve found here. What are Bits? …

Bitwise

4 min read

First Look at Bit Manipulation
First Look at Bit Manipulation
Bitwise

4 min read


Published in JavaScript in Plain English

·Feb 1, 2021

How To Create And Use Hash Tables in JavaScript

A hash table is a data structure which consists of key and value pairs. A good analogy is thinking of it like a dictionary (the book), the keys are the words and the values are the definitions. If you think that sounds familiar, you’re correct, JavaScript Objects are an example…

Java Script

8 min read

How To Create And Use Hash Tables in JavaScript
How To Create And Use Hash Tables in JavaScript
Java Script

8 min read


Jan 24, 2021

Implementing Heap Sort in JavaScript

Last week I wrote about implementing a max heap in JavaScript, now we’re going to put that knowledge to the test and write a heap sort algorithm. Understanding the implementation, and time and space complexities of a max heap will make understanding the heap sort algorithm quite simple. Step by Step Example The Process We know…

Java Script

4 min read

Implementing Heap Sort in JavaScript
Implementing Heap Sort in JavaScript
Java Script

4 min read


Jan 17, 2021

Implementing a Max Heap in JavaScript

Last week I wrote about implementing quicksort in JavaScript, the next sorting algorithm I would like to cover is heap sort. However, in order to do so, we need to understand the heap data structure. A heap is a tree based structure. Specifically we will be looking at a max…

Max Heap

6 min read

Implementing a Max Heap in JavaScript
Implementing a Max Heap in JavaScript
Max Heap

6 min read

Regina Furness

Regina Furness

97 Followers

Aspiring Software Engineer

Help

Status

Writers

Blog

Careers

Privacy

Terms

About

Text to speech