Completed
⌨️ CODING CHALLENGE: Recursive permutation
Class Central Classrooms beta
YouTube videos curated by Class Central.
Classroom Contents
Algorithms in Python – Full Course for Beginners
Automatically move to the next video in the Classroom when playback concludes
- 1 ⌨️ Intro & course overview
- 2 ⌨️ Factorials refresher
- 3 ⌨️ CODING CHALLENGE: Factorial program using iteration, recursion
- 4 ⌨️ What is a permutation?
- 5 ⌨️ CODING CHALLENGE: Recursive permutation
- 6 ⌨️ Iterative permutation example
- 7 ⌨️ 8/N queens problem: theory & explanation
- 8 ⌨️ Real world example of permutations
- 9 ⌨️ Lesson recap
- 10 ⌨️ What are data structures?
- 11 ⌨️ What is a one-dimensional array?
- 12 ⌨️ Search & sort
- 13 ⌨️ CODING CHALLENGE: Linear search
- 14 ⌨️ Binary search
- 15 ⌨️ CODING CHALLENGE: Iterative binary search
- 16 ⌨️ Coding a recursive binary search
- 17 ⌨️ Bubble sort
- 18 ⌨️ CODING CHALLENGE: Bubble sort
- 19 ⌨️ Insertion sort
- 20 ⌨️ CODING CHALLENGE: Insertion sort
- 21 ⌨️ Linked lists
- 22 ⌨️ CODING CHALLENGE: Linked list traverse, search, add, delete, header, nodes, tail
- 23 ⌨️ Hash tables
- 24 ⌨️ Lesson recap
- 25 ⌨️ Divide & conquer algorithm paradigm: uses, benefits and more
- 26 ⌨️ Merge sort
- 27 ⌨️ CODING CHALLENGE: An efficient merge sort
- 28 ⌨️ Getting judged mercilessly on LeetCode
- 29 ⌨️ Getting Python to do the work for us with sorted
- 30 ⌨️ Matrix multiplication
- 31 ⌨️ CODING CHALLENGE: Matrix multiplication
- 32 ⌨️ Strassen algorithm
- 33 ⌨️ CODING CHALLENGE: Strassen algorithm
- 34 ⌨️ Lesson recap
- 35 ⌨️ What is a greedy algorithm?
- 36 ⌨️ Assign mice to holes conceptual overview
- 37 ⌨️ CODING CHALLENGE: Assign mice to holes
- 38 ⌨️ Fractional knapsack
- 39 ⌨️ Understanding the fractional knapsack problem with a light-hearted dystopian apocalypse example
- 40 ⌨️ Coding challenge prep
- 41 ⌨️ CODING CHALLENGE: Fractional knapsack
- 42 ⌨️ Egyptians fractions
- 43 ⌨️ CODING CHALLENGE: Egyptian fractions
- 44 ⌨️ Lesson recap
- 45 ⌨️ What is dynamic programming also called DP?
- 46 ⌨️ What is the principle of optimality?
- 47 ⌨️ The 3-step process to solving a problem with optimal substructure
- 48 ⌨️ Introduction to “ugly numbers”
- 49 ⌨️ CODING CHALLENGE: Ugly numbers
- 50 ⌨️ Traveling salesman problem TSP
- 51 ⌨️ CODING CHALLENGE: Traveling salesman problem
- 52 ⌨️ Palindromic matrix paths
- 53 ⌨️ CODING CHALLENGE: Palindromic matrix paths
- 54 ⌨️ Lesson recap
- 55 ⌨️ Course wrap up and the importance of coding every day
