001.js > linear search 002.js-> reverseAnArr 003.js-> reverseAstr 004.js-> leftRotationD 005----> search del and insert in unsorted arr 006----> RECURSION 007----> BinarySearch 008----> search insert and delet in sorted array 009----> recursion for sum(n)
**LinkedList** -->001 ---> singly LL 002 ---> doubly LL 003 ---> circular singly LL 004 ---> circular doubly LL
**Sorting** -->001 ---> bubble sort 002 ---> selection sort 003 ---> insertion sort 004 ---> merge sort
**STack** -->001 ---> stack using array 002 ---> stack using LL
**Queue** -->001 ---> queue using array 001Rev ----> queue revision 002 ---> queue using LL