|
22 | 22 | - [Tower of Hanoi](https://github.com/skjha1/Data-Structure-Algorithm/blob/master/Recursion/19%20Tower%20of%20Hanoi%20.c) |
23 | 23 |
|
24 | 24 | * [:blue_book:](https://drive.google.com/drive/folders/1VzrX63lw2w44Vr3WL8udBO5Cyc3-W5vc) [Array](https://github.com/skjha1/Data-Structure-Algorithm/tree/master/Array) |
25 | | - - [static and dynamic array](https://github.com/skjha1/Data-Structure-Algorithm/blob/master/Array/01%20static%20and%20dynamic%20array%20.c) |
26 | | - - [increasing size of array in heap](https://github.com/skjha1/Data-Structure-Algorithm/blob/master/Array/02%20increasing%20size%20of%20array%20using%20heap.cpp) |
27 | | - - [Creating 2D array & Accessing](https://github.com/skjha1/Data-Structure-Algorithm/blob/master/Array/03%20Creating%202D%20array%20%26%20Accessing.c) |
28 | | - - [Array ADT1](https://github.com/skjha1/Data-Structure-Algorithm/blob/master/Array/04%20Array%20ADT1.c) |
29 | | - - [inserting an element](https://github.com/skjha1/Data-Structure-Algorithm/blob/master/Array/05%20inserting%20an%20element.c) |
30 | | - - [Deleting element](https://github.com/skjha1/Data-Structure-Algorithm/blob/master/Array/06%20Deleting%20element%20from%20array.c) |
31 | | - - [Linear search](https://github.com/skjha1/Data-Structure-Algorithm/blob/master/Array/07%20Linear%20search.c) |
32 | | - - [Improving Linear search](https://github.com/skjha1/Data-Structure-Algorithm/blob/master/Array/08%20Improving%20Linear%20search.c) |
33 | | - - [Binary Search Using Recursion](https://github.com/skjha1/Data-Structure-Algorithm/blob/master/Array/10%20Binary%20Search%20Using%20Recursion.c) |
34 | | - - [Binary Search using loop](https://github.com/skjha1/Data-Structure-Algorithm/blob/master/Array/09%20Binary%20Search%20using%20loop.c) |
35 | | - - [Get Set max min sum avg](https://github.com/skjha1/Data-Structure-Algorithm/blob/master/Array/11%20Get%20Set%20max%20min%20sum%20avg.c) |
36 | | - - [Rotate and Shift](https://github.com/skjha1/Data-Structure-Algorithm/blob/master/Array/12%20Rotate%20and%20Shift.c) |
37 | | - - [IsSorted](https://github.com/skjha1/Data-Structure-Algorithm/blob/master/Array/13%20IsSorted%20.c) |
38 | | - - [Mergeing 2 Array](https://github.com/skjha1/Data-Structure-Algorithm/blob/master/Array/14%20Mergeing%202%20Array.c) |
39 | | - - [InsertSort](https://github.com/skjha1/Data-Structure-Algorithm/blob/master/Array/15%20InsertSort%20.c) |
40 | | - - [Set Operation (Union,Intersec,diff)](https://github.com/skjha1/Data-Structure-Algorithm/blob/master/Array/16%20Set%20Operation%20(Union%2CIntersec%2Cdiff).c) |
41 | | - - [Insertion and Deletion](https://github.com/skjha1/Data-Structure-Algorithm/blob/master/Array/17%20Insertion%20and%20Deletion.cpp) |
42 | | - - [Menu Based problem](https://github.com/skjha1/Data-Structure-Algorithm/blob/master/Array/18%20Menu%20Based%20problem.cpp) |
43 | | - - [Single Missing Element in Sorted Array](https://github.com/skjha1/Data-Structure-Algorithm/blob/master/Array/19%20Single%20Missing%20Element%20in%20Sorted%20Array.cpp) |
44 | | - - [Single Missing Value in a sorted array M2](https://github.com/skjha1/Data-Structure-Algorithm/blob/master/Array/20%20Single%20Missing%20Value%20in%20a%20sorted%20array%20M2.c) |
45 | | - - [Multiple Missing Elements in Sorted Array](https://github.com/skjha1/Data-Structure-Algorithm/blob/master/Array/21%20Multiple%20Missing%20Elements%20in%20Sorted%20Array.cpp) |
46 | | - - [Missing elements in Unsorted Array (HASH TABLE)](https://github.com/skjha1/Data-Structure-Algorithm/blob/master/Array/22%20Missing%20elements%20in%20Unsorted%20Array%20(HASH%20TABLE).cpp) |
47 | | - - [Finding Duplicate in Soorted Array](https://github.com/skjha1/Data-Structure-Algorithm/blob/master/Array/23%20Finding%20Duplicate%20in%20Soorted%20Array.cpp) |
48 | | - - [Counting Duplicate Elements In Sorted M2](https://github.com/skjha1/Data-Structure-Algorithm/blob/master/Array/24%20Counting%20Duplicate%20Elements%20In%20Sorted.cpp) |
49 | | - - [Counting Duplicate elements using hash table (SA)](https://github.com/skjha1/Data-Structure-Algorithm/blob/master/Array/25%20Counting%20Duplicate%20elements%20using%20hash%20table%20(SA).cpp) |
50 | | - - [Finding Duplicate in Unsoorted Array](https://github.com/skjha1/Data-Structure-Algorithm/blob/master/Array/26%20Finding%20Duplicate%20in%20Unsoorted%20Array.cpp) |
51 | | - - [Find a pair with sum k](https://github.com/skjha1/Data-Structure-Algorithm/blob/master/Array/27%20Find%20a%20pair%20with%20sum%20k.cpp) |
52 | | - - [Find a pair with sum k in unsorted](https://github.com/skjha1/Data-Structure-Algorithm/blob/master/Array/28%20Find%20a%20pair%20with%20sum%20k%20in%20unsorted.cpp) |
53 | | - - [Find a pair with sum k using Hashing](https://github.com/skjha1/Data-Structure-Algorithm/blob/master/Array/29%20Find%20a%20pair%20with%20sum%20k%20using%20Hashing.cpp) |
54 | | - - [Finding max & min in single scan](https://github.com/skjha1/Data-Structure-Algorithm/blob/master/Array/30%20Finding%20max%20%26%20min%20in%20single%20scan.cpp) |
| 25 | + - [01 static and dynamic array](https://github.com/skjha1/Data-Structure-Algorithm/blob/master/Array/01%20static%20and%20dynamic%20array%20.c) |
| 26 | + - [02 increasing size of array in heap](https://github.com/skjha1/Data-Structure-Algorithm/blob/master/Array/02%20increasing%20size%20of%20array%20using%20heap.cpp) |
| 27 | + - [03 Creating 2D array & Accessing](https://github.com/skjha1/Data-Structure-Algorithm/blob/master/Array/03%20Creating%202D%20array%20%26%20Accessing.c) |
| 28 | + - [04 Array ADT1](https://github.com/skjha1/Data-Structure-Algorithm/blob/master/Array/04%20Array%20ADT1.c) |
| 29 | + - [05 inserting an element](https://github.com/skjha1/Data-Structure-Algorithm/blob/master/Array/05%20inserting%20an%20element.c) |
| 30 | + - [06 Deleting element](https://github.com/skjha1/Data-Structure-Algorithm/blob/master/Array/06%20Deleting%20element%20from%20array.c) |
| 31 | + - [07 Linear search](https://github.com/skjha1/Data-Structure-Algorithm/blob/master/Array/07%20Linear%20search.c) |
| 32 | + - [08 Improving Linear search](https://github.com/skjha1/Data-Structure-Algorithm/blob/master/Array/08%20Improving%20Linear%20search.c) |
| 33 | + - [09 Binary Search Using Recursion](https://github.com/skjha1/Data-Structure-Algorithm/blob/master/Array/10%20Binary%20Search%20Using%20Recursion.c) |
| 34 | + - [10 Binary Search using loop](https://github.com/skjha1/Data-Structure-Algorithm/blob/master/Array/09%20Binary%20Search%20using%20loop.c) |
| 35 | + - [11 Get Set max min sum avg](https://github.com/skjha1/Data-Structure-Algorithm/blob/master/Array/11%20Get%20Set%20max%20min%20sum%20avg.c) |
| 36 | + - [12 Rotate and Shift](https://github.com/skjha1/Data-Structure-Algorithm/blob/master/Array/12%20Rotate%20and%20Shift.c) |
| 37 | + - [13 IsSorted](https://github.com/skjha1/Data-Structure-Algorithm/blob/master/Array/13%20IsSorted%20.c) |
| 38 | + - [14 Mergeing 2 Array](https://github.com/skjha1/Data-Structure-Algorithm/blob/master/Array/14%20Mergeing%202%20Array.c) |
| 39 | + - [15 InsertSort](https://github.com/skjha1/Data-Structure-Algorithm/blob/master/Array/15%20InsertSort%20.c) |
| 40 | + - [16 Set Operation (Union,Intersec,diff)](https://github.com/skjha1/Data-Structure-Algorithm/blob/master/Array/16%20Set%20Operation%20(Union%2CIntersec%2Cdiff).c) |
| 41 | + - [17 Insertion and Deletion](https://github.com/skjha1/Data-Structure-Algorithm/blob/master/Array/17%20Insertion%20and%20Deletion.cpp) |
| 42 | + - [18 Menu Based problem](https://github.com/skjha1/Data-Structure-Algorithm/blob/master/Array/18%20Menu%20Based%20problem.cpp) |
| 43 | + - [19 Single Missing Element in Sorted Array](https://github.com/skjha1/Data-Structure-Algorithm/blob/master/Array/19%20Single%20Missing%20Element%20in%20Sorted%20Array.cpp) |
| 44 | + - [20 Single Missing Value in a sorted array M2](https://github.com/skjha1/Data-Structure-Algorithm/blob/master/Array/20%20Single%20Missing%20Value%20in%20a%20sorted%20array%20M2.c) |
| 45 | + - [21 Multiple Missing Elements in Sorted Array](https://github.com/skjha1/Data-Structure-Algorithm/blob/master/Array/21%20Multiple%20Missing%20Elements%20in%20Sorted%20Array.cpp) |
| 46 | + - [22 Missing elements in Unsorted Array (HASH TABLE)](https://github.com/skjha1/Data-Structure-Algorithm/blob/master/Array/22%20Missing%20elements%20in%20Unsorted%20Array%20(HASH%20TABLE).cpp) |
| 47 | + - [23 Finding Duplicate in Soorted Array](https://github.com/skjha1/Data-Structure-Algorithm/blob/master/Array/23%20Finding%20Duplicate%20in%20Soorted%20Array.cpp) |
| 48 | + - [24 Counting Duplicate Elements In Sorted M2](https://github.com/skjha1/Data-Structure-Algorithm/blob/master/Array/24%20Counting%20Duplicate%20Elements%20In%20Sorted.cpp) |
| 49 | + - [25 Counting Duplicate elements using hash table (SA)](https://github.com/skjha1/Data-Structure-Algorithm/blob/master/Array/25%20Counting%20Duplicate%20elements%20using%20hash%20table%20(SA).cpp) |
| 50 | + - [26 Finding Duplicate in Unsoorted Array](https://github.com/skjha1/Data-Structure-Algorithm/blob/master/Array/26%20Finding%20Duplicate%20in%20Unsoorted%20Array.cpp) |
| 51 | + - [27 Find a pair with sum k](https://github.com/skjha1/Data-Structure-Algorithm/blob/master/Array/27%20Find%20a%20pair%20with%20sum%20k.cpp) |
| 52 | + - [28 Find a pair with sum k in unsorted](https://github.com/skjha1/Data-Structure-Algorithm/blob/master/Array/28%20Find%20a%20pair%20with%20sum%20k%20in%20unsorted.cpp) |
| 53 | + - [29 Find a pair with sum k using Hashing](https://github.com/skjha1/Data-Structure-Algorithm/blob/master/Array/29%20Find%20a%20pair%20with%20sum%20k%20using%20Hashing.cpp) |
| 54 | + - [30 Finding max & min in single scan](https://github.com/skjha1/Data-Structure-Algorithm/blob/master/Array/30%20Finding%20max%20%26%20min%20in%20single%20scan.cpp) |
55 | 55 | - [Problems on array](https://github.com/skjha1/Data-Structure-Algorithm/tree/master/Array/Problems) |
| 56 | +* [:blue_book:](https://drive.google.com/drive/folders/1VzrX63lw2w44Vr3WL8udBO5Cyc3-W5vc) [Linkedlist](https://github.com/skjha1/Data-Structure-Algorithm/tree/master/LinkedList) |
| 57 | + - [01 Display LL](https://github.com/skjha1/Data-Structure-Algorithm/blob/master/LinkedList/Basic%20Consept/01%20Display%20LL.c) |
| 58 | + - [02 Display LL Using Recursion](https://github.com/skjha1/Data-Structure-Algorithm/blob/master/LinkedList/Basic%20Consept/02%20Display%20LL%20Using%20Recursion.c) |
| 59 | + - [03 Count and sum of LL](https://github.com/skjha1/Data-Structure-Algorithm/blob/master/LinkedList/Basic%20Consept/03%20Count%20and%20sum%20of%20LL.cpp) |
| 60 | + - [04 Printing max element](https://github.com/skjha1/Data-Structure-Algorithm/blob/master/LinkedList/Basic%20Consept/04%20Printing%20Max%20element.c) |
| 61 | + - [05 Searching Element ](https://github.com/skjha1/Data-Structure-Algorithm/blob/master/LinkedList/Basic%20Consept/06%20Searching%20Element%20.cpp) |
| 62 | + - [06 Searching Elements using Recursion & Move to 1st](https://github.com/skjha1/Data-Structure-Algorithm/blob/master/LinkedList/Basic%20Consept/07%20Searching%20Elements%20using%20Recursion%20%26%20Move%20to%201st%20.cpp) |
| 63 | + - [07 Insertion in linkedlist](https://github.com/skjha1/Data-Structure-Algorithm/blob/master/LinkedList/Basic%20Consept/08%20Insertion%20in%20linkedlist.cpp) |
| 64 | + - [08 Insert in sorted](https://github.com/skjha1/Data-Structure-Algorithm/blob/master/LinkedList/Basic%20Consept/10%20Insert%20in%20sorted%20ll.c) |
| 65 | + - [09 All in one 1 to 8](https://github.com/skjha1/Data-Structure-Algorithm/blob/master/LinkedList/Basic%20Consept/11%20project%20sll%20.cpp) |
| 66 | + - [10 project sll ](https://github.com/skjha1/Data-Structure-Algorithm/blob/master/LinkedList/Basic%20Consept/11%20project%20sll%20.cpp) |
| 67 | + - [11 Delete from ll.](https://github.com/skjha1/Data-Structure-Algorithm/blob/master/LinkedList/Basic%20Consept/12%20Delete%20from%20ll.c) |
| 68 | + - [12 Remove duplicate](https://github.com/skjha1/Data-Structure-Algorithm/blob/master/LinkedList/Basic%20Consept/13%20Remove%20duplicate.c) |
| 69 | + - [13 Reversing Using Array](https://github.com/skjha1/Data-Structure-Algorithm/blob/master/LinkedList/Basic%20Consept/14%20Reversing%20Using%20Array.c) |
| 70 | + - [14 Reversing by Sliding Links](https://github.com/skjha1/Data-Structure-Algorithm/blob/master/LinkedList/Basic%20Consept/15%20Reversing%20Using%20Sliding%20Links.c) |
| 71 | + - [15 Reversing using Recursion](https://github.com/skjha1/Data-Structure-Algorithm/blob/master/LinkedList/Basic%20Consept/16%20Reversing%20using%20Recursion.c) |
| 72 | + - [16 Concatenate linkedlist](https://github.com/skjha1/Data-Structure-Algorithm/blob/master/LinkedList/Basic%20Consept/17%20concatinate%20linkedlist.c) |
| 73 | + - [17 Merge LL](https://github.com/skjha1/Data-Structure-Algorithm/blob/master/LinkedList/Basic%20Consept/18%20Merge%20LL.c) |
| 74 | + - [18 Liner Singly Linked List in Single Project ](https://github.com/skjha1/Data-Structure-Algorithm/blob/master/LinkedList/Basic%20Consept/19%20Liner%20Singly%20Linked%20List%20.cpp) |
| 75 | + - [19 Display Circular LL using Loop & Recursion](https://github.com/skjha1/Data-Structure-Algorithm/blob/master/LinkedList/Basic%20Consept/20%20Display%20Circular%20LL.c) |
| 76 | + - [20 Insert in Circular LL](https://github.com/skjha1/Data-Structure-Algorithm/blob/master/LinkedList/Basic%20Consept/21%20Insert%20%20in%20Circular%20LL.c) |
| 77 | + - [21 Delete from cll from pos](https://github.com/skjha1/Data-Structure-Algorithm/blob/master/LinkedList/Basic%20Consept/22%20Delete%20from%20cll%20from%20pos.c) |
| 78 | + - [22 Delete an element in CLL from pos](https://github.com/skjha1/Data-Structure-Algorithm/blob/master/LinkedList/Basic%20Consept/23%20Delete%20an%20element%20in%20CLL%20from%20pos%20.cpp) |
| 79 | + - [23 Create,Display,count DLL](https://github.com/skjha1/Data-Structure-Algorithm/blob/master/LinkedList/Basic%20Consept/24%20Create%2CDisplay%2Ccount%20DLL.c) |
| 80 | + - [24 Insert at any pos in dll](https://github.com/skjha1/Data-Structure-Algorithm/blob/master/LinkedList/Basic%20Consept/25%20insert%20at%20any%20pos%20in%20dll.c) |
| 81 | + - [25 Delete from any pos from DLL](https://github.com/skjha1/Data-Structure-Algorithm/blob/master/LinkedList/Basic%20Consept/26%20Delete%20from%20DLL.c) |
| 82 | + - [26 Reverse DLL](https://github.com/skjha1/Data-Structure-Algorithm/blob/master/LinkedList/Basic%20Consept/27%20Reverse%20DLL.c) |
| 83 | + - [27 Middle of Linkedlist](https://github.com/skjha1/Data-Structure-Algorithm/blob/master/LinkedList/Basic%20Consept/28%20Middle%20of%20Linkedlist.c) |
| 84 | + - [28 Polynomial of Linkedlist](https://github.com/skjha1/Data-Structure-Algorithm/blob/master/LinkedList/Basic%20Consept/29%20Polynomial%20of%20Linkedlist.c) |
| 85 | + - [Problems on LL](https://github.com/skjha1/Data-Structure-Algorithm/tree/master/LinkedList/Problems) |
56 | 86 |
|
0 commit comments