Algorithms in Python – Full Course for Beginners

Algorithms in Python – Full Course for Beginners

freeCodeCamp.org via freeCodeCamp Direct link

⌨️ CODING CHALLENGE: Ugly numbers

49 of 55

49 of 55

⌨️ CODING CHALLENGE: Ugly numbers

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

Never Stop Learning.

Get personalized course recommendations, track subjects and courses with reminders, and more.

Someone learning on their laptop while sitting on the floor.