Data-Structure-Algorithm-Programs

:books:Data Structures

Before dive into this repo you should know why do we need these concepts. What is Role of DSA in your real life??

Before getting into this repo lets understand the Importance of Problem solving and DSA in coming 10 to 20 years click below video to understand more.

• VIDEO

Let's connect on discord for Technical and DSA related Discussion: DisCord

“ For solving any real-world problem with programming approach we need to follow some steps & strategy. The collection of that steps is Algorithm, whereas a data structure is a way to store and organize data during solving that problem or constructing any software so that it can be used efficiently in terms of time and space, this way Data structure & Algorithms always allow us to write efficient and optimized computer programs.”

• STL is standard template library, It is most powerful & useful while doing competitive coding questions Read More.

• Problems on Data structure & Algorithms (Competitive coding) Click Here to get into problems section..

• NOTE : Click on [:blue_book:] for getting hand written notes on particular topic.

Show some  ❤️  by starring this repository! It will push me to give more percentage of efforts.

Data Structures

Topics Of Data-structure & Algorithms and Related Programs

1. Recursion
2. Array
3. String
4. LinkedList
5. Stack
6. Queue
7. Tree
8. Binary Search Tree
9. AVL Trees
10. Graph
11. Heap
12. Sorting Techniques
13. Divide & Conquer
14. Sliding Window
15. Dynamic Programming

:blue_book: Recursion

• 01 Head Recursion
• 02 Tail Recursion
• 03 Global variable recursion
• 04 Static variable reciursion
• 05 Tree recursion
• 06 Nested recursion
• 07 Sum of n number using recursion
• 08 Sum Of given number using loop
• 09 Power using recursion
• 10 Taylor Series using Static variables
• 11 Taylor Series honers rule
• 12 Taylor Series Iterative
• 13 Indirect Recursion
• 14 Fibbonaci series using loop and recursion
• 15 Fibbonacci using Memoization
• 16 nCr formula
• 17 Tower of Hanoi

* :blue_book: Array:blue_book:

• 01 Static and dynamic array
• 02 Increasing size of array in heap
• 03 Creating 2D array & Accessing
• 04 Array ADT1:blue_book:
• 05 inserting an element):blue_book:
• 06 Deleting element:blue_book:
• 07 Linear search:blue_book:
• 08 Improving Linear search:blue_book:
• 09 Binary Search Using Recursion:blue_book:
• 10 Binary Search using loop:blue_book:
• 11 Get Set max min sum avg):blue_book: && :blue_book:
• 12 Reverse and Shift:blue_book:
• 13 IsSorted:blue_book:
• 14 Mergeing 2 Array
• 15 InsertSort:blue_book:
• 16 Set Operation (Union,Intersec,diff)
• 17 Insertion and Deletion
• 18 Menu Based problem
• 19 Single Missing Element in Sorted Array
• 20 Single Missing Value in a sorted array M2
• 21 Multiple Missing Elements in Sorted Array
• 22 Missing elements in Unsorted Array (HASH TABLE)
• 23 Finding Duplicate in Soorted Array
• 24 Counting Duplicate Elements In Sorted M2
• 25 Counting Duplicate elements using hash table (SA)
• 26 Counting Duplicate elements using hash table (USA)
• 27 Finding Duplicate in Unsoorted Array
• 28 Find a pair with sum k
• 29 Find a pair with sum k in unsorted
• 30 Find a pair with sum k using Hashing
• [31 Finding max & min in single scan](https