ANAvinash Negiindsawithpython.hashnode.devI Finally Understood BST — And It's Just Divide & Conquer in DisguiseLast 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...Feb 18·5 min read
SGShivam Garginbinary-search1.hashnode.devWhat is Binary Search? Binary Search is an algorithm used to find an element in a sorted array. Instead of checking each element one by oneWhy is Binary Search Efficient? Let’s compare: AlgorithmTime Complexity Linear SearchO(n) Binary SearchO(log n)Feb 18·1 min read
ACA Curious Coderinclarity-in-code.hashnode.devBinary Search Is Not Just Searching — It’s Eliminating Half the Answer SpaceWhy 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...Feb 14·7 min read
YYoursinsales37894.hashnode.devVerified Binance Account - Best Cryptocurrency TradingAre 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...Jan 21·2 min read
SAShahwar Alam Naqviinis-power-of-two.hashnode.devLeetCode: Find Sqrt(x)Problem: https://leetcode.com/problems/sqrtx/description/ Code: class Solution: def mySqrt(self, x: int) -> int: if x <= 1: return x low, high = 1, x // 2 while low <= high: mid = (low + high) // 2...Dec 16, 2025·2 min read
SAShahwar Alam Naqviinis-power-of-two.hashnode.devLeetCode: Minimum Number of Days to Make m BouquetsProblem: 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...Dec 3, 2025·3 min read
RKRajit Kumarinrajit.hashnode.devMastering ArrayBuffer in JavaScript: A Guide to File Handling with Express.js and Next.jsUnderstanding 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...Nov 30, 2025·4 min read
SAShahwar Alam Naqviinis-power-of-two.hashnode.devLeetCode: Binary SearchProblem: https://leetcode.com/problems/binary-search/description/ Code: class Solution: def search(self, nums: List[int], target: int) -> int: if not nums: return -1 low, high = 0, len(nums)-1 while low<=high...Nov 24, 2025·1 min read
ASAbhijeet Shindeinweeklyupdate.hashnode.devCS50 #Week 3 — A Clear Guide to AlgorithmsThis 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...Nov 23, 2025·4 min read
BRBrett Rowberryinbrettrowberry.comBinary Search in ClojureI 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...Nov 4, 2025·2 min read