https://github.com/hyperplasma/ultimate-solutions
Hyplus solutions for LeetCode, PAT, etc. Mainly in Java, C++, and Go. Daily AC!
https://github.com/hyperplasma/ultimate-solutions
cpp golang java javascript leetcode leetcode-java marscode php pta
Last synced: 6 months ago
JSON representation
Hyplus solutions for LeetCode, PAT, etc. Mainly in Java, C++, and Go. Daily AC!
- Host: GitHub
- URL: https://github.com/hyperplasma/ultimate-solutions
- Owner: hyperplasma
- License: apache-2.0
- Created: 2024-12-30T12:59:06.000Z (9 months ago)
- Default Branch: master
- Last Pushed: 2025-02-07T12:34:21.000Z (8 months ago)
- Last Synced: 2025-04-12T15:12:49.505Z (6 months ago)
- Topics: cpp, golang, java, javascript, leetcode, leetcode-java, marscode, php, pta
- Language: Java
- Homepage: https://www.hyperplasma.top
- Size: 704 KB
- Stars: 0
- Watchers: 1
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
- License: LICENSE
Awesome Lists containing this project
README
# Ultimate Solutions
A comprehensive collection of solutions and algorithm templates for programming challenges from LeetCode, PAT (Programming Ability Test), and other coding platforms, and also some homemade utils.
## Overview
This repository contains solutions and algorithm templates written by Hyperplasma to various programming problems, primarily implemented in:
- Java (mainly)
- Go
- JavaScript
- PHP
- C/C++
The solutions encompass problems from the following platforms:
- LeetCode
- Daily/Weekly/Biweekly Challenges
- Classic problem sets
- Database Problems
- PAT
- Basic Level (乙级)
- Advanced Level (甲级)
- Doubao MarsCode
For more information on each problem set, please refer to `info.md` in their respective directories.
## Features
- Cross-language algorithm templates
- Detailed problem solutions
- Multiple language implementations
- Daily updates
- Optimized solutions
- Pragmatic utils
The solution collection covers the following algorithmic categories:
### Data Structures
- Array & String Manipulation
- Linked Lists
- Trees (Binary Trees, BST, N-ary Trees)
- Graphs
- Hash Tables
- Stacks & Queues
- Heaps
### Algorithms
- Dynamic Programming
- Depth-First Search (DFS)
- Breadth-First Search (BFS)
- Binary Search
- Two Pointers
- Sliding Window
- Greedy Algorithms
- Backtracking
- Sorting & Searching
- Bit Manipulation
### Advanced Topics
- Divide and Conquer
- Union Find
- Trie
- Segment Trees
- Mathematics & Number Theory
- System Design Problems
## Usage
Each solution includes:
- Problem description
- Solution approach
- Code implementation
- Time & Space complexity
Tips for Use:
- Use the search function to find specific problems
- Check the commit history for recent updates
- Refer to `info.md` in each directory for additional details
- For questions or improvements, feel free to open an issue
## Contributing
Feel free to create issues or PRs if you have better solutions!
## License
[Apache License 2.0](LICENSE)