Coding Problems
Unique Paths
MediumCount unique paths from top-left to bottom-right of mxn grid
Decode Ways
MediumCount ways to decode numeric string to letters (A=1, B=2,...Z=26)
Generate Parentheses
MediumGenerate all valid combinations of n pairs of parentheses
Word Search
MediumCheck if word exists in 2D board (adjacent letters)
Find length of longest strictly increasing subsequence
Climbing Stairs
EasyCount distinct ways to climb n stairs (1 or 2 steps at a time)
Maximum Subarray
EasyFind contiguous subarray with largest sum (Kadane's Algorithm)
Pow(x, n)
MediumImplement pow(x, n) that calculates x raised to the power n
Design TinyURL
MediumDesign a URL shortening service that encodes and decodes URLs
Product of Array Except Self
MediumReturn an array where each element is the product of all elements except itself
Coin Change
MediumCompute the fewest number of coins needed to make up an amount
Subarray Sum Equals K
MediumFind the total number of continuous subarrays whose sum equals to k
Kth Smallest Element in BST
MediumFind the kth smallest element in a binary search tree
Implement Queue using Stacks
MediumImplement a queue using two stacks with push, pop, peek, and empty operations
Find maximum path sum in binary tree