Let's go on a journey through the world of recursion with this short course designed specifically for self-taught developers and beginners to algorithms! Starting with the basics, we explore the concept of recursion, understand the Divide and Conquer algorithm, and apply it to solve a Binary Search problem.
Dive deep into Tree Traversals as we demonstrate the power of recursion in inorder, preorder, and postorder traversal on binary trees. The course doesn't stop there; we unravel the mysteries of backtracking and put our newfound knowledge to the test with a Rat in a Maze problem.
Each concept is thoroughly explained, accompanied by practical examples and visual demonstrations, ensuring a solid understanding for technical interviews and algorithmic problem-solving.
Chapters:
00:00 - Goals and Objectives
00:30 - What is a recursive function?
00:45 - Recursive function [ Example 1 ]
01:10 - Infinite Loop Breakdown
01:40 - Stop Condition / Base Case
02:00 - Base Case Illustration
03:31 - Recursion Use Cases
03:55 - Divide and Conquer
04:10 - Divide and Conquer Real Life Example
04:32 - Find the Index of a Target Element in a Sorted List
04:51 - Linear Search Explanation
05:22 - Binary Search Explanation
07:09 - Binary Search Code/Function
11:46 - What is Tree Traversal?
12:30 - Depth-First Search Algorithms
12:47 - Create a Binary Tree
14:17 - Inorder Traversal
14:38 - Create Helper Function
16:58 - Preorder Traversal
18:16 - Post Order Traversal
19:29 - Advantages of using a Helper Function
19:50 - Backtracking
20:33 - Rat in a Maze - Explanation
20:44 - Create maze in a 2D array
21:56 - Rat stuck in an infinite loop - Explanation
22:31 - Mark slots as visited - Explanation
23:39 - Backtrack - Explanation
24:38 - Rat in a Maze - Code
🔍 Explore key topics: #javascript #recursion #algorithm #leetcode #technical #interview #course #computerprogramming #tutorial #questions #js