This is a practice for data structure through learning and practice. New sections are added mention below which question are attempting - So far covered topic is -

1. Array

2. Search

3. Sort

4. Matrix

5. String

6. LinkList

   1. Single Linked List :-

      1. Basic LinkList Implementation and execution of Insert , delete , search , loop operations .

      2. Reverse the List.

      3. Print the middle of the Linked List .

      4. Middle of the Linked List .

      5. Adding 1 to the LinkList .

      6. Adding 2 linked list in in to a linked list .

      7. Substraction 2 linked list problem.

      8. Sum of the last n node.

      9. Swap the two nodes for the linked list .

      10. Delete the duplicate from the linked list .

      11. Remove duplicate from the unsorted linked list .

      12. Intersection of two linked list.

      13. Zig Zag representation for linked list .

   2. Double Linked List :-

      1. Basic intro of double linked list .

   3. Circular Linked List : -

      1. Basic intro of the circular linked list .

7. Stack :

   1. Stack Problems :

      1. Using the stack data structure for the linear data structure .

      2. Pop the middle of the Stack.

      3. Check parenthesis.

      4. Two Stack Implementation.

      5. Removing cons duplicate from the string using stack data structure.

      6. Stock Span problem.

      7. Previous Greater Element.

      8. Next Greater Element.

      9. Min Pop Element.

      10. Infix to postfix expression

      11. Evaluate the postfix expression.

8. Queue :

   1. Queue Problems :

      1. First queue problem.

      2. Reverse Queue for a given number.

9. Dequeue :

   1. DeQueue Problems :

      1. Setting up the basic Dequeue .

      2. Maximum sub array for the dequeue.

      3. Rotation for the queue.

      4. Rotation for the petrol and distance.

10. Tree :

    1. Normal Tree :

    2. Binary tree :

    3. All the function like the traversal ,level order traversal ,size ,height , min value and max value .

    2.left and right view of the tree.

    3.Top view of the tree.

    4.Practice for the binary tree.

    3. Binary Search Tree :

    4. Basic binary search tree

11. Graph :

    1. Connectivity problems.

    2. Graph Flow

    3. Minimum spanning tree.

    4. Shortest path

    5. Topological sorting.

    6. Graph image.

12. Greedy Algorithm

    1. Activity for greedy algorithm

    2. Fast knapsack algorithm

    3. Prim greedy algorithm

    4. Kruskal algorithm

13. Dynamic Algorithm

    content will be updated .