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] 382. Linked List Random Node

Given a singly linked list, return a random node’s value. Each node must have an equal probability of being chosen.
leetcodemediumlinked-listrandomized

[Medium] 1328. Break a Palindrome

Given a palindromic string palindrome, replace exactly one character to make it not a palindrome, and make the resulting string the lexicographically smallest possible. Return the result, or an empty...
leetcodemediumstringgreedy

[Medium] 73. Set Matrix Zeroes

Given an m x n integer matrix, if an element is 0, set its entire row and column to 0. You must do it in place.
leetcodemediummatrixarray

[Medium] 261. Graph Valid Tree

Given n nodes labeled 0 to n-1 and a list of undirected edges, determine if these edges form a valid tree.
leetcodemediumgraphdsudfs

[Medium] 260. Single Number III

Given an integer array nums where exactly two elements appear once and all other elements appear exactly twice, find the two elements that appear only once. Return them in any...
leetcodemediumbit-manipulation

[Medium] 1870. Minimum Speed to Arrive on Time

You are given n train rides with distances dist[i]. Each train departs at an integer hour, so you must wait until the next whole hour to board the next train...
leetcodemediumbinary-search

[Medium] 1188. Design Bounded Blocking Queue

Implement a thread-safe bounded blocking queue with the following methods: BoundedBlockingQueue(int capacity) – initialize with max capacity void enqueue(int element) – add element to the back; blocks if the queue...
leetcodemediumconcurrencydesign

Subscribe via RSS to stay updated