Udemy - Recursion: the full course

  • Category Other
  • Type Tutorials
  • Language English
  • Total size 1.2 GB
  • Uploaded By tutsnode
  • Downloads 382
  • Last checked 1 month ago
  • Date uploaded 5 years ago
  • Seeders 15
  • Leechers 2

Infohash : 39C7ADBBC765A9B67DFFFF10ACBB3B6462C196E3




Description

Even if the concept of recursion is simple, a lot of people struggle with it (not understanding the recursive process, not being able to figure out the base cases and recursive cases…), this is why I wanted to create a full course on recursion that covers all what you need to know about it, it also contains 11 solved and explained coding problems to practice.

And knowing recursion will also give you a new way of thinking, which is dividing the problem into subproblems of the same type, which is necessary to understand techniques like dynamic programming, backtracking…

See you in the first lecture!

The course covers:

What is recursion
Code and execution
Base cases and recursive cases
Multiple recursive calls process
Call stack
Recursion tree
How to visualize the process
Recursive functions complexity analysis (time and space comp)
Recursion vs Iteration
How to optimize a recursive function (memoization and dynamic programming)
Divide-and-conquer
Backtracking
Recursive data structures
Tail recursion
Double recursion
How to think recursively

Plus 11 solved and explained coding problems to practice:

Sum of digits
Count occurrences
Has adjacent duplicates
Reverse string
Minimum cost path in matrix
All possible phrases
Keypad combinations
String subsequences
Binary numbers with at most 2 zeros
Word search
Array permutations

Who this course is for:

Programmers
Computer science students
Engineering students
Competitive programmers
Self-learning people

Requirements

Basic programming knowledge

Last Updated 12/2020

Files:

Recursion the full course [TutsNode.com] - Recursion the full course 1. Introduction
  • 2. Code and execution.mp4 (84.9 MB)
  • 2. Code and execution.srt (37.3 KB)
  • 1.1 factorial.py (0.1 KB)
  • 1.2 fibonacci_iter.py (0.2 KB)
  • 1.3 fibonacci.py (0.1 KB)
  • 1.4 factorial_iter.py (0.1 KB)
  • 2.1 factorial.py (0.1 KB)
  • 2.2 func_2.py (0.1 KB)
  • 2.3 file_system.py (0.5 KB)
  • 2.4 func_1.py (0.1 KB)
  • 2.5 merge.py (0.6 KB)
  • 2.6 hanoi.py (0.3 KB)
  • 2.7 binsearch.py (0.3 KB)
  • 2.8 fibonacci.py (0.1 KB)
  • 1. What is recursion.srt (15.9 KB)
  • 3. Base cases and recursive cases.srt (6.9 KB)
  • 1. What is recursion.mp4 (37.1 MB)
  • 3. Base cases and recursive cases.mp4 (16.1 MB)
22. Coding problem #11 Array permutations
  • 2. Solution + code.srt (21.3 KB)
  • 2.1 array_permutations.py (1.0 KB)
  • 1. Solve the problem.html (0.1 KB)
  • 2. Solution + code.mp4 (50.6 MB)
17. Coding problem #6 All possible phrases
  • 2. Solution + code.srt (21.2 KB)
  • 2. Solution + code.mp4 (70.7 MB)
  • 2.1 all_possible_phrases.py (0.6 KB)
  • 1. Solve the problem.html (0.1 KB)
20. Coding problem #9 Binary numbers with at most 2 zeros
  • 2. Solution + code.srt (20.3 KB)
  • 1. Solve the problem.html (0.1 KB)
  • 2. Solution + code.mp4 (58.6 MB)
8. Recursive data structures
  • 2. Recursion and trees.srt (2.1 KB)
  • 3.1 graphs.py (0.4 KB)
  • 1. Recursion and linked lists.srt (3.2 KB)
  • 3. Recursion and graphs.srt (1.9 KB)
  • 1.1 linked_lists.py (0.7 KB)
  • 2.1 trees.py (0.9 KB)
  • 1. Recursion and linked lists.mp4 (10.0 MB)
  • 2. Recursion and trees.mp4 (6.8 MB)
  • 3. Recursion and graphs.mp4 (6.1 MB)
5. Recursion vs Iteration
  • 2.2 dfs_postorder_iter.py (0.5 KB)
  • 2. From recursion to iteration.srt (12.5 KB)
  • 2.1 bin_tree_sum_iter.py (0.6 KB)
  • 3.1 get_min.py (0.3 KB)
  • 3.2 contains.py (0.3 KB)
  • 3.3 nb_divisors.py (0.7 KB)
  • 1. The comparison.srt (6.4 KB)
  • 3. From iteration to recursion.srt (6.2 KB)
  • 2. From recursion to iteration.mp4 (37.4 MB)
  • 1. The comparison.mp4 (18.9 MB)
  • 3. From iteration to recursion.mp4 (17.1 MB)
