Welcome to My Technical Blog

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

313+ 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

All Posts

[Medium] 1856. Maximum Sum of Minimum Product

The minimum product of a subarray is the minimum value in the subarray multiplied by the sum of the subarray.
leetcodealgorithmmediumjavastackmonotonic-stackprefix-sumproblem-solving

[Medium] 316. Remove Duplicate Letters

Given a string s, remove duplicate letters so that every letter appears once and only once. You must make sure your result is the smallest in lexicographical order among all...
leetcodealgorithmmediumjavastackmonotonic-stackgreedyproblem-solving

[Medium] 648. Replace Words

In English, we have a concept called root, which can be followed by some other word to form another longer word. Let’s call this word successor. For example, when the...
leetcodealgorithmmediumjavatriehash-setstring-processingproblem-solving

[Medium] 503. Next Greater Element II

Given a circular integer array nums (i.e., the next element of nums[nums.length - 1] is nums[0]), return the next greater number for every element in nums.
leetcodealgorithmmediumjavamonotonic-stackstackproblem-solving

[Medium] 2466. Count Ways To Build Good Strings

Given the integers zero, one, low, and high, we can construct a string by starting with an empty string, and then at each step perform either of the following:
leetcodealgorithmmediumjavadynamic-programmingdpproblem-solving

[Medium] 494. Target Sum

You are given an integer array nums and an integer target.
leetcodealgorithmmediumjavadynamic-programmingdpsubset-sumproblem-solving

Subscribe via RSS to stay updated