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] 310. Minimum Height Trees

A tree is an undirected graph in which any two vertices are connected by exactly one path. In other words, any connected graph without simple cycles is a tree.
leetcodemediumgraphtreetopological-sortbfs

[Hard] 269. Alien Dictionary

There is a new alien language that uses the English alphabet. However, the order among the letters is unknown to you.
leetcodehardgraphtopological-sortstring

[Medium] 79. Word Search

Given an m x n grid of characters board and a string word, return true if word exists in the grid.
leetcodemediumarraybacktrackingmatrixdfs

[Medium] 22. Generate Parentheses

Given n pairs of parentheses, write a function to generate all combinations of well-formed parentheses.
leetcodemediumstringbacktrackingrecursion

[Hard] 51. N-Queens

The n-queens puzzle is the problem of placing n queens on an n x n chessboard such that no two queens attack each other.
leetcodehardarraybacktrackingrecursion

[Easy] 844. Backspace String Compare

Given two strings s and t, return true if they are equal when both are typed into empty text editors. '#' means a backspace character.
leetcodeeasystringtwo-pointersstack

[Medium] 721. Accounts Merge

Given a list of accounts where each element accounts[i] is a list of strings, where the first element accounts[i][0] is a name, and the rest of the elements are emails...
leetcodemediumarrayhash-tablestringunion-finddfs

[Medium] 64. Minimum Path Sum

Given a m x n grid filled with non-negative numbers, find a path from top-left to bottom-right, which minimizes the sum of all numbers along its path.
leetcodemediumarraydynamic-programmingmatrix

Subscribe via RSS to stay updated