Basic_Data_Structures

Basic Data Structures + LeetCode Problem Approaches

--> Array

1. Sliding Window (Count, Max Length, Max Length SubArray)
2. Binary Search (Binary Search, Lower Bound & Upper Bound)
3. Ternary Search

--> Linked List

1. Singly LinkedList (Insert, Delete, Rotate, Partition & Utils)
2. Doubly LinkedList (Insert, Delete & Utils)
3. Circular LinkedList (Insert, Delete & Utils)

--> Stack

1. Stack using Array
2. Java.util.Stack (Java Stack Class)

--> Deque (Double Ended Queue)

1. Java.util.Deque using ArrayDeque (Java Deque Class)