Posted 2021-08-10Updated 2021-08-10leetcode2 minutes read (About 286 words)

LC 254. Factor Combinations

https://leetcode.com/problems/factor-combinations/

Clarification & Assumption

Description: Giving a number n, return all possible combinations of its factors

input: int n
output: List<List<Integer>>
for all the possible cases:
    e.g. n = 1, return []
         n = 12, return [[2,6], [3,4], [2,2,3]]

Posted 2021-08-09Updated 2021-08-10leetcode2 minutes read (About 277 words)

LC 90. SubSets II

https://leetcode.com/problems/subsets-ii/

Clarification & Assumption:

Description: given an integer array, find all possible subsets
             e.g. [1,2,2] -> [1], [2], [1,2], [2,2], [1,2,2]
Input & Output:
    i. input: String set
    ii. output: List<String>
For all the possible cases:
    there could be duplicate characters