ATAaron Thomasinaaronjthomas.hashnode.dev·Dec 16, 2024 · 17 min readDay 20 (Binary Search Trees)Today, I focused on mastering binary search trees (BSTs) by implementing essential operations and solving problems that leverage their properties. I began by implementing a BST with insertion, deletion, and search operations, ensuring efficient eleme...00
ATAaron Thomasinaaronjthomas.hashnode.dev·Dec 15, 2024 · 14 min readDay 19 (Binary Trees Advanced)Today, I explored advanced concepts in binary trees by solving problems that required deeper insights and creative solutions. I began with checking if a binary tree is balanced, ensuring the height difference between subtrees met the criteria. Then, ...00
ATAaron Thomasinaaronjthomas.hashnode.dev·Dec 14, 2024 · 11 min readDay 18 (Binary Tree Basics)Today, I delved into the fundamentals of binary trees, implementing a binary tree with insertion and the three primary traversal methods: inorder, preorder, and postorder. I then tackled foundational problems, including finding the height of a binary...00
ATAaron Thomasinaaronjthomas.hashnode.dev·Dec 13, 2024 · 10 min readDay 17 (Prefix Sum and Two Pointers)Today, I focused on mastering the prefix sum technique and the two pointers approach to solve challenging problems. I began by solving the "subarray sum equals k" problem using prefix sum, followed by tackling the "longest subarray with sum k" proble...00
ATAaron Thomasinaaronjthomas.hashnode.dev·Dec 12, 2024 · 11 min readDay 16 (Sliding Window Technique)Today, I explored the sliding window technique to efficiently solve problems involving contiguous subarrays or substrings. I began by tackling the "maximum sum subarray of size k" problem, followed by solving the "longest substring without repeating ...00
