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] 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 return its area.
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, return the researcher’s h-index.
leetcodemediumsorting

[Medium] 92. Reverse Linked List II

Given the head of a singly linked list and two integers left and right where left <= right, reverse the nodes of the list from position left to position right...
leetcodemediumlinked-list

[Medium] 1669. Merge In Between Linked Lists

You are given two linked lists: list1 and list2 of sizes n and m respectively. Remove list1’s nodes from the a-th node to the b-th node (0-indexed), and put list2...
leetcodemediumlinked-list

[Medium] 894. All Possible Full Binary Trees

Given an integer n, return a list of all possible full binary trees with n nodes. Each node has value 0. A full binary tree is a tree where every...
leetcodemediumtreerecursionmemoization

Subscribe via RSS to stay updated