-
Notifications
You must be signed in to change notification settings - Fork 12.9k
Open
Description
-
- Introduction
- Classes & instances
- this keyword
- Properties
- 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
-
- Introduction
- Push efficient
- Pop efficient
- Queue using Stack / Stack using Queue
- Circular Queue
- Interview problems
-
- Introduction
- Binary Trees
- Binary Search Trees
- Interview questions
- DFS
- BFS
- AVL Trees
- Segment Tree
- Fenwick Tree / BIT
-
Heaps
- Introduction
- Theory
- Priority Queue
- Heapsort
- Two Heaps Method
- k-way merge
- Top k elements
- Interval problems
-
HashMap
- Introduction
- Theory & comparisons
- Limitations
- Chaining
- Probing
- Huffman Coding
- Karp-Rabin String Matching
-
Subarray Problems (Sliding Window, Two Pointer, Kadane)
-
Graphs
- Introduction
- BFS
- DFS
- Components
- MST
- Kruskal
- Prims
- Dijkstra
- Topological Sort
- Bellman Ford
- A* Pathfinding
-
Dynamic Programming
- Introduction
- Recursion → DP → Iteration → Space optimized
- 0/1 Knapsack
- Subset Problems
- Unbounded Knapsack
- Subsequence Problems
- String DP
-
Greedy Algorithms
-
Tries
Advanced Concepts
- 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
- Square Root Decomposition
Metadata
Metadata
Assignees
Labels
No labels