Welcome to My Technical Blog

Exploring algorithms, data structures, and software engineering insights through LeetCode solutions in Python.

169+ Problems Solved
3 Difficulty Levels
20+ Categories

Latest Posts

All Posts

[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

[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

[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

Subscribe via RSS to stay updated