DATA STRUCTURE AND ALGO (MADE EASY Important Questions).
- Singly LinkedList Implementation
- Doubly LinkedList Implementation
- Circular LinkedList Implementation
- Nth Node From End In LinkedList
- Detect Loop In LinkedList
- Find Start Node of Loop in LinkedList
- Length of Loop In LinkedList
- Reversing a LinkedList
- Intersection Point In Two LinkedList
- Middle Node of LinkedList
- Check LinkedList Length To Be Odd Or Even
- Display LinkedList From End
- Reverse LinkedList In Pair
- Split LinkedList Into Two Equal Halves
- Check LinkedList To Be Palindrome
- Reverse Block of K Nodes in LinkedList
- Josephus Circle
- Deep clone a Linked List with Random Pointers
- Static Array Implementation
- Dynamic Array Implementation
- Linked List Implementation
- Balancing Brackets
- Infix to Postfix
- Postfix Evaluation
- Get Minimum From Stack