Java DSA

• Basic Java Program
  • Input and Output in Java
  • Conditionals & Loops in Java
  • Data-types
• Functions
  • Scoping in Java
  • Shadowing
  • Variable Length Arguments
  • Overloading
• Arrays
  • Searching
  • Sorting
• Pattern questions
• Strings
• Maths for DSA
• Recursion
  • Sorting
    • Merge Sort
    • Quick Sort
  • Backtracking
    • N-Queens
    • N-Knights
    • Sudoku Solver
    • Maze problems
• Object Oriented Programming
  • Classes & its instances
  • this keyword in Java
  • Properties
    • Inheritance
    • Abstraction
    • Polymorphism
    • Encapsulation
  • Overloading & Overriding
  • Static & Non-Static
  • Packages
  • Access Control
  • Interfaces
  • Abstract Classes
  • Annotations
  • Singleton Class
  • final, finalize, finally
  • Object Cloning
  • Object Class
  • Generics
  • Exception Handling
  • Collections Framework
  • Vector Class
  • Lambda Expression
  • Enums
• Linked List
  • Singly + Doubly + Circular LinkedList
  • Fast and slow pointer
  • Cycle Detection
  • Reversal of LinkedList
  • Linked List + Recursion
• Stacks & Queues
  • Introduction
  • Push efficient
  • Pop efficient
  • Circular Queue
  • Queue using Stack and Vice versa
  • Interview problems
• Trees
  • Introduction
  • Binary Trees
  • Binary Search Trees
  • DFS
  • BFS
  • AVL Trees
  • Segment Tree
• Heaps
  • Introduction
  • Theory
  • Priority Queue
  • Heapsort
  • Two Heaps Method
  • k-way merge
  • Top k elements
  • Interval problems
• HashMap
  • Introduction
  • Theory - how it works
  • Comparisons of various forms
  • Limitations and how to solve
  • Map using LinkedList
  • Map using Hash
  • Count Sort
  • Radix Sort
  • Chaining
  • Probing
  • Huffman-Encoder
• Subarray Questions: Sliding window, Two Pointer, Kadane's Algorithm
• Graphs
  • Introduction
  • BFS
  • DFS
  • Working with graph components
  • Minimum Spanning Trees
  • Kruskal Algorithm
  • Prims Algorithm
  • Dijkstra’s shortest path algorithm
  • Topological Sort
  • Bellman ford
  • A* pathfinding Algorithm
• Dynamic Programming
  • Introduction
  • Recursion + Recursion DP + Iteration + Iteration Space Optimized
  • Complexity Analysis
  • 0/1 Knapsack
  • Subset Questions
  • Unbounded Knapsack
  • Subsequence questions
  • String DP
• Greedy Algorithms
• Tries