Files

icons
scripts
- algorithms
  - 0-9
  - A
  - B
  - C
  - D
  - E
  - F
  - G
  - H
  - I
  - J
  - K
  - L
  - M
  - N
  - O
  - P
  - Q
  - R
  - S
    - Same Tree
    - Satisfiability of Equality Equations
    - Score After Flipping Matrix
    - Score of Parentheses
    - Scramble String
    - Search Insert Position
    - Search Suggestions System
    - Search a 2D Matrix II
    - Search a 2D Matrix
    - Search in Rotated Sorted Array II
    - Search in Rotated Sorted Array
    - Search in a Binary Search Tree
    - Seat Reservation Manager
    - Second Largest Digit in a String
    - Second Minimum Node In a Binary Tree
    - Second Minimum Time to Reach Destination
    - Self Crossing
    - Self Dividing Numbers
    - Sell Diminishing-Valued Colored Balls
    - Sell DiminishingValued Colored Balls
    - Selling Pieces of Wood
    - Sender With Largest Word Count
    - Sentence Similarity III
    - Sequential Digits
    - Sequentially Ordinal Rank Tracker
    - Serialize and Deserialize BST
    - Serialize and Deserialize Binary Tree
    - Set Intersection Size At Least Two
    - Set Matrix Zeroes
    - Set Mismatch
    - Shift 2D Grid
    - Shifting Letters
    - Shopping Offers
    - Short Encoding of Words
    - Shortest Bridge
    - Shortest Common Supersequence
    - Shortest Completing Word
    - Shortest Distance to a Character
    - Shortest Impossible Sequence of Rolls
    - Shortest Palindrome
    - Shortest Path Visiting All Nodes
    - Shortest Path in Binary Matrix
    - Shortest Path in a Grid with Obstacles Elimination
    - Shortest Path to Get All Keys
    - Shortest Path with Alternating Colors
    - Shortest Subarray to be Removed to Make Array Sorted
    - Shortest Subarray with Sum at Least K
    - Shortest Unsorted Continuous Subarray
    - Shuffle String
    - Shuffle an Array
    - Shuffle the Array
    - Sign of the Product of an Array
    - Similar String Groups
    - Simple Bank System
    - Simplified Fractions
    - Simplify Path
    - Single Element in a Sorted Array
    - Single Number II
    - Single Number III
    - Single Number
    - Single-Threaded CPU
    - SingleThreaded CPU
    - Sliding Puzzle
    - Sliding Window Maximum
    - Sliding Window Median
    - Slowest Key
    - Smallest Good Base
    - Smallest Index With Equal Value
    - Smallest Integer Divisible by K
    - Smallest K-Length Subsequence With Occurrences of a Letter
    - Smallest Missing Genetic Value in Each Subtree
    - Smallest Number in Infinite Set
    - Smallest Range Covering Elements from K Lists
    - Smallest Range I
    - Smallest Range II
    - Smallest Rotation with Highest Score
    - Smallest String Starting From Leaf
    - Smallest String With A Given Numeric Value
    - Smallest String With Swaps
    - Smallest Subsequence of Distinct Characters
    - Smallest Subtree with all the Deepest Nodes
    - Smallest Sufficient Team
    - Smallest Value of the Rearranged Number
    - Snakes and Ladders
    - Snapshot Array
    - Solve the Equation
    - Solving Questions With Brainpower
    - Sort Array By Parity II
    - Sort Array By Parity
    - Sort Array by Increasing Frequency
    - Sort Characters By Frequency
    - Sort Colors
    - Sort Even and Odd Indices Independently
    - Sort Integers by The Number of 1 Bits
    - Sort Integers by The Power Value
    - Sort Items by Groups Respecting Dependencies
    - Sort List
    - Sort an Array
    - Sort the Jumbled Numbers
    - Sort the Matrix Diagonally
    - Sorting the Sentence
    - Soup Servings
    - Special Array With X Elements Greater Than or Equal X
    - Special Binary String
    - Special Positions in a Binary Matrix
    - Spiral Matrix II
    - Spiral Matrix III
    - Spiral Matrix IV
    - Spiral Matrix
    - Split Array Largest Sum
    - Split Array With Same Average
    - Split Array into Consecutive Subsequences
    - Split Array into Fibonacci Sequence
    - Split Linked List in Parts
    - Split Two Strings to Make Palindrome
    - Split a String Into the Max Number of Unique Substrings
    - Split a String in Balanced Strings
    - Splitting a String Into Descending Consecutive Values
    - Sqrt(x)
    - Squares of a Sorted Array
    - Stamping The Sequence
    - Stamping the Grid
    - Statistics from a Large Sample
    - Step-By-Step Directions From a Binary Tree Node to Another
    - StepByStep Directions From a Binary Tree Node to Another
    - Steps to Make Array Non-decreasing
    - Stickers to Spell Word
    - Stock Price Fluctuation
    - Stone Game II
    - Stone Game III
    - Stone Game IV
    - Stone Game IX
    - Stone Game V
    - Stone Game VI
    - Stone Game VII
    - Stone Game VIII
    - Stone Game
    - Strange Printer II
    - Strange Printer
    - Stream of Characters
    - String Compression II
    - String Compression
    - String Matching in an Array
    - String Without AAA or BBB
    - String to Integer (atoi)
    - String to Integer atoi
    - Strong Password Checker II
    - Strong Password Checker
    - Student Attendance Record I
    - Student Attendance Record II
    - Subarray Product Less Than K
    - Subarray Sum Equals K
    - Subarray Sums Divisible by K
    - Subarray With Elements Greater Than Varying Threshold
    - Subarrays with K Different Integers
    - Subdomain Visit Count
    - Subrectangle Queries
    - Subsets II
      - README.md
      - Subsets II.cpp
      - Subsets II.java
      - Subsets II.js
      - Subsets II.py
      - info.json
    - Subsets
    - Substring With Largest Variance
    - Substring with Concatenation of All Words
    - Substrings of Size Three with Distinct Characters
    - Subtract the Product and Sum of Digits of an Integer
    - Subtree of Another Tree
    - Successful Pairs of Spells and Potions
    - Sudoku Solver
    - Sum Game
    - Sum Root to Leaf Numbers
    - Sum of Absolute Differences in a Sorted Array
    - Sum of All Odd Length Subarrays
    - Sum of All Subset XOR Totals
    - Sum of Beauty in the Array
    - Sum of Beauty of All Substrings
    - Sum of Digits in Base K
    - Sum of Digits of String After Convert
    - Sum of Distances in Tree
    - Sum of Even Numbers After Queries
    - Sum of Floored Pairs
    - Sum of Left Leaves
    - Sum of Mutated Array Closest to Target
    - Sum of Nodes with Even-Valued Grandparent
    - Sum of Nodes with EvenValued Grandparent
    - Sum of Numbers With Units Digit K
    - Sum of Root To Leaf Binary Numbers
    - Sum of Scores of Built Strings
    - Sum of Square Numbers
    - Sum of Subarray Minimums
    - Sum of Subarray Ranges
    - Sum of Subsequence Widths
    - Sum of Total Strength of Wizards
    - Sum of Two Integers
    - Sum of Unique Elements
    - Sum of k-Mirror Numbers
    - Summary Ranges
    - Super Egg Drop
    - Super Palindromes
    - Super Pow
    - Super Ugly Number
    - Super Washing Machines
    - Surface Area of 3D Shapes
    - Surrounded Regions
    - Swap Adjacent in LR String
    - Swap For Longest Repeated Character Substring
    - Swap Nodes in Pairs
    - Swapping Nodes in a Linked List
    - Swim in Rising Water
    - Symmetric Tree
    - README.md
  - T
  - U
  - V
  - W
  - X
  - Z
  - README.md
