Task-based Java exercises for practicing data structures, algorithms, and problem solving.
Java exercises. Use the directory map to choose a focused example or learning topic instead of treating the repository as one application.
flowchart TD
A["Select a chapter or exercise"] --> B["Read the associated source or notes"]
B --> C["Run one example or notebook"]
C --> D{"Expected outcome?"}
D -->|Yes| E["Record findings and continue"]
D -->|No| F["Review assumptions and inputs"]
F --> B
| Path | Purpose |
|---|---|
Task-1/ |
Project-specific source, resources, or learning material. |
Task-2/ |
Project-specific source, resources, or learning material. |
Task-3/ |
Project-specific source, resources, or learning material. |
git clone https://github.com/Raimal-Raja/Data-Structure-Algorithms-in-JAVA.git
cd Data-Structure-Algorithms-in-JAVAUse a JDK. Compile individual exercises from their own directories; some folders reuse class names.
javac Task-1/Queue.javaRun the class containing public static void main from the corresponding package/class directory.
Compile or run one exercise at a time, test ordinary and boundary inputs, and compare the output with its stated problem. A successful build is not proof of algorithmic correctness.
Include reproduction steps, the affected path, expected behavior, and the checks you ran. Keep credentials, generated environments, and unnecessary build artifacts out of commits.
No top-level license file is currently tracked. Check reuse permissions with the repository owner.