Feb 18 · 5 min read · Last article, I said trees made me nervous. Recursion. Nodes. Children. Height. I expected to be stuck for a week like linked lists. I wasn't. Binary Search Tree clicked faster than I expected — and once it did, I understood why every other tree conc...
Join discussion
Feb 14 · 7 min read · Why Did We Need It When Linear Search Already Existed? When I first learned Binary Search, I had one very honest doubt: If Linear Search already works… why did we even invent Binary Search? I mean, Linear Search goes through elements one by one. It...
Join discussion
Jan 21 · 2 min read · Are you looking to elevate your cryptocurrency trading experience? Look no further than verified Binance account. With the ever-growing popularity of cryptocurrencies, having a verified Binance account can open up a world of opportunities for traders...
Join discussionDec 3, 2025 · 3 min read · Problem: https://leetcode.com/problems/minimum-number-of-days-to-make-m-bouquets/ Code: class Solution: def minDays(self, bloomDay: List[int], m: int, k: int) -> int: # we need m bouquets # each bouquets should have k adjacent flo...
Join discussionNov 30, 2025 · 4 min read · Understanding ArrayBuffer in JavaScript and How to Use It with Files in Express.js and Next.js Handling binary data efficiently is an essential part of modern web development, especially when working with files, images, or streams. If you’ve ever dea...
Join discussion
Nov 23, 2025 · 4 min read · This week of CS50 honestly hit different. Even though I come from a computer science background — and I’ve already studied searching, sorting, and Big-O — Week 3 felt like that moment when you clean your room and suddenly find things you forgot you e...
Join discussion
Nov 4, 2025 · 2 min read · I decided to implement linear search before going after binary search. Now, I’m ready! With linear search, we required the elements be sorted. We didn’t require the elements be bounded. In binary search, the inputs must be bounded because we maintain...
Join discussion