Aug 24, 2025 · 7 min read · Ever stared at a line of code or an algorithm and felt like you were trying to decipher an ancient language? We've all been there. But what if I told you there's a beautifully simple, elegant algorithm that can solve a whole class of array problems, ...
Join discussion
Jul 19, 2025 · 8 min read · Note : Started my 27-day DSA journey with Striver’s SDE Sheet!I will be journaling every day — recording what I learn, reflecting on it, and sharing it with my network to help fellow learners and aspiring developers.. Learning through videos, resourc...
Join discussion
May 27, 2025 · 6 min read · The maximum subarray problem is a perfect example of how a seemingly simple problem can require much deeper thinking than you'd first expect. Here's what we're dealing with: you have a sequence of numbers in an array, some positive, some negative. Ho...
Join discussionApr 12, 2025 · 2 min read · Have you ever felt overwhelmed by a coding problem that seems too simple, yet too confusing at the same time? Well, let me introduce you to a gem that every coder should have in their toolkit: Kadane’s Algorithm. This isn't just a powerful algorithm—...
Join discussionMar 29, 2025 · 4 min read · There are few interesting algorithms to approach 1D array problems. First, Kadane’s algorithm. This is useful to find local max in 1D array. Second, two pointer technique. One pointer starts from the beginning of 1D array and another pointer starts f...
Join discussionMar 28, 2025 · 5 min read · Js-Libp2p-Gossipsubjs-libp2p-gossipsub-src 💠 APIKad-DHTRPC-Messages 💠 js-libp2p-kad-DHTJs-Libp2p-ExamplePeer-discovery-mechanismRust-Libp2pIpfs-Kad example setupUniversal-connectivity: js-peerGossipsub implementationGossipsub-v1.2Protobuf extension...
Join discussion
Feb 21, 2025 · 3 min read · Kadane's Algorithm: Finding the Maximum Contiguous Subarray Sum in Java The problem of finding the maximum sum of a contiguous subarray within a given array of integers is a classic challenge in computer science. This post explores two approaches to ...
Join discussionNov 29, 2024 · 3 min read · Kadane's Algorithm Explained: Kadane’s Algorithm is a famous method used to solve the Maximum Subarray Sum problem efficiently. The goal is to find the contiguous subarray in a given array that has the largest sum. How It Works: Iterate Through the...
Join discussion
Nov 23, 2024 · 3 min read · Kadane's Algorithm is a dynamic programming technique used to find the maximum sum subarray in an array of integers (containing both positive and negative numbers) in O(n) time. It is a highly efficient solution to problems involving contiguous subar...
Join discussion
Nov 22, 2024 · 5 min read · Hey there, welcome to the day 3 of 100 days of DSA challenge. Today, I’ll be solving some advanced array problems. Here's a quick look at the questions I tackled and how I approached them 🤖✨ Check out my GitHub repository for all my solutions and pr...
Join discussion