I've written some important Algorithms and Data Structures in an efficient way in Java with references to time and space complexity. These Pre-cooked and well-tested codes help to implement larger hackathon problems in lesser time. DFS, BFS, LCA, LCS, Segment Tree, Sparce Table, All Pair Shortest Path, Binary Search, Matching and many more ...
Enhancements: include new implementations for binary lifting, using this technique queries can be optimized for O(log N) instead of O(N)
In This Repository, I have written some of the important Algorithms and Data Structures efficiently in Java with proper references to time and space complexity.
These Pre-cooked and well-tested codes helps to implement larger hackathon problems in lesser time.