Course Overview

Master recursion with Grokking the Art of Recursion for Coding Interviews. Learn 24 coding patterns to solve LeetCode-style questions and ace your interviews!
Throughout this course, you will learn the fundamental principles of recursion and how it can be utilized to create efficient solutions for complex problems. We will dive deep into the art of recursive problem solving, breaking down each step to make it easy to understand and apply.
But that’s not all. We will also walk you through solutions to top coding problems frequently encountered in real-world interviews. These handpicked questions cover a broad range of scenarios, ensuring you gain comprehensive understanding and experience in tackling recursive problems.
By the end of this course, you will have developed a strong foundation in recursion, enhancing your problem-solving skills and increasing your confidence to ace those challenging coding interviews. Get ready to stand out to potential employers and take a significant step forward in your software engineering career!

 Course Contents

1. Introduction

•       Grokking the Art of Recursive Problem-Solving
•       Demystifying Recursion
•       Recursion Types
•       Recursion vs. Iteration
•       Recursive Algorithm Strategies
•       Complexity Analysis

2. Coding Problems (easy)

•       1. Basic Sum
•       Solution: Basic Sum
•       2. Factorial
•       Solution: Factorial
•       3. Greatest Common Divisor (GCD)
•       Solution: Greatest Common Divisor (GCD)
•       4. Converting Decimal to Binary
•       Solution: Converting Decimal to Binary
•       5. Check Prime
•       Solution: Check Prime
•       6. Perfect Square
•       Solution: Perfect Square
•       7. Number Frequency
•       Solution: Number Frequency

3. Coding Problems (medium)

•       8. Pascal’s Triangle
•       Solution: Pascal’s Triangle
•       9. Binary Search
•       Solution: Binary Search
•       10. Inserting a new node in a BST
•       Solution: Inserting a new node in a BST
•       11. BST Inorder Traversal
•       Solution: BST Inorder Traversal
•       12. Merge Sort
•       Solution: Merge Sort
•       13. Quick Sort
•       Solution: Quick Sort
•       14. Depth First Search
•       Solution: Depth First Search
•       15. Removing Nodes From Linked List
•       Solution: Removing Nodes From Linked List

4. Coding Problems (hard)

•       16. Fibonacci Series Using Memoization
•       Solution: Fibonacci Series Using Memoization
•       17. Good Number
•       Solution: Good Number
•       18. Split BST
•       Solution: Split BST
•       19. Pow(x,n)
•       Solution: Pow(x,n)