SKSudhin Karkiintechgigsudhin20.hashnode.dev·8h ago · 41 min readTheoretical Computer ScienceTheoretical computer science is not mainly about writing code. It is about understanding the fundamental nature of computation. It asks questions such as: What exactly is an algorithm? How do we kno00
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
PGPrakhar Guptainprakhargupta.hashnode.dev·Jul 9 · 33 min readDP on Strings: A Competitive Programmer's GuideString DP is one of the most frequently tested Dynamic Programming topics in Competitive Programming. Although the problems may look different most of them are built on a small number of recurring pat00
AAnnetinhtml-portfolio.hashnode.dev·Jul 6 · 8 min read🧠 Solving My Next 10 Codeforces Problems | Codeforces Journey #2After completing my first 10 Codeforces problems, I continued solving another set of beginner-friendly implementation problems. These problems strengthened my understanding of Python and helped me thi00
KVKunal Vermaindiariesofkunal.hashnode.dev·Jun 30 · 20 min readFrom a Frustration to a Full-Stack AI Platform: The Unfiltered Story of CodeLensXHave you ever opened three browser tabs at the same time? One showing your GitHub contribution graph with its beautiful green squares. One showing your LeetCode solved problem count. And one showing y03S
RRSinrsdev.hashnode.dev·Jun 12 · 8 min readCompetitive Programming Series — Session 2: Recursion and BacktrackingAfter 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 comfortab00
RRSinrsdev.hashnode.dev·Jun 12 · 9 min readCompetitive Programming Series - Session 1: The Foundations You Need Before Solving ProblemsCompetitive 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 cho00
SRSundram Raiinforkspace.hashnode.dev·Apr 30 · 9 min readLLMs 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 appro20
FCFelipe Castilloinopencodex.hashnode.dev·Apr 4 · 9 min readHow to Solve Your First LeetCode Problem: A Beginner's GuideHow 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"00
ASAshdeep Singhininventory-login.hashnode.dev·Mar 30 · 8 min readFrom 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 aro00