매일 알고리즘
1.[leetcode] 46. Permutations
Given an array nums of distinct integers, return all the possible permutations. You can return the answer in any order.1 <= nums.length <= 610 &
2.[leetcode] 47. Permutations2
문제 Given a collection of numbers, nums, that might contain duplicates, return all possible unique permutations in any order. Constraints 1 <= nums.le
3.[leetcode] 78. Subsets
Given an integer array nums of unique elements, return all possible subsets (the power set).The solution set must not contain duplicate subsets. Retur
4.[leetcode] 575. Distribute Candies
Alice has n candies, where the ith candy is of type candyTypei. Alice noticed that she started to gain weight, so she visited a doctor.The doctor advi
5.[leetcode]
You have a set of integers s, which originally contains all the numbers from 1 to n. Unfortunately, due to some error, one of the numbers in s got dup