Welcome to My Technical Blog

Exploring algorithms, data structures, and software engineering insights through detailed LeetCode problem solutions

169+ Problems Solved
3 Difficulty Levels
20+ Categories

Latest Posts

[Medium] 221. Maximal Square

Given an m x n binary matrix filled with '0's and '1's, find the largest square containing only '1's and...
leetcodemediumdynamic-programming

[Medium] 274. H-Index

Given an array of integers citations where citations[i] is the number of citations a researcher received for their i-th paper,...
leetcodemediumsorting

All Posts

[Medium] 189. Rotate Array

Given an integer array nums, rotate the array to the right by k steps, where k is non-negative.
leetcodemediumarray

Algorithm Templates: Search

This page collects ready-to-use C++ templates for every major binary search pattern you’ll encounter on LeetCode — from basic sorted-array lookup to rotated arrays, 2D matrices, and “search on the...
leetcodetemplatessearchbinary-search

[Hard] 327. Count of Range Sum

Given an integer array nums and two integers lower and upper, return the number of range sums that lie in [lower, upper] inclusive.
leetcodehardarraydivide-and-conquer

[Medium] 1701. Average Waiting Time

There is a restaurant with a single chef. You are given an array customers, where customers[i] = [arrival_i, time_i]:
leetcodemediumarraysimulation

[Easy] 645. Set Mismatch

You have a set of integers s, which originally contains all the numbers from 1 to n. Unfortunately, due to some error, one of the numbers in s got duplicated...
leetcodeeasyarrayhash-tablemath

[Easy] 409. Longest Palindrome

Given a string s which consists of lowercase or uppercase letters, return the length of the longest palindrome that can be built with those letters.
leetcodeeasystringhash-tablegreedy

[Easy] 349. Intersection of Two Arrays

Given two integer arrays nums1 and nums2, return an array of their intersection. Each element in the result must be unique and you may return the result in any order....
leetcodeeasyarrayhash-table

Subscribe via RSS to stay updated