leetcode-potd

78. Subsets

leetcode-potd

Given an integer array nums of unique elements, return all possible subsets (the power set). The solution set must not contain duplicate subsets. Return the solution in any order. Example

76. Minimum Window Substring

leetcode-potd

Given two strings s and t of lengths m and n respectively, return the minimum window substring of s such that every character in t (including duplicates) is included in the window. If there is no

75. Sort Colors

leetcode-potd

Given an array nums with n objects colored red, white, or blue, sort them in-place so that objects of the same color are adjacent, with the

58. Length of Last Word

leetcode-potd

Given a string s consisting of words and spaces, return the length of the last word in the string. A word is a maximal substring consisting of non-space

57. Insert Interval

leetcode-potd

You are given an array of non-overlapping intervals intervals where intervals[i] = [starti, endi] represent the start and the end of the ith interval and intervals is sorted

Scroll to Top