In this series, we will delve deep into the topic of permutations and combinations across multiple videos. In each video, we will break down the subject step by step—from the core concepts to advanced details—so please look forward to it!
This video focuses on combinations.
Problem Links (BOJ, Baekjoon Online Judge):
N and M (2) [Combination]
https://www.acmicpc.net/problem/15650
N and M (4) [Combination with Repetition]
https://www.acmicpc.net/problem/15652
🔥Must-Watch Videos🔥
Recursive Functions (Functions that call themselves): https://youtu.be/hjWaTriHMHk
Permutations: https://youtu.be/u9mP3uJClbQ
💡Lecture Notes💡
https://github.com/hoonlucky7/algorithm/tree/master/lecture_notes
💡💡Perfect Score Source Code (Java, C++, Python, JavaScript)💡💡
https://github.com/hoonlucky7/algorithm/tree/master/basic/combination
Timeline
00:00 : Intro
00:43 : Explanation of the combination concept
01:45 : Combinations: Counting the number of ways to choose pizza toppings
02:29 : The odds of winning the lottery
03:08 : Explanation of combinations with repetition
03:28 : Example of combinations with repetition (choosing ice cream)
05:14 : Difference between permutations and combinations?
05:42 : Basic problem solving: N and M (2) [Combination]
08:36 : Basic problem solving: N and M (4) [Combination with Repetition]