Search for a command to run...
Series
A journey through Leetcode! In this series, I will solve two Leetcode problems per post, breaking them down with explanations, approaches, and optimizations. Perfect for anyone looking to improve their problem-solving skills.
Leetcode #10 Regular Expression Matching 📌 Problem Statement Given an input string s and a pattern p, implement regular expression matching with support for:- . Matches any single character.- Matches *zero or more of the preceding element**.- The ma...
Leetcode #39 Combination Sum 📌 Problem Statement Given a set of distinct positive integers candidates and a target integer target, find all unique combinations in candidates where the chosen numbers sum to target. Constraints: A number may be chose...
Leetcode #16 3 Sum Closest 📌 Problem Statement Given an array of integers nums and a target integer target, find three integers in nums such that the sum is closest to target. Constraints: Each number in nums can be used only once in a triplet. Th...
Leetcode #47 Permutations II 📌 Problem Statement Given a collection of numbers, nums, that might contain duplicates, return all possible unique permutations in any order. Constraints: Each number in nums can be used only once per permutation. The ...
Leetcode #50 Pow(x, n) 📌 Problem Statement Implement the function mypow(x, n), which calculates x^n (x raised to the power of n). Constraints −100.0<x<100.0 −2^31≤n≤2^31−1 x^n will be within the range of a 32-bit signed floating-point number. �...
Leetcode #54 Spiral Matrix 📌 Problem Statement Given an m x n matrix, return all elements of the matrix in spiral order. Constraints m==matrix.length n==matrix[i].length 1≤m,n≤10 −100≤matrix[i][j]≤100 🚀 Code Implementation class Solution(obje...