Complete Java + DSA Bootcamp Syllabus

NOTE

All topics will contain problems from LeetCode Easy to Hard, explained in an easy-to-understand manner.
Complete custom implementation of all Data Structures and Algorithms.

Mind Map

Full Mind Map

Lectures

Complete Git & GitHub Course
Introduction to Programming
- Types of languages
- Memory management
Flow of the program
- Flowcharts
- Pseudocode
Introduction to Java
- Introduction
- How it works
- Setup Installation
- Input and Output in Java
- Conditionals & Loops in Java
- Data-types
- Coding best practices
Functions
- Introduction
- Scoping in Java
- Shadowing
- Variable Length Arguments
- Overloading
Arrays
- Introduction
- Memory management
- Input and Output
- ArrayList Introduction
- Searching
- Sorting
Pattern questions
Strings
- Introduction
- How Strings work
- Comparison of methods
- Operations in Strings
- StringBuilder in java
Maths for DSA
- Introduction
- Complete Bitwise Operators
- Range of numbers
- Prime numbers
- Sieve of Eratosthenes
- Newton's Square Root Method
- Factors
- Modulo properties
- Number Theory
- HCF / LCM
- Euclidean algorithm
Recursion
- Introduction
- Flow of recursive programs - stacks
- Why recursion?
- Tree building of function calls
- Tail recursion
- Sorting:
  - Merge Sort
  - Quick Sort
- Backtracking
  - Sudoku Solver
  - N-Queens
  - N-Knights
  - Maze problems
- Recursion String Problems
- Recursion Array Problems
- Recursion Pattern Problems
- Subset Questions
Space and Time Complexity Analysis
- Introduction
- Comparisons of various cases
- Solving Linear Recurrence Relations
- Solving Divide and Conquer Recurrence Relations
- Big-O, Big-Omega, Big-Theta Notations
- Little Notations
- Get equation of any relation easily - best and easiest approach
- Complexity discussion of all the problems we do
- Space Complexity
- Memory Allocation of various languages
- NP-Completeness Introduction
Object Oriented Programming
- Introduction
- Classes & its instances
- this keyword in Java
- Properties
  - Inheritance
  - Abstraction
  - Polymorphism
  - Encapsulation
- Overloading & Overriding
- Static & Non-Static
- Access Control
- Interfaces
- Abstract Classes
- Singleton Class
- final, finalize, finally
- Object Class
- Generics
- Exception Handling
- Collections Framework
- Lambda Expression
- Enums
- Fast IO
- File handling
Greedy Algorithms
Stacks & Queues
- Introduction
- Interview problems
- Push efficient
- Pop efficient
- Queue using Stack and Vice versa
- Circular Queue
Linked List
- Introduction
- Fast and slow pointer
- Cycle Detection
- Single and Doubly LinkedList
- Reversal of LinkedList
Dynamic Programming
- Introduction
- Recursion + Recursion DP + Iteration + Iteration Space Optimization
- Complexity Analysis
- 0/1 Knapsack
- Subset Questions
- Unbounded Knapsack
- Subsequence questions
- String DP
Trees
- Introduction
- Binary Trees
- Binary Search Trees
- DFS
- BFS
- AVL Trees
- Segment Tree
- Fenwick Tree / Binary Indexed Tree
Square Root Decomposition
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
Tries
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

Advanced concepts apart from placement interviews

Bitwise + DP
Extended Euclidean algorithm
Modulo Multiplicative Inverse
Linear Diophantine Equations
Matrix Exponentiation
Mathematical Expectation
Fermat’s Theorem
Wilson's Theorem
Lucas Theorem
Chinese Remainder Theorem
NP-Completeness