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] 393. UTF-8 Validation

Given an integer array data representing the data, return whether it is a valid UTF-8 encoding (i.e., it translates to a sequence of valid UTF-8 encoded characters).
leetcodemediumbit-manipulationstringarray

[Hard] 568. Maximum Vacation Days

LeetCode wants to give one of its best employees the option to travel among n cities to collect algorithm problems. But all work and no play makes Jack a dull...
leetcodeharddynamic-programminggraphoptimization

[Medium] 418. Sentence Screen Fitting

Given a rows x cols screen and a sentence represented as a list of strings, return the number of times the given sentence can be fitted on the screen.
leetcodemediumdynamic-programmingstringsimulation

[Easy] 496. Next Greater Element I

The next greater element of some element x in an array is the first greater element that is to the right of x in the same array.
leetcodeeasyarraystackmonotonic-stackhash-table

[Medium] 360. Sort Transformed Array

Given a sorted integer array nums and three integers a, b, and c, apply a quadratic function f(x) = ax² + bx + c to each element nums[i] in the...
leetcodemediumarraytwo-pointersmathparabola

[Hard] 715. Range Module

A Range Module is a module that tracks ranges of numbers. Design a data structure to track the ranges represented as half-open intervals [left, right).
leetcodeharddesigndata-structuresintervalmaptree-map

[Hard] 425. Word Squares

A word square is a sequence of words where the k-th row and k-th column read the same string.
leetcodehardbacktrackingtrierecursionstring

[Easy] 270. Closest Binary Search Tree Value

Given the root of a binary search tree and a target value, return the value in the BST that is closest to the target. If there are multiple answers, print...
leetcodeeasybinary-search-treetreerecursionbinary-search

Subscribe via RSS to stay updated