- concurrency
- database
- shell
- README.md
LICENSE
README.md

Subsets II

AnasImloul

Runtime: 25 ms (Top 5.31%) | Memory: 8.3 MB (Top 35.96%)

Sep 7, 2022

abc0221 · Sep 7, 2022

History

This branch is 2510 commits behind AnasImloul/Leetcode-Solutions:main.

Name	Name	Last commit message	Last commit date
parent directory ..
README.md	README.md	Added problem description	Aug 21, 2022
Subsets II.cpp	Subsets II.cpp	Runtime: 25 ms (Top 5.31%) \| Memory: 8.3 MB (Top 35.96%)	Sep 7, 2022
Subsets II.java	Subsets II.java	Updated Project format	Aug 17, 2022
Subsets II.js	Subsets II.js	Runtime: 125 ms (Top 19.54%) \| Memory: 44.7 MB (Top 48.96%)	Aug 31, 2022
Subsets II.py	Subsets II.py	Updated Project format	Aug 17, 2022
info.json	info.json	Updated Project format	Aug 17, 2022

README.md

90. Subsets II

Given an integer array nums that may contain duplicates, return all possible subsets (the power set).

The solution set must not contain duplicate subsets. Return the solution in any order.

Example 1:

Input: nums = [1,2,2]
Output: [[],[1],[1,2],[1,2,2],[2],[2,2]]

Example 2:

Input: nums = [0]
Output: [[],[0]]

Constraints:

1 <= nums.length <= 10
-10 <= nums[i] <= 10

Provide feedback

Saved searches

Use saved searches to filter your results more quickly

Files

Subsets II

Subsets II

README.md

90. Subsets II

Files

Subsets II

Directory actions

More options

Directory actions

More options

Latest commit

History

Subsets II

Folders and files

parent directory

README.md

90. Subsets II