Leetcode 90: Subsets II
Question
Given a collection of integers that might contain duplicates, nums, return all possible subsets (the power set).
[Read More]
-
-
Leetcode 89: Gray Code
Question The gray code is a binary numeral system where two successive values differ in only one bit. [Read More] -
Leetcode 88: Merge Sorted Array
Question Given two sorted integer arrays nums1 and nums2, merge nums2 into nums1 as one sorted array. [Read More] -
Leetcode 86: Partition List
Question Given a linked list and a value x, partition it such that all nodes less than x come before nodes greater than or equal to x. [Read More] -
Leetcode 82: Remove Duplicates from Sorted List II
Question Given a sorted linked list, delete all nodes that have duplicate numbers, leaving only distinct numbers from the original list. [Read More] -
Leetcode 81: Search in Rotated Sorted Array II
Question Suppose an array sorted in ascending order is rotated at some pivot unknown to you beforehand. [Read More] -
Leetcode 79: Word Search
Question Given a 2D board and a word, find if the word exists in the grid. [Read More] -
Leetcode 78: Subsets
Question Given a set of distinct integers, nums, return all possible subsets (the power set). [Read More] -
Leetcode 77: Combinations
Question Given two integers n and k, return all possible combinations of k numbers out of 1 … n. [Read More] -
Leetcode 75: Sort Colors
Question Given an array with n objects colored red, white or blue, sort them in-place so that objects of the same color are adjacent, with the colors in the order red, white and blue. [Read More] -
Leetcode 240: Search a 2D Matrix II
Question Write an efficient algorithm that searches for a value in an m x n matrix. This matrix has the following properties: [Read More] -
Leetcode 74: Search a 2D Matrix
Question Write an efficient algorithm that searches for a value in an m x n matrix. This matrix has the following properties: [Read More] -
Leetcode 73: Set Matrix Zeroes
Question Given a m x n matrix, if an element is 0, set its entire row and column to 0. Do it in-place. [Read More] -
Leetcode 71: Simplify Path
Question Given an absolute path for a file (Unix-style), simplify it. [Read More] -
Leetcode 64: Minimum Path Sum
Question Given a m x n grid filled with non-negative numbers, find a path from top left to bottom right which minimizes the sum of all numbers along its path. [Read More]