Given two integers n and k, return all possible combinations of k numbers out of 1 ... n.
For example, If n = 4 and k = 2, a solution is:
[ [2,4], [3,4], [2,3], [1,2], [1,3], [1,4], ]
-
Notifications
You must be signed in to change notification settings - Fork 2
LeetCodeLearn/Combinations
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
Given two integers n and k, return all possible combinations of k numbers out of 1 ... n.
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published