- Published on
Given an integer array nums of unique elements, return all possible course Schedule (the power set). The solution set must not contain duplicate course Schedule. Return the solution in any order.
All Posts
All Posts
- python (52)
- algorithm (52)
- dfs (16)
- tree (15)
- graph (10)
- linked-list (8)
- binary-search-tree (6)
- stack (4)
- two-pointers (4)
- hashmap (3)
- bfs (3)
- ai (2)
- machine-learning (2)
- binary-tree (2)
- dijkstras-algorithm (2)
- sorting (2)
- 2024-google-ml-bootcamp (1)
- deep-learning (1)
- mathematics (1)
- books (1)
- courses (1)
- defaultdict (1)
- trie (1)
- palindrome (1)
- heap (1)
- priority-queue (1)
- recursion (1)
- counter (1)
- typing (1)
- deque (1)
- slicing (1)
- Published on
Given an integer array nums of unique elements, return all possible reconstruct Itinerary (the power set). The solution set must not contain duplicate reconstruct Itinerary. Return the solution in any order.- Published on
- Published on
Given an array of distinct integers candidates and a target integer target, return a list of all unique combinations of candidates where the chosen numbers sum to target.- Published on
Given two integers n and k, return all possible combinations of k numbers chosen from the range [1, n]. You may return the answer in any order.