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

[Easy] 409. Longest Palindrome

Given a string s which consists of lowercase or uppercase letters, return the length of the longest palindrome that can be built with those letters.
leetcodeeasystringhash-tablegreedy

[Medium] 208. Implement Trie (Prefix Tree)

A trie (pronounced as “try”) or prefix tree is a tree data structure used to efficiently store and retrieve keys in a dataset of strings. There are various applications of...
leetcodemediumstringdesigntrie

[Hard] 732. My Calendar III

A k-booking happens when k events have some non-empty intersection (i.e., there is some time that is common to all k events).
leetcodehardarraybinary-searchdesignsegment-treeordered-set

[Easy] 3110. Score of a String

You are given a string s. The score of a string is defined as the sum of the absolute difference between the ASCII values of adjacent characters.
leetcodeeasystringarray

[Medium] 729. My Calendar I

You are implementing a program to use as your calendar. We can add a new event if adding the event will not cause a double booking.
leetcodemediumarraybinary-searchdesignordered-set

[Hard] 315. Count of Smaller Numbers After Self

You are given an integer array nums and you have to return a new array counts. The array counts has the property where counts[i] is the number of smaller elements...
leetcodehardarraybinary-searchdivide-and-conquerbinary-indexed-treesegment-treemerge-sort

[Hard] 305. Number of Islands II

You are given an empty 2D binary grid grid of size m x n. The grid represents a map where 0’s represent water and 1’s represent land. Initially, all the...
leetcodehardarrayunion-findgraph

[Medium] 802. Find Eventual Safe States

There is a directed graph of n nodes with each node labeled from 0 to n - 1. The graph is represented by a 0-indexed 2D integer array graph where...
leetcodemediumgraphdfscycle-detection

Subscribe via RSS to stay updated