Data Structures Java Implementation

• Balanced Trees

  • AVL Tree (recursive)

• Binary Search Tree

• Linked List

  • Singly linked lists
  • Doubly linked lists

• Array List

• Priority Queue

  • Min Binary Heap
  • Max Binary Heap

• Queue

  • Queue (LinkedList implementation)
  • Circular Queue(Array implementation)

• Stack

  • Stack(LinkedList implementation)
  • Stack(Array implementation)

Sorting algorithms

• Bubble sort - O(n2)
• Heapsort- O(nlog(n))
• Insertion sort - O(n2)
• Mergesort - O(nlog(n))
• Selection sort - O(n2)
• Quicksort (first element as a pivot) - Θ(nlog(n))
• Quicksort (last element as a pivot) - Θ(nlog(n))
• Quicksort (middle element as a pivot) - Θ(nlog(n))

Graph theory

• Depth first search (adjacency matrix, iterative) - O(V+E)
• Depth first search (adjacency matrix, recursion) - O(V+E)
• Depth first search (adjacency list, iterative) - O(V+E)
• Depth first search (adjacency list, recursion) - O(V+E)
• Breadth first search & Shortest Bath (adjacency matrix, iterative) - O(V+E)
• Breadth first search & Shortest Bath (adjacency list, iterative) - O(V+E)

Data Structures and Algorithms practice problems

• Trees

  • Invert Binary Tree
  • Maximum Depth of Binary Tree
  • Diameter of Binary Tree
  • Balanced Binary Tree
  • Same Tree
  • Subtree of Another Tree
  • Sum of Left Leaves
  • Binary Tree Paths
  • Symmetric Tree
  • Increasing Order Search Tree
  • Binary Tree Level Order Traversal
  • Validate Binary Search Tree
  • Count Good Nodes in Binary Tree
  • Minimum Distance Between BST Nodes
  • Convert Sorted Array to Binary Search Tree
  • Count Complete Tree Nodes
  • Check Completeness of a Binary Tree
  • Reverse Odd Levels of Binary Tree
  • Binary Tree Zigzag Level Order Traversal
  • Lowest Common Ancestor of a Binary Search Tree
  • Construct Binary Search Tree from Preorder Traversal
  • Binary Tree Maximum Path Sum
  • Binary Tree Right Side View
  • Kth Smallest Element in a BST

• Linked List

  • Reverse Linked List
  • Middle of the Linked List
  • Reorder List
  • Rotate List
  • Linked List Cycle
  • Linked List Cycle II
  • Intersection of Two Linked Lists
  • Intersection of Two Linked Lists then modify
  • Palindrome Linked List
  • Swapping Nodes in a Linked List
  • Merge Two Sorted Lists
  • Remove Nth Node From End of List
  • Add Two Numbers
  • Remove Duplicates from Sorted List
  • Odd Even Linked List
  • Delete Node in a Linked List
  • Reverse Linked List II
  • Remove Duplicates from Sorted List II
  • Remove Zero Sum Consecutive Nodes from Linked List
  • Find the Minimum and Maximum Number of Nodes Between Critical Points
  • Split Linked List in Parts

• Priority Queue

  • Last Stone Weight
  • K Closest Points to Origin
  • Kth Largest Element in an Array

• Queue

  • Reverse a queue
  • Print first k Binary Number
  • Sort queue

• Stack

  • Add number k to a sorted stack
  • Sort a stack
  • Arithmetic Expressions
  • Remove All Adjacent Duplicates In String
  • Validate Stack Sequences
  • Next Greater Node In Linked List
  • Remove All Adjacent Duplicates in String II
  • Valid Parentheses
  • Minimum Add to Make Parentheses Valid
  • Find Minimum number
  • Reverse a stack
  • Reverse Substrings Between Each Pair of Parentheses

• Recursion

  • Fibonacci
  • Push first in stack
  • Sorted Insertion on stack
  • Insert By Index in Stack
  • Sort a stack
  • Reverse Nodes in k-Group
  • Remove Nodes From Linked List

• Hashing

  • Two Sum
  • Valid Anagram
  • Group Anagrams
  • Top K Frequent Elements
  • Longest Substring Without Repeating Characters
  • Longest Consecutive Sequence
  • Ugly Number

• Sorting

  • Sort List

• Graph Theory

  • Find Center of Star Graph
  • All Paths From Source to Target
  • Find if Path Exists in Graph
  • Find the Town Judge
  • Minimum Number of Vertices to Reach All Nodes
  • Number of Provinces
  • Keys and Rooms

Resources

• INTRODUCTION TO JAVA PROGRAMMING
• java T Point
• Geeks for geeks
• Tutorials Point
• NeetCode
• Visual go