|
| 1 | +<h1 align='center'>RECURSION - PROBLEMS</h1> |
1 | 2 |
|
| 3 | +<p align='center'> |
| 4 | +Welcome to the 'Recursion Problems' repository! This repository contains a collection of problems that focus on the **Recursion** technique in programming. Recursion is a powerful concept where a function calls itself in order to break down a complex problem into simpler sub-problems. |
| 5 | +</p> |
| 6 | + |
| 7 | +## About Recursion |
| 8 | + |
| 9 | +Recursion is an essential topic in computer science and algorithm design. It is widely used to solve problems that can be broken down into smaller, similar problems. This repository includes a variety of recursive challenges, such as: |
| 10 | + |
| 11 | +- Finding Fibonacci numbers |
| 12 | +- Sorting arrays |
| 13 | +- Generating subsets and subsequences |
| 14 | +- Searching for elements in arrays |
| 15 | +- Solving problems related to paths, combinations, and more! |
| 16 | + |
| 17 | +Each problem in this repository is designed to help you understand and practice recursion, and it provides solutions using this technique. Whether you're a beginner or looking to refresh your recursion knowledge, this collection is sure to enhance your problem-solving skills. |
| 18 | + |
| 19 | +## Problem List |
| 20 | + |
| 21 | +Here you will find a list of problems organized by topic. For each problem, you'll find both **Leetcode** and **GFG** links (where available), along with descriptions and recursive solutions. The problems include topics like **Fibonacci series**, **Subsets generation**, **String manipulations**, **Sorting**, and much more! |
| 22 | + |
| 23 | +Start solving and exploring to dive deep into recursion and improve your coding skills! |
| 24 | + |
| 25 | +### Repository Content |
| 26 | + |
| 27 | +<p> |
| 28 | +<img src="https://img.shields.io/badge/problems%20count-03-orange?logo=leetcode" alt="LeetCode"> |
| 29 | +<img src="https://img.shields.io/badge/problems%20count-04-darkgreen?logo=geeksforGeeks" alt="GeeksforGeeks"> |
| 30 | +<img src="https://img.shields.io/badge/total%20problems%20count-15-blue" alt="Problem Count"> |
| 31 | +</p> |
| 32 | + |
| 33 | + |
| 34 | +| No | Problem Name | Description | Leetcode | GFG | |
| 35 | +|-----|----------------------------------------|------------------------------------------------------------------|----------|-----| |
| 36 | +| 01 | [Fibonacci Number](https://github.com/JawadSher/DSA-LeetCode-GFG-Problems-Repository/tree/main/11%20-%20Recursion%20Problems/01%20-%20Fibonacci%20Number) | Find the nth Fibonacci number using recursion. | [Link](https://leetcode.com/problems/fibonacci-number/) | [Link](https://www.geeksforgeeks.org/program-for-nth-fibonacci-number/) | |
| 37 | +| 02 | [Numbers to Letters](https://github.com/JawadSher/DSA-LeetCode-GFG-Problems-Repository/tree/main/11%20-%20Recursion%20Problems/02%20-%20Numbers%20to%20Letters) | Convert digits into letters as per phone keypad mapping. | Non | Non | |
| 38 | +| 03 | [isArray Sorted](https://github.com/JawadSher/DSA-LeetCode-GFG-Problems-Repository/tree/main/11%20-%20Recursion%20Problems/03%20-%20isArray%20Sorted) | Check if an array is sorted using recursion. | Non | Non | |
| 39 | +| 04 | [Sum of Array](https://github.com/JawadSher/DSA-LeetCode-GFG-Problems-Repository/tree/main/11%20-%20Recursion%20Problems/04%20-%20Sum%20of%20Array) | Find the sum of elements of an array using recursion. | Non | Non | |
| 40 | +| 05 | [Linear Search](https://github.com/JawadSher/DSA-LeetCode-GFG-Problems-Repository/tree/main/11%20-%20Recursion%20Problems/05%20-%20Linear%20Search) | Perform linear search recursively. | Non | Non | |
| 41 | +| 06 | [Binary Search](https://github.com/JawadSher/DSA-LeetCode-GFG-Problems-Repository/tree/main/11%20-%20Recursion%20Problems/06%20-%20Binary%20Search) | Perform binary search recursively. |Non| Non | |
| 42 | +| 07 | [Reverse String](https://github.com/JawadSher/DSA-LeetCode-GFG-Problems-Repository/tree/main/11%20-%20Recursion%20Problems/07%20-%20Reverse%20String) | Reverse a string using recursion. | Non | Non | |
| 43 | +| 08 | [Palindrome String](https://github.com/JawadSher/DSA-LeetCode-GFG-Problems-Repository/tree/main/11%20-%20Recursion%20Problems/08%20-%20Palindrome%20String) | Check if a string is palindrome using recursion. | Non | Non | |
| 44 | +| 09 | [Calculate Power](https://github.com/JawadSher/DSA-LeetCode-GFG-Problems-Repository/tree/main/11%20-%20Recursion%20Problems/09%20-%20Calculate%20Power) | Calculate power of a number using recursion. | Non |Non | |
| 45 | +| 10 | [Bubble Sort](https://github.com/JawadSher/DSA-LeetCode-GFG-Problems-Repository/tree/main/11%20-%20Recursion%20Problems/10%20-%20Bubble%20Sort) | Sort an array using bubble sort recursively. | Non | Non | |
| 46 | +| 11 | [Subsets](https://github.com/JawadSher/DSA-LeetCode-GFG-Problems-Repository/tree/main/11%20-%20Recursion%20Problems/11%20-%20Subsets) | Generate all subsets of a set using recursion. | [Link](https://leetcode.com/problems/subsets/) | [Link](https://www.geeksforgeeks.org/subset-sum-problem/) | |
| 47 | +| 12 | [Subsets - GFG](https://github.com/JawadSher/DSA-LeetCode-GFG-Problems-Repository/tree/main/11%20-%20Recursion%20Problems/12%20-%20Subsets%20-%20GFG) | Generate all subsets of a set using recursion (GFG version). | Non | [Link](https://www.geeksforgeeks.org/subsets-of-a-set/) | |
| 48 | +| 13 | [Subsequences of String](https://github.com/JawadSher/DSA-LeetCode-GFG-Problems-Repository/tree/main/11%20-%20Recursion%20Problems/13%20-%20Subsequences%20of%20String) | Generate all subsequences of a string using recursion. | Non | Non | |
| 49 | +| 14 | [Letter Combination of a Phone Number](https://github.com/JawadSher/DSA-LeetCode-GFG-Problems-Repository/tree/main/11%20-%20Recursion%20Problems/14%20-%20Letter%20Combination%20of%20a%20Phone%20Number) | Generate letter combinations from a phone number using recursion. | [Link](https://leetcode.com/problems/letter-combinations-of-a-phone-number/) | Non | |
| 50 | +| 15 | [Rat in a Maze](https://github.com/JawadSher/DSA-LeetCode-GFG-Problems-Repository/tree/main/11%20-%20Recursion%20Problems/15%20-%20Rat%20in%20a%20Maze) | Find paths for a rat in a maze using recursion. | Non | [Link](https://www.geeksforgeeks.org/problems/rat-in-a-maze-problem/1) | |
| 51 | + |
| 52 | +Feel free to adjust the introduction based on specific details you would like to add about the repository. |
| 53 | + |
| 54 | +--- |
| 55 | +Happy Coding 😊 |
0 commit comments