algos dynamic programming 1)fibbonaci problem 2) bitmasking 3) min step to 1 4) bitmasking 5) nX2 tiling 6) stair case problem 7) chef recipe problem 8) subset sum problem MY_DsA linked list singly loop - to check if there's a loop in linked list all the basic functions like: create insert: at end,at head,at given position ,at sorted position delete remove duplicates counting nodes displaying reversing of linked-list circular linked-list create delete insert display check loop doubly linked list create search delete insert circular doubly create insert delete display stacks array create push display isEmpty isFull pop linkedlist push(create) pop(del) count display vector push(add) display count pop(delete) queues using array with one pointer enqueue dequeue display using linkedlist enqueue dequeue display using array with two pointers enqueue dequeue display circular queueu enqueue dequeue display trees graph searching linear search binary search ternary search sorting insertion merge selection bubble quick hashmaps