Kitana ToftBinary Trees ExplainedIn this article we will review Binary Trees. Binary Trees are composed of nodes which have at most two pointers, which are referred to as…Jun 2, 2023Jun 2, 2023
Kitana ToftLinked List ExplainedHello there! I’d like to take a moment to introduce you to one of the fundamental data structures in computer science: the linked list. In…May 24, 2023May 24, 2023
Kitana ToftBinary Search ExplainedLet’s learn about another sorting algorithm, Binary Search. Now, this sorting algorithm is actually something our brains use everyday…May 21, 20232May 21, 20232
Kitana ToftMerge Sort ExplainedLet’s face it, studying and mastering algorithms can often seem daunting and overwhelming. However, it’s important to remember that not all…May 7, 2023May 7, 2023
Kitana ToftSliding Window Technique ExplainedThe sliding window technique is a continuation of the two pointer technique, which uses two pointers to act as boundary points for a…Apr 25, 2023Apr 25, 2023
Kitana ToftKadane’s Algorithm ExplainedKadane’s Algorithm (a.k.a. maximum sum subarray problem) is a greedy dynamic programming algorithm that calculates the maximum subarray at…Apr 6, 2023Apr 6, 2023
Kitana ToftTwo Pointer Algorithm ExplainedWelcome to my mini-series “Explained” where I will do my best to describe commonly used Data Structures & Algorithms.Mar 31, 2023Mar 31, 2023