Tag feed

#competitive-programming

487 posts558 followers

Explore Hashnode

Alternatives

Trending tags this week

RRSrsdev.hashnode.devJun 12 · 8 min read

Competitive Programming Series — Session 2: Recursion and Backtracking

After covering the foundational building blocks in Session 1, the next step is one of the most important problem-solving techniques in all of programming: recursion. And once recursion feels comfortab

0

RRSrsdev.hashnode.devJun 12 · 9 min read

Competitive Programming Series - Session 1: The Foundations You Need Before Solving Problems

Competitive programming often looks like a race to write code as fast as possible. But the real secret is simpler: the best competitive programmers are not just faster typists — they are better at cho

0

SRSundram Raiforkspace.hashnode.devApr 30 · 9 min read

LLMs are terrible at generating correct test cases. Here's the architecture that actually works.

I want to start with the mistake, because that's where the real lesson is. When I first added hidden test generation to ForkSpace — my real-time collaborative DSA practice platform — the obvious appro

0

FCFelipe Castilloopencodex.hashnode.devApr 4 · 9 min read

How to Solve Your First LeetCode Problem: A Beginner's Guide

How to Solve Your First LeetCode Problem: A Beginner's Guide LeetCode has become the favorite playground for developers preparing for technical interviews. With over 3,500 problems ranging from "easy"

0

ASAshdeep Singhinventory-login.hashnode.devMar 30 · 8 min read

From 900 → 1200: I wasn’t stuck because CP is hard. I was stuck because I was doing it productively wrong.

“Convenience is the fastest way to stay weak.” This is not a clean “how to reach 1200” guide. It’s not motivation either. This is just me looking back at what actually changed between being stuck aro

0

MSMuppidi Srinivassrinivastechblog.hashnode.devFeb 23 · 11 min read

Mastering Fenwick Tree for Competitive Programming

While reading, don’t overthink or get stuck. Just follow along with the flow—you’ll understand everything step by step as we go. Given ArrayIndex : 0 1 2 3 4 5 6Array : 3 2

0

MSMuppidi Srinivassrinivastechblog.hashnode.devFeb 21 · 10 min read

Mo’s Algorithm – Step by Step Guide

Mo’s Algorithm is a technique used to answer range queries efficiently on arrays You are given : An array A Many queries: [L, R] Each query asks something like : sum of elements number of dis

0

MSMuppidi Srinivassrinivastechblog.hashnode.devFeb 21 · 6 min read

Efficient Range Queries Using Sqrt Decomposition

Square Root Decomposition is a technique used to answer range queries efficiently. When do we use it? When you have : An array A[0…N-1] Many queries like : Sum of range [L, R] Min/Max in range C

0

MSMuppidi Srinivassrinivastechblog.hashnode.devFeb 16 · 7 min read

Essential Math Algorithms for Competitive Coding

Binary Exponentiation : is a fast method to calculate powers like aⁿ , without multiplying a again and again n times. Instead of O(n) multiplications, it works in O(log n) time. Idea Behind Binary Exponentiation We use two simple observations : If po...

0

MSMuppidi Srinivassrinivastechblog.hashnode.devFeb 14 · 4 min read

Sweep Line Technique : The Secret Weapon for Range & Geometry Problems , Part-2

Sweep Line Ideas : Question :-Given N Intervals Of The Form -> L,RN<=10^5L,R <= 10^9 1 - Find Union Of All :The union of two sets contains all elements from both sets, with common elements included only once Example :Intervals : [1,5] [3,7] Numb...

0

#competitive-programming

Search Hashnode

#competitive-programming

Explore Hashnode

Trending tags this week

Competitive Programming Series — Session 2: Recursion and Backtracking

Competitive Programming Series - Session 1: The Foundations You Need Before Solving Problems

LLMs are terrible at generating correct test cases. Here's the architecture that actually works.

How to Solve Your First LeetCode Problem: A Beginner's Guide

From 900 → 1200: I wasn’t stuck because CP is hard. I was stuck because I was doing it productively wrong.

Mastering Fenwick Tree for Competitive Programming

Mo’s Algorithm – Step by Step Guide

Efficient Range Queries Using Sqrt Decomposition

Essential Math Algorithms for Competitive Coding

Sweep Line Technique : The Secret Weapon for Range & Geometry Problems , Part-2