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] 1029. Two City Scheduling

A company is planning to interview 2n people. Given the array costs where costs[i] = [aCosti, bCosti], the cost of flying the i-th person to city a is aCosti, and...
leetcodemediumarraygreedysorting

[Hard] 135. Candy

There are n children standing in a line. Each child is assigned a rating value given in the integer array ratings.
leetcodehardarraygreedy

[Easy] 1710. Maximum Units on a Truck

You are assigned to put some amount of boxes onto one truck. You are given a 2D array boxTypes, where boxTypes[i] = [numberOfBoxesi, numberOfUnitsPerBoxi]:
leetcodeeasyarraygreedysorting

[Easy] 561. Array Partition

Given an integer array nums of 2n integers, group these integers into n pairs (a1, b1), (a2, b2), ..., (an, bn) such that the sum of min(ai, bi) for all...
leetcodeeasyarraygreedysorting

[Easy] 392. Is Subsequence

Given two strings s and t, return true if s is a subsequence of t, or false otherwise.
leetcodeeasystringtwo-pointersgreedydynamic-programming

Subscribe via RSS to stay updated