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] 560. Subarray Sum Equals K

Given an array of integers nums and an integer k, return the total number of subarrays whose sum equals to k.
leetcodemediumarrayhash-tableprefix-sum

[Hard] 44. Wildcard Matching

Given an input string (s) and a pattern (p), implement wildcard pattern matching with support for '?' and '*' where:
leetcodehardstringdynamic-programminggreedytwo-pointers

[Medium] 981. Time Based Key-Value Store

Design a time-based key-value data structure that can store multiple values for the same key at different timestamps and retrieve the key’s value at a certain timestamp.
leetcodemediumhash-tablebinary-searchdesign

[Easy] 35. Search Insert Position

Given a sorted array of distinct integers and a target value, return the index if the target is found. If not, return the index where it would be if it...
leetcodeeasyarraybinary-search

[Medium] 739. Daily Temperatures

Given an array of integers temperatures representing the daily temperatures, return an array answer such that answer[i] is the number of days you have to wait after the i-th day...
leetcodemediumarraystackmonotonic-stack

[Medium] 238. Product of Array Except Self

Given an integer array nums, return an array answer such that answer[i] is equal to the product of all the elements of nums except nums[i].
leetcodemediumarrayprefix-sumtwo-pointers

Subscribe via RSS to stay updated