Lizzie ChanValid Anagram — Leetcode #242This week we will go over to see if two words or phrases are anagrams. Return true if they are, and false if they are not. Follow along…Feb 14, 2020Feb 14, 2020
Lizzie ChanFulfilling Multiple PromisesToday I am going to share how to fulfill multiple promises and update state all at once. The goal is to fetch a list of Star Wars movies…Jan 31, 2020Jan 31, 2020
Lizzie ChanLinked Lists BasicsThis week let’s tap into the basics of linked lists. Linked lists are made up of nodes, with a head node at the beginning and a tail node…Jan 24, 2020Jan 24, 2020
Lizzie ChanIntersection of Two Arrays II— Leetcode #350This week let’s go over Leetcode #350 — Intersection of Two Arrays . Given 2 arrays, find which numbers are in both, and return those…Jan 10, 2020Jan 10, 2020
Lizzie ChanRoman to Integer — LeetCode #13In this problem, we are simply converting a Roman numeral number into an integer, with a range from 1 to 3999. If you want to follow along…Dec 30, 2019Dec 30, 2019
Lizzie ChanMaximum Depth of N-ary Tree — Leetcode #559In a previous week, we talked about the basics of trees and how to traverse through them breadth and depth first. We will be able to use…Dec 20, 2019Dec 20, 2019
Lizzie ChanLemonade Change and QueuesLast week we reviewed the basics of stacks and queues, so this week we’ll go over a queue problem. Read the Leetcode Lemonade Change…Dec 16, 2019Dec 16, 2019
Lizzie ChanQueues and StacksThis week we’ll tackle the basics of queue and stack data structures and popular methods such as add and remove.Dec 4, 2019Dec 4, 2019
Lizzie ChanBig O NotationBig O Notation refers to time and space complexity. Basically, it is a fancy way of saying how long an algorithm will take and how much…Nov 27, 2019Nov 27, 2019
Lizzie ChanLeetcode #169 — Majority ElementToday we’ll have to go over a problem that has to do with the turning an array into an object, and counting the frequency of each element…Nov 22, 2019Nov 22, 2019