LeetCode 77 | Combinations | Backtracking Algorithm Explained (Java + Debugging)

Published: 11 August 2020
on channel: Xavier Elon

14,421

154

Running Time: O(N!/K!(N-K)!)
Space Complexity: Same as run time

The description reads:
"Given two integers n and k, return all possible combinations of k numbers out of 1 ... n.

You may return the answer in any order.

Example 1:

Input: n = 4, k = 2
Output:
[
[2,4],
[3,4],
[2,3],
[1,2],
[1,3],
[1,4],
]
Example 2:

Input: n = 1, k = 1
Output: [[1]]"

Always be pluggin:
Slack Channel: https://join.slack.com/t/xavierelonle...
Github: https://github.com/xavierelon1
Facebook:   / xavier.hollingsworth.3
Instagram:   / xavierelon
LinkedIn:   / xavier-hollingsworth-524144127
Twitter:   / elon_xavier

On this page of the site you can watch the video online LeetCode 77 | Combinations | Backtracking Algorithm Explained (Java + Debugging) with a duration of hours minute second in good quality, which was uploaded by the user Xavier Elon 11 August 2020, share the link with friends and acquaintances, this video has already been watched 14,421 times on youtube and it was liked by 154 viewers. Enjoy your viewing!

363,581

4.8K