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] 912. Sort an Array

Given an array of integers nums, sort the array in ascending order and return it.
leetcodealgorithmmediumcppsortingmerge-sortheap-sortcounting-sortdata-structuresdivide-conquerproblem-solving

[Hard] 218. The Skyline Problem

A city’s skyline is the outer contour of the silhouette formed by all the buildings in that city when viewed from a distance. Given the locations and heights of all...
leetcodealgorithmhardcppsweep-linepriority-queuedata-structuresunion-findproblem-solving

[Medium] 990. Satisfiability of Equality Equations

You are given an array of strings equations that represent relationships between variables. Each string equations[i] is of length 4 and takes one of two different forms: "xi==yi" or "xi!=yi"....
leetcodealgorithmdata-structuresdisjoint-setgraphdfsmediumcppconnected-componentsgraph-coloringproblem-solving

[Medium] 96. Unique Binary Search Trees

Given an integer n, return the number of structurally unique BST’s (binary search trees) that have exactly n nodes with values from 1 to n.
leetcodealgorithmdynamic-programmingdata-structuresmathcatalan-numbersmediumcppbinary-search-treesproblem-solving

[Medium] 131. Palindrome Partitioning

Given a string s, partition s such that every substring of the partition is a palindrome. Return all possible palindrome partitioning of s.
leetcodealgorithmbacktrackingdata-structuresstringpalindromerecursionmediumcpppartitioningproblem-solving

[Medium] 77. Combinations

This is a classic backtracking problem that requires generating all possible combinations of k numbers chosen from the range [1, n]. The key insight is using DFS with backtracking to...
leetcodealgorithmbacktrackingdata-structuresrecursionmediumcppcombinationsdfsproblem-solving

[Medium] 89. Gray Code

An n-bit gray code sequence is a sequence of 2^n integers where:
leetcodealgorithmbacktrackingdata-structuresrecursionbit-manipulationmediumcppgray-codeproblem-solving

[Medium] 54. Spiral Matrix

Given an m x n matrix, return all elements of the matrix in spiral order.
leetcodealgorithmmatrixdata-structuressimulationtraversalmediumcppspiral-matrixproblem-solving

[Medium] 50. Pow(x, n)

Implement pow(x, n), which calculates x raised to the power n (i.e., x^n).
leetcodealgorithmmathdata-structuresrecursionbit-manipulationmediumcpppowproblem-solving

[Medium] 62. Unique Paths

This is a classic dynamic programming problem that requires finding the number of unique paths from top-left to bottom-right of a grid. The key insight is recognizing the overlapping subproblems...
leetcodealgorithmdynamic-programmingdata-structuresgridcombinatoricsmediumcppunique-pathsproblem-solving

Subscribe via RSS to stay updated