Recent Blogs

Finding the maximum subset sum divisible by 3 might sound complex, but with a clever use of modulo arithmetic, it becomes easy and efficient. Instead of checking every possible subset, we calculate the total sum and only remove the smallest necessary values to make it divisible by 3. This smart greedy approach reduces the complexity to linear time while ensuring we get the largest valid sum.

Finding the maximum subset sum divisible by 3 might sound complex, but with a clever use of modulo arithmetic, it becomes easy and efficient. Instead of checking every possible subset, we calculate the total sum and only remove the smallest necessary values to make it divisible by 3. This smart greedy approach reduces the complexity to linear time while ensuring we get the largest valid sum.

Given an array of integers nums of length n and an integer k. The task is to select exactly k distinct, non-empty subarrays from nums (subarrays can overlap, but each subarray can only be selected once), and maximize the total value, where the value of a subarray nums[l..r] = max(nums[l..r]) - min(nums[l..r])

Given an array of integers nums of length n and an integer k. The task is to select exactly k distinct, non-empty subarrays from nums (subarrays can overlap, but each subarray can only be selected once), and maximize the total value, where the value of a subarray nums[l..r] = max(nums[l..r]) - min(nums[l..r])

It covers the 468th LeetCode Weekly Contest held on September 21, 2025. It includes clear explanations and step-by-step solutions for all problems — from ‘Bitwise OR of Even Numbers in an Array’ to ‘Maximum Total Subarray Value II.’ Whether you’re revising approaches, understanding problem patterns, or looking for clean code implementations, this walkthrough provides simple yet detailed insights into each solution

A concise guide solving LeetCode Weekly Contest 477 using prefix sums, XOR tricks, subarray logic, and smart optimization techniques. The problems include concatenating non-zero digits, finding the maximum balanced XOR subarray length, and determining the number of effective subsequences.

This blog covers the 144th LeetCode Weekly Contest, which featured four problems ranging from string manipulation to tree operations. The problems included: ‘Defanging an IP Address,’ ‘Corporate Flight Bookings,’ ‘Delete Nodes and Return Forest,’ and ‘Maximum Nesting Depth of Two Valid Parentheses Strings.’ In this write-up, I provide clear problem statements, intuitive approaches, and efficient C++ solutions with explanations. Whether you’re preparing for future contests or revising concepts like prefix sums, tree traversal, or parentheses depth balancing, this blog serves as a simple and detailed guide.

To validate that created partially filled sudoku board is valid or not

An ed-tech SaaS built with Next.js and Supabase, providing credit-based multiplayer quizzes, AI-powered tutors, and adaptive learning modules. With features like Quizzes, leaderboards, and referral systems, future updates will expand into a comprehensive platform for interactive, gamified, and multilingual learning experiences.