Implementation of all Data Structures and Algorithms and questions related to the data structures on Searching, Sorting, Stack, Queue, Linked List, Tree, Binary Search Tree, Heap, Graph, Backtracking, Trie, Dynamic Programming, etc.

• Visualizing Big-O Notation

• Inserting element at beginning of the list, end of the list, at particular position of the list, after any particular element of the list and inserting element in a sorted list.

• Deleting first element from the list, last element from the list, particular element from the list, and deleting element from particular position of the list.

• Search a particular element in a list. If it is exist, then print the position of an element, otherwise print -1.

• Find the middle element in the linked list.

• Find the Nth node from end in the linked list.

• Reverse a linked list by using iterative method.

• Reverse a linked list by using recursive method.

• Find the smallest and largest element in the linked list.

• Convert the Singly Linked List into Circular Linked List.

• Reverse a Linked List in groups of given size using iterative method.

• * Reverse a Linked List in groups of given size using recursive method.

• * Add two numbers represented by linked lists.

• * Merge two sorted linked lists. Method 1

• Merge two sorted linked lists. Method 2

• Merge two sorted linked lists. Method 3 Recursively

• * Detect and remove loop in a linked list.

• Segregate even and odd nodes in a linked list.

• Inserting element at beginning of the list, at the end of the list, and at any particular position in the list.

• Deleting first element from the list, last element from the list, and any particular element from the list and deleting element at any particular position of the list.

• Search a particular element in a doubly list. If it is exit, then return its position else return -1.

• Inserting element at the beginning, at the end, after any particular element, before any particular element in the list.

• Deleting first element from the list, last element from the list, and any particular element from the list.

• Search a particular element in a list. If it is exist, then print the position else print -1.

• Implementation of Stack using Arrays.

• Implementation of Stack using Linked List.

• Implementation of Stack using Dynamic Arrays.

• * Stock Span Problem {Question Statement}

• Previous Greater Element. Given an array of distinct integers, find the closest (positive wise) greater on left of every element. If there is no greater element on l;eft, then print -1

• Next Greater Element. Given an array of distinct integers, find the NextGreater(position-wise closest and on the right side) of every array elements.

• * Largest Rectangular Area in a Histogram.

• * Maximum Area Rectangle in Binary Matrix.

• Level Order Traversal

• Circular Tour

* Important