REPOSITORY OVERVIEWLive repository statistics
★ 2Stars
⑂ 0Forks
◯ 0Open issues
◉ 2Watchers
39/100
OPENREPOHUB HEALTH SIGNALLimited signals
A transparent discovery signal based on current public GitHub metadata.
Recent activity35% weight
30 Community adoption25% weight
5 Maintenance state20% weight
100 License clarity10% weight
0 Project information10% weight
75 This score does not audit code, security, maintainers, documentation quality, or suitability. Verify the repository and its current documentation before adoption.
README preview
📘 Topics Covered
- Complexity Analysis (Time & Space)
- Sorting Algorithms (Merge, Quick, Heap, etc.)
- Searching Algorithms (Linear, Binary)
- Recursion & Backtracking (N-Queens, Maze Solver, etc.)
- Dynamic Programming (Knapsack, LCS, Fibonacci, Matrix Chain Multiplication)
- Greedy Algorithms (Activity Selection, Huffman Coding, MST)
- Graph Algorithms (DFS, BFS, Dijkstra, Bellman-Ford, Floyd-Warshall, Kruskal, Prim)
- Trees & Binary Trees (Traversals, BST operations)
- Heaps & Priority Queues
- Hashing & Hash Tables
- String Algorithms (Pattern Matching, etc.)
🛠️ Tech Stack
- Language: Java (JDK 17 / 22)
- IDE: VS Code / IntelliJ IDEA / Eclipse
- Version Control: Git & GitHub
🚀 How to Run
- Clone the repository:
git clone https://github.com/your-username/Algorithm_DesignImplementation.git
ALGORITHMICALLY RELATEDSimilar Open-Source Projects
Selected from shared topics, language and repository description—not editorial ratings.
This repository contains an implementation of the Red-Black Tree data structure in Java. A Red-Black Tree is a balanced binary search tree with properties that ensure the tree remains balanced, providing efficient search, insertion, and deletion operations.
27/100 healthActive repository
JavaNo license
⑂ 0 forks◯ 0 issuesUpdated Dec 31, 2024
This repository contains java file of BinarySearchTree
27/100 healthActive repository
JavaNo license
⑂ 0 forks◯ 0 issuesUpdated Jul 16, 2023
This repository contain the implementtaion of various Binart Search Tree problem useful in preparation of competative programminng. Question have been taken from GeekforGeeks with java implementtaion