-
- Java Language Click here
- Servlet and JSP Click here
- Spring Click here
- Start with Spring Boot Click here
- Spring Boot Click here
- or Spring Boot Click here
- Microservice Click here
-
- Scoping in Java
- Shadowing
- Variable Length Arguments
- Overloading
-
- Memory management
- Input and Output
- ArrayList Introduction
- Searching
- Linear Search
- Binary Search
- Modified Binary Search
- Binary Search on 2D Arrays
- Sorting
- Insertion Sort
- Selection Sort
- Bubble Sort
- Cyclic Sort
-
- How Strings work
- Comparison of methods
- Operations in Strings
- StringBuilder in java
-
- 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
-
- Flow of recursive programs - stack
- Tree building of function calls
- Tail recursion
- Sorting
- Merge Sort
- Quick Sort
- Backtracking
- N-Queens
- N-Knights
- Sudoku Solver
- Maze problems
- Recursion String Problems
- Recursion Google, Amazon Questions
- Recursion Array Problems
- Recursion Pattern Problems
- Subset Questions
-
- 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
- NP-Completeness Introduction
-
- 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
-
- Singly + Doubly + Circular LinkedList
- Fast and slow pointer
- Cycle Detection
- Reversal of LinkedList
- Linked List + Recursion
-
- Push efficient
- Pop efficient
- Circular Queue
- Queue using Stack and Vice versa
- Interview problems
-
- Binary Trees
- Binary Search Trees
- DFS
- BFS
- AVL Trees
- Segment Tree
-
- Theory
- Priority Queue
- Heapsort
- Two Heaps Method
- k-way merge
- Top k elements
- Interval problems
-
- 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
-
- 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
-
- Recursion + Recursion DP + Iteration + Iteration Space Optimized
- Complexity Analysis
- 0/1 Knapsack
- Subset Questions
- Unbounded Knapsack
- Subsequence questions
- String DP
- Fast IO
- File handling
- Bitwise + DP
- Extended Euclidean algorithm
- Modulo Multiplicative Inverse
- Linear Diophantine Equations
- Matrix Exponentiation
- Mathematical Expectation
- Catalan Numbers
- Fermat’s Theorem
- Wilson's Theorem
- Euler's Theorem
- Lucas Theorem
- Chinese Remainder Theorem
- Euler Totient
- NP-Completeness
- Multithreading
- Fenwick Tree / Binary Indexed Tree
- Square Root Decomposition