Welcome to Competitive Coding Java, a comprehensive collection of Java solutions for a wide range of competitive programming problems. The goal of this repository is to enhance coding skills by tackling various challenges with efficient Java solutions. 💪
The repository is organized into different categories for easy navigation:
| 📁 Category | 🔍 Description |
|---|---|
| Arrays | Problems related to arrays, sorting, searching, etc. |
| Strings | String manipulation, pattern matching, etc. |
| Mathematics | Number theory, prime numbers, GCD/LCM, etc. |
| Searching & Sorting | Binary search, sorting algorithms, etc. |
| Recursion & Backtracking | Recursive problems, backtracking algorithms, etc. |
| Dynamic Programming | Optimization problems, memoization, etc. |
| Graphs & Trees | Graph traversal, tree operations, etc. |
| Bit Manipulation | Problems involving bitwise operations. |
| Miscellaneous | Unique or uncategorized problems. |
- Clone the Repository
git clone https://github.com/rishaan007/Competitive-Coding-Java.git- Navigate to the Repository
cd Competitive-Coding-Java- Compile and Run Java Files
javac YourFileName.java
java YourFileName- Java JDK 8 or above.
- Basic knowledge of Java syntax and object-oriented concepts.
Contributions are always welcome! If you have a better solution or new problem to add, feel free to create a pull request.
Got questions or suggestions? Feel free to reach out:
📩 rishaankumar.it2024@nsec.ac.in
The journey of coding is like Java's public static void main(String[] args) — It all starts from here! 😄