2. Multiple recursive calls
  • 1.2 factorial.py (0.1 KB)
  • 1.3 tow_rec_cases_calls.py (0.2 KB)
  • 1.4 dfs_preorder.py (0.2 KB)
  • 1.5 merge.py (0.6 KB)
  • 1.6 binsearch.py (0.3 KB)
  • 1.7 bin_tree_sum.py (0.3 KB)
  • 1. Process explanation.srt (16.8 KB)
  • 2. Recursion tree.srt (12.8 KB)
  • 1.1 ways.py (0.2 KB)
  • 1. Process explanation.mp4 (47.2 MB)
  • 2. Recursion tree.mp4 (30.2 MB)
16. Coding problem #5 Minimum cost path in matrix
  • 2. Solution + code.srt (20.0 KB)
  • 2.1 minimum_cost_path.py (0.9 KB)
  • 1. Solve the problem.html (0.1 KB)
  • 2. Solution + code.mp4 (62.4 MB)
15. Coding problem #4 Reverse string
  • 2. Solution + code.srt (17.8 KB)
  • 2.1 reverse_string.py (0.5 KB)
  • 1. Solve the problem.html (0.1 KB)
  • 2. Solution + code.mp4 (43.1 MB)
7. Divide-and-conquer and backtracking
  • 3. N-queens problem.srt (17.4 KB)
  • 2. What is backtracking.srt (15.9 KB)
  • 1. What is divide-and-conquer.srt (7.8 KB)
  • 1.1 merge.py (0.6 KB)
  • 1.2 karatsuba.py (0.5 KB)
  • 1.3 binsearch.py (0.3 KB)
  • 2.1 valid_weight_combs.py (0.8 KB)
  • 3.1 nqueens.py (0.7 KB)
  • 3. N-queens problem.mp4 (43.6 MB)
  • 2. What is backtracking.mp4 (35.1 MB)
  • 1. What is divide-and-conquer.mp4 (21.1 MB)
3. Visualize call stack and recursion tree
  • 1.1 merge_callstack.py (0.8 KB)
  • 2.1 ways_rec_viz.py (0.9 KB)
  • 2. Visualize recursion tree.srt (7.8 KB)
  • 1. Visualize call stack.srt (5.0 KB)
  • 1. Visualize call stack.mp4 (22.5 MB)
  • 2. Visualize recursion tree.mp4 (19.9 MB)
18. Coding problem #7 Keypad combinations
  • 2. Solution + code.srt (16.7 KB)
  • 2.1 keypad_combs.py (0.8 KB)
  • 1. Solve the problem.html (0.1 KB)
  • 2. Solution + code.mp4 (61.2 MB)
9. Tail recursion
  • 2. Examples.srt (13.6 KB)
  • 1. What is tail recursion.srt (8.9 KB)
  • 2.4 get_min_tail.py (0.3 KB)
  • 1.1 factorial_tail.py (0.1 KB)
  • 2.3 fibonacci_tail.py (0.3 KB)
  • 2.1 sum_to_n.py (0.2 KB)
  • 2.2 pow.py (0.2 KB)
  • 2.5 fibonacci_iter.py (0.2 KB)
  • 2. Examples.mp4 (38.9 MB)
  • 1. What is tail recursion.mp4 (20.2 MB)
21. Coding problem #10 Word search
  • 2. Solution + code.srt (13.5 KB)
  • 2.1 word_search.py (0.9 KB)
  • 1. Solve the problem.html (0.1 KB)
  • 2. Solution + code.mp4 (33.4 MB)
4. Time and space complexity analysis of recursive functions
  • 4. Master theorem method.srt (13.3 KB)
  • 3. Recurrence relation method.srt (12.9 KB)
  • 5. Space complexity of a recursive algorithm.srt (9.7 KB)
  • 2. Recursion tree method.srt (10.2 KB)
  • 1. Recursion and timespace complexity.srt (6.9 KB)
  • 4. Master theorem method.mp4 (58.6 MB)
  • 3. Recurrence relation method.mp4 (39.6 MB)
  • 2. Recursion tree method.mp4 (25.6 MB)
  • 5. Space complexity of a recursive algorithm.mp4 (24.4 MB)
  • 1. Recursion and timespace complexity.mp4 (15.5 MB)
6. Optimize a recursive function with memoization and dynamic programming
  • 2. Optimize ways to climb stairs solution with memoization.srt (9.4 KB)
  • 1. What is memoization.srt (2.8 KB)
  • 2.1 ways_memoiz.py (0.3 KB)
  • 3. What is dynamic programming.srt (6.3 KB)
  • 3.1 fibonacci_dp.py (0.1 KB)
  • 4.1 ways_dp.py (0.2 KB)
  • 4. Optimize ways to climb stairs solution with dynamic programming.srt (5.1 KB)
  • 2. Optimize ways to climb stairs solution with memoization.mp4 (23.6 MB)
  • 3. What is dynamic programming.mp4 (18.8 MB)
  • 4. Optimize ways to climb stairs solution with dynamic programming.mp4 (17.2 MB)
  • 1. What is memoization.mp4 (9.6 MB)
19. Coding problem #8 String subsequences
  • 2. Solution + code.srt (9.3 KB)
  • 2.1 string_subseq.py (0.3 KB)
  • 1. Solve the problem.html (0.1 KB)
  • 2. Solution + code.mp4 (27.5 MB)
12. Coding problem #1 Sum of digits problem
  • 2. Solution + code.srt (8.9 KB)
  • 2.1 sum_of_digits.py (0.3 KB)
  • 1. Solve the problem.html (0.1 KB)
  • 2. Solution + code.mp4 (23.0 MB)
13. Coding problem #2 Count occurrences
  • 2. Solution + code.srt (8.1 KB)
  • 2.1 count_occurrences.py (0.4 KB)
  • 1. Solve the problem.html (0.1 KB)
  • 2. Solution + code.mp4 (20.3 MB)
11. How to think recursively
  • 1. How to think recursively.srt (8.0 KB)
  • 1. How to think recursively.mp4 (14.5 MB)
10. Double recursion
  • 1. What is double recursion.srt (5.7 KB)
  • 1.1 ackermann.py (0.1 KB)
  • 1. What is double recursion.mp4 (14.5 MB)
23. Conclusion
  • 1. Conclusion.srt (1.0 KB)
  • 1. Conclusion.mp4 (3.4 MB)
14. Coding problem #3 Has adjacent duplicates problem
  • 2. Solution + code.srt (5.0 KB)
  • 2.1 has_adjacent_duplicates.py (0.2 KB)
  • 1. Solve the problem.html (0.1 KB)
  • 2. Solution + code.mp4 (14.5 MB)
  • TutsNode.com.txt (0.1 KB)
  • [TGx]Downloaded from torrentgalaxy.to .txt (0.6 KB)
    • .pad
    • 0 (0.0 KB)
    • 1 (483.5 KB)
    • 2 (92.4 KB)
    • 3 (352.1 KB)
    • 4 (365.8 KB)
    • 5 (412.3 KB)
    • 6 (377.7 KB)
    • 7 (358.3 KB)
    • 8 (395.3 KB)
    • 9 (381.7 KB)
    • 10 (409.6 KB)
    • 11 (60.2 KB)
    • 12 (134.5 KB)
    • 13 (431.4 KB)
    • 14 (385.1 KB)
    • 15 (63.3 KB)
    • 16 (312.4 KB)
    • 17 (26.3 KB)
    • 18 (443.1 KB)
    • 19 (134.6 KB)
    • 20 (409.6 KB)
    • 21 (31.5 KB)
    • 22 (37.7 KB)
    • 23 (365.4 KB)
    • 24 (241.7 KB)
    • 25 (329.5 KB)
    • 26 (113.0 KB)
    • 27 (61.8 KB)
    • 28 (160.1 KB)
    • 29 (266.8 KB)
    • 30 (380.8 KB)
    • 31 (399.5 KB)
    • 32 (45.6 KB)
    • 33 (473.8 KB)
    • 34 (1.8 KB)
    • 35 (14.1 KB)
    • 36 (8.5 KB)
    • 37 (453.0 KB)
    • 38 (228.8 KB)
    • 39 (390.4 KB)

There are currently no comments. Feel free to leave one :)

Code:

  • udp://inferno.demonoid.pw:3391/announce
  • udp://tracker.openbittorrent.com:80/announce
  • udp://tracker.opentrackr.org:1337/announce
  • udp://torrent.gresille.org:80/announce
  • udp://glotorrents.pw:6969/announce
  • udp://tracker.leechers-paradise.org:6969/announce
  • udp://tracker.pirateparty.gr:6969/announce
  • udp://tracker.coppersurfer.tk:6969/announce
  • udp://ipv4.tracker.harry.lu:80/announce
  • udp://9.rarbg.to:2710/announce
  • udp://shadowshq.yi.org:6969/announce
  • udp://tracker.zer0day.to:1337/announce
GDRIVE-CACHE 📁 GD (hit) | ID: 15FixkuhOi... 📄 torrent 🕐 19 Jan 2026, 10:46:00 pm IST ⏰ 13 Feb 2026, 10:45:56 pm IST ✅ Valid for 21d 22h 🔄 Refresh Cache