#leetcode

Polling vs WebSockets: How Does the Server Talk Back to You?

You click Submit on LeetCode.

CodeHub Sync: I Built a Chrome Extension to Automatically Sync LeetCode, GFG & HackerRank Solutions…

What if every accepted coding solution you submitted was automatically saved to your GitHub?

LeetCode Diaries #7: Consecutively Humbled — Two solutions and One Existential Crisis Later

Do you ever read a question and think to yourself — ‘Easy, I got this’? Except you really don’t ‘got this’. You had never really ‘got…

LeetCode Diaries #6: Turns Out the Most Optimal Solution isn’t the Most Intuitive One

It finally happened…for problem #6 I did in fact end up asking the powers that be for the best solution.

I Stopped Grinding LeetCode Randomly. Here’s the Sheet That Fixed It.

Open the NeetCode 150 + Blind 75 tracker

LeetCode Diaries #5: I Put a Number in Front of My String and Called It a Day

Let us just hope our private information is not being encoded in the way I solved today’s problem.

Day 2 of my LeetCode Journey

Today I solved these Easy level problems:

LeetCode 371: Sum of Two Integers Explained | Java | Bit Manipulation | Blind 75

Learn how computers add numbers using XOR and Carry operations with visuals, dry runs, and interview tips

LeetCode 268: Missing Number Explained | Java | Bit Manipulation | Blind 75

Have you ever wondered how computers can quickly identify a missing value from a sequence of numbers without sorting or using extra memory?

Leetcode — 39. Combination Sum

題目: Combination Sum 難度: Medium 語言: C++

Scrolling through job postings lately feels a bit discouraging.

As someone actively looking for internships and entry-level roles, I know I’m not alone in this. The tech industry feels crowded, AI is…

Number-of-Unique-xor-Triplets-i

The above link has the better and path wise understanding and explanation of the question 3513 of Leetcode.

LeetCode 190: Reverse Bits Explained | Java | Bit Manipulation | Blind 75

Have you ever wondered how computers reverse the order of bits inside an integer?

LeetCode 191: Number of 1 Bits Explained | Java | Bit Manipulation | Blind 75

Learn the intuition behind Number of 1 Bits using visuals, dry runs, multiple approaches, and interview tips

The LeetCode Shortcut Nobody Tells Beginners About

A pattern-first system for building interview intuition faster — without mistaking memorization for skill

Stop Solving Random LeetCode Problems Before Interviews.

Random practice creates the feeling of progress. Focused preparation builds the judgment, communication, and pattern recognition that…

Construct Binary Search Tree from Preorder Traversal (LeetCode -1008)

Question: Given an array of integers preorder, which represents the preorder traversal of a BST (i.e., binary search tree), construct the…

I Thought I Could Never Crack Google — Until I Realised This

Yesterday, I was solving a coding problem.

How a LeetCode Problem Kept Me Awake at 1:00 am 🫠

GRIND404: I turned my “Passion” for LeetCode into a playable arcade game

DEV Weekend Challenge: Passion Edition Submission

🧠 Why Sliding Window Felt So Simple After Solving Graph Problems

By Sai Pranav Moluguri

Solving 300 LeetCode Problems Won’t Crack FAANG Interview, But This Will

A practical interview prep method for developers who want to stop preparing randomly and start building the exact skills interviewers…

Why LeetCode Python Skills Don’t Predict Production Python Skills

The interview and the job are measuring two different things, and the data backs that up.

Consecutive Differences: Two Ways in Ruby 💎

I ran into a new problem today and discovered a new Ruby method: each_cons.

Linked List Basics in Java

Linked Lists are one of the most fundamental data structures in programming. Unlike arrays, linked lists store elements in separate nodes…

🧠 What I Learned While Solving the “Shortest Path with Alternating Colors” Graph Problem

By Sai Pranav Moluguri

I Spent 30 Minutes Looking for a Trick That Didn’t Exist

Sometimes while solving DSA problems, I feel my brain has its own algorithm.

🧠 What I Learned While Solving the “Find Closest Node to Given Two Nodes” Graph Problem

By Sai Pranav Moluguri

Segment Tree Question Analysis — 3691. Maximum Total Subarray Value II

Intuition

The End of LeetCode? How AI Changed MAANG Interviews in 2026

What developers preparing for 2026 interviews should actually focus on

1846. Maximum Element After Decreasing and Rearranging

🧩 Problem:

3737: Count Subarrays With Majority Element I

Problem Overview

System Design Challenge: How Would You Design LeetCode?

A mock-interview style breakdown of designing coding problems, code execution, queues, runtime workers, caching, and live contest…

I knew I was going insane when I downloaded LeetCode on my phone.

A seriessssss!!!!!

DSA Day 96/250: Task Scheduler (LeetCode 621)

Schedule tasks efficiently with cooling periods using a greedy counting approach.

AlgoPatterns: Learn DSA Through Patterns and Visualizations

A different approach to coding interview prep, focusing on understanding over memorization.

LeetCode Notes: Heap

#23 Merge k Sorted Lists

DSA Day 95/250: Find K Pairs with Smallest Sums (LeetCode 373)

Find the k pairs with the smallest sums using a min heap and sorted array properties.

Took Screenshots — now there is no ESCAPE !

I’m building my profiles. All four of them. At the same time.

DSA Day 94/250: Kth Smallest Element in a Sorted Matrix (LeetCode 378)

Find the kth smallest element efficiently using binary search on answer space.

Stop Solving Random LeetCode Problems. Learn These 25 DSA Patterns Instead.

A few years ago, I thought I had discovered the secret to cracking coding interviews.

The Hidden Complexity of Quicksort

I had already solved the problem using merge sort, but I wanted to give it another shot with quicksort.

DSA Day 93/250: K Closest Points to Origin (LeetCode 973)

Find the k closest points to the origin efficiently using a max heap.

LeetCode 3689: Maximum Total Subarray Value I | From Overthinking to a One-Line Solution

Some LeetCode problems look like they are hiding a Dynamic Programming monster behind a friendly title.

From Beginner to Confident Coder: What LeetCode Taught…

How LeetCode Transformed My Problem-Solving Skills

2196. Create Binary Tree From Descriptions : Step By Step Approach

PROBLEM STATEMENT :

The Algorithm Hidden Inside MS Paint: Understanding Flood Fill with DFS

Most computer science students learn Depth-First Search (DFS) by traversing graphs, visiting nodes, and solving competitive programming…

I Stopped Grinding LeetCode and Started Passing Interviews

You don’t beat the interview by seeing 500 problems. You beat it by recognizing the 15 patterns wearing 500 costumes.

Planting Flowers and Seating Students — Greedy Algorithms for Beginners

If you are new to competitive programming or just starting your algorithms course, greedy problems are a great place to begin. They do not…

Breaking LeetCode: Roman to Integer

I had two solutions to Roman to Integer that are, line for line, the same algorithm. One “beats 98%” on runtime. The other beats about 40%…