How doocs/leetcode works
This repository is a multilingual algorithm-answer collection: readers find a problem or topic, then inspect or reuse a solution in a supported language. The README documents LeetCode, contest, LCOF, LCOF2, LCCI, JavaScript, and database collections, alongside topic-focused algorithm material. The supplied tree directly shows LCCI answers and basic sorting implementations; other documented collections are retained as catalog branches, but their source paths are unavailable here. Sampled sorting programs demonstrate standalone input–algorithm–output behavior; no shared runtime or central dispatch is evidenced.
Main entry points: MergeSort/Main.java Input Driver · Solution.cpp LCCI Answers · sorting Sorting Algorithms · QuickSort/Main.java Quick Sort
Components 15
Problem Sets
- LeetCode Answers
- Contest Answers
- LCOF Answers
- LCOF2 Answers
- LCCI Answers
lcci/01.01.Is Unique/Solution.cpp - JavaScript Practice
- Database Practice
Topic Solutions
- Basic Algorithms
basic/sorting/MergeSort/Main.java - Sorting Algorithms
basic/sorting
Sampled Implementations
- Input Driver
basic/sorting/MergeSort/Main.java - Merge Sort
basic/sorting/MergeSort/Main.java - Sorted Output
basic/sorting/MergeSort/Main.java - Quick Sort
basic/sorting/QuickSort/Main.java - Heap Sort
basic/sorting/HeapSort/Main.java
Other components
- Reader
Connections 13
- Reader → LeetCode Answers: browses
- Reader → Contest Answers: browses
- Reader → LCOF Answers: browses
- Reader → LCOF2 Answers: browses
- Reader → LCCI Answers: browses
- Reader → JavaScript Practice: browses
- Reader → Database Practice: browses
- Reader → Basic Algorithms: browses
- Reader → Sorting Algorithms: browses
- Input Driver → Merge Sort: calls
- Merge Sort → Sorted Output: produces
- Input Driver → Quick Sort: calls
- Input Driver → Heap Sort: calls