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

LeetCode 134. Gas Station

There are n gas stations along a circular route. Station i has gas[i] units of gas. It costs cost[i] units...
leetcodemediumgreedyarray

LeetCode 1197. Minimum Knight Moves

In an infinite chess board with coordinates from -infinity to +infinity, a knight starts at (0, 0). Return the minimum...
leetcodemediumbfs

LeetCode 1146. Snapshot Array

Implement a SnapshotArray that supports: SnapshotArray(int length) – initializes an array of the given length (all zeros) void set(index, val)...
leetcodemediumdesignbinary-search

All Posts

[Medium] 494. Target Sum

[Medium] 494. Target Sum
leetcodealgorithmmediumcppdynamic-programmingdpsubset-sumproblem-solving

Subscribe via RSS to stay updated