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

[Hard] 568. Maximum Vacation Days

LeetCode wants to give one of its best employees the option to travel among n cities to collect algorithm problems. But all work and no play makes Jack a dull...
leetcodeharddynamic-programminggraphoptimization

[Medium] 418. Sentence Screen Fitting

Given a rows x cols screen and a sentence represented as a list of strings, return the number of times the given sentence can be fitted on the screen.
leetcodemediumdynamic-programmingstringsimulation

[Easy] 496. Next Greater Element I

The next greater element of some element x in an array is the first greater element that is to the right of x in the same array.
leetcodeeasyarraystackmonotonic-stackhash-table

[Medium] 360. Sort Transformed Array

Given a sorted integer array nums and three integers a, b, and c, apply a quadratic function f(x) = ax² + bx + c to each element nums[i] in the...
leetcodemediumarraytwo-pointersmathparabola

[Hard] 715. Range Module

A Range Module is a module that tracks ranges of numbers. Design a data structure to track the ranges represented as half-open intervals [left, right).
leetcodeharddesigndata-structuresintervalmaptree-map

[Hard] 425. Word Squares

A word square is a sequence of words where the k-th row and k-th column read the same string.
leetcodehardbacktrackingtrierecursionstring

[Easy] 270. Closest Binary Search Tree Value

Given the root of a binary search tree and a target value, return the value in the BST that is closest to the target. If there are multiple answers, print...
leetcodeeasybinary-search-treetreerecursionbinary-search

[Hard] 685. Redundant Connection II

In this problem, a rooted tree is a directed graph such that there is exactly one node (the root) for which all other nodes are descendants of this node, plus...
leetcodehardunion-finddsugraphcycle-detectiondirected-graph

[Medium] 285. Inorder Successor in BST

Given the root of a binary search tree (BST) and a node p in it, return the in-order successor of that node in the BST. If the given node has...
leetcodemediumbinary-search-treetreeinorder-traversal

[Medium] 487. Max Consecutive Ones II

Given a binary array nums, return the maximum number of consecutive 1’s in the array if you can flip at most one 0.
leetcodemediumarraydynamic-programmingsliding-window

Subscribe via RSS to stay updated