Leetcode 48: Rotate Image
Question
You are given an n x n 2D matrix representing an image.
[Read More]
-
-
Leetcode 37: Sudoku Solver
Question Write a program to solve a Sudoku puzzle by filling the empty cells. [Read More] -
Leetcode 40: Combination Sum II
Question Given a collection of candidate numbers (candidates) and a target number (target), find all unique combinations in candidates where the candidate numbers sums to target. [Read More] -
Leetcode 33: Search in Rotated Sorted Array
Question Suppose an array sorted in ascending order is rotated at some pivot unknown to you beforehand. [Read More] -
Leetcode 32: Longest Valid Parentheses
Question Given a string containing just the characters ‘(‘ and ‘)’, find the length of the longest valid (well-formed) parentheses substring. [Read More] -
Leetcode 70: Climbing Stairs
Question You are climbing a stair case. It takes n steps to reach to the top. [Read More] -
Leetcode 69: Sqrt(x)
Question Implement int sqrt(int x). [Read More] -
Leetcode 67: Add Binary
Question Given two binary strings, return their sum (also a binary string). [Read More] -
Leetcode 58: Length of Last Word
Question [Read More] -
Leetcode 53: Maximum Subarray
Question Given an integer array nums, find the contiguous subarray (containing at least one number) which has the largest sum and return its sum. [Read More] -
Leetcode 46: Permutations
Question Given a collection of distinct integers, return all possible permutations. [Read More] -
Leetcode 31: Next Permutation
Question Implement next permutation, which rearranges numbers into the lexicographically next greater permutation of numbers. [Read More] -
Leetcode 30: Substring with Concatenation of All Words
Question You are given a string, s, and a list of words, words, that are all of the same length. Find all starting indices of substring(s) in s that is a concatenation of each word in words exactly once and without any intervening characters. [Read More] -
Leetcode 39: Combination Sum
Question Given a set of candidate numbers (candidates) (without duplicates) and a target number (target), find all unique combinations in candidates where the candidate numbers sums to target. [Read More] -
Leetcode 38: Count and Say
Question The count-and-say sequence is the sequence of integers with the first five terms as following: 1. 1 2. 11 3. 21 4. 1211 5. 111221 1 is read off as “one 1” or 11. [Read More]