Caroline LeeSome common Big O timesBig O is a way we measure the efficiency of an algorithm. It represents the rate of increase in time or space complexity as number N…Sep 11, 2018Sep 11, 2018
Caroline LeeThe Humble ArrayThe array is a collection of elements that are stored in memory with each element the same size such that the position of each element can…Sep 6, 2018Sep 6, 2018
Caroline LeeLinear Data Structures: an overviewLinear Data Structures are structures where one element is followed by another one element is followed by another one element in a way that…Aug 28, 2018Aug 28, 2018
Caroline LeeReact Higher Order Components vs Render PropI was refactoring a React project when I noticed I had some repetitive components. In order to make my code more DRY I started to review…Aug 21, 2018Aug 21, 2018
Caroline LeeData StructuresWhen I hear Data Structures, the first thing that comes to mind (for Javascript) is Arrays and Object. But there are so many more data…Aug 14, 2018Aug 14, 2018
Caroline LeeA Random WalkNow that we are all proficient in random, let’s take a random walk. We’ll start at 0 on this number line and each turn we will move one…Feb 21, 2018Feb 21, 2018
Caroline LeeRandom TopicRandom (adj.) 1. Made, done, or happening without method or conscious decision.Feb 7, 2018Feb 7, 2018