VVVidit Vatsindsa-decoded.hashnode.dev·4d ago · 4 min readLC-18 4SumGiven an array nums of n integers, return an array of all the unique quadruplets [nums[a], nums[b], nums[c], nums[d]] such that: 0 <= a, b, c, d < n a, b, c, and d are distinct. nums[a] + nums[b] +00
SSaguninsagunwrites.hashnode.dev·Aug 16 · 6 min readIndexed Addressing ModeIn the previous article, we learned about Base Register Addressing, where the CPU combines a base address with an offset to find the effective address. Now we'll learn about Indexed Addressing Mode, w00
SSSaksham Sahaniinmytsjourney.hashnode.dev·Aug 15 · 4 min read#My Journey into TypeScript: From Loops to LogicIntroduction Learning a new programming language is rarely a linear path. It's a rollercoaster of "I've got this!" and "What on earth is happening?" For me, diving into TypeScript was about more than 00
MSManikandan Sinmanikandan4411.hashnode.dev·Jul 20 · 6 min readArrays in JavaIntroduction When working with Java, you often need to store multiple values of the same data type. Instead of creating separate variables for each value, Java provides Arrays, which allow you to stor00
AAnnetinhtml-portfolio.hashnode.dev·Jul 18 · 5 min read Codeforces Journey #3: Learning Arrays Through Beginner-Friendly ProblemsAfter solving my first 20 Codeforces problems, I decided to focus on one of the most fundamental topics in Data Structures—Arrays. Instead of randomly solving problems, I chose problems that helped me00
AAnnetinhtml-portfolio.hashnode.dev·Jul 16 · 4 min readArrays in Python: A Beginner's Guide to Common OperationsArrays are one of the first data structures every programmer learns. They allow us to store multiple values in a single variable and access them efficiently using indexes. In Python, we commonly use l00
PJPuja Jorwarinpujajorwar.hashnode.dev·Jul 1 · 8 min readFinding Majority Elements (> n/3) — From Brute Force to Boyer-MooreWhen solving array problems, it is easy to stop once your code passes the test cases. But the real learning happens when you push from a working solution to an optimal one. Today, let's look at the Ma00
AAAbstract Algorithmsinabstractalgorithms.hashnode.dev·Jul 2 · 1 min readSliding Window TechniqueThe sliding window technique avoids redundant calculations by keeping track of a subset of elements (the "window") as it moves across an array or string. 📊 How it works Window of size K = 3: ┌───┬───00
AAAbstract Algorithmsinabstractalgorithms.hashnode.dev·Jul 2 · 2 min readTwo Pointers TechniqueThe two pointers technique uses two indices to iterate over a data structure (typically an array or a linked list) to solve problems with optimal time complexity. It is commonly used to find pairs in 00
PJPuja Jorwarinpujajorwar.hashnode.dev·Jun 30 · 7 min readNext Permutation — The 3-Step Algorithm That Made Everything ClickMost solutions I found online just showed me code with zero explanation of why it works.After solving this problem, I finally understood the pattern. Let me save you the confusion. 📖 First — What is00
