Data Structure Problem Solving is a curated collection of solutions to various data structure and algorithm problems, primarily sourced from platforms like LeetCode. Each solution is implemented in Java, aiming to enhance problem-solving skills and understanding of core computer science concepts.
To explore and run the solutions:
-
Clone the repository:
git clone https://github.com/HridaySharma2002/Data-Structure_Problem_Solving.git
-
Navigate to the directory:
cd Data-Structure_Problem_Solving -
Open the desired Java file in your preferred IDE or text editor.
-
Compile and run the Java file:
javac LeetCode_XXX_Problem_Name.java java LeetCode_XXX_Problem_Name
Replace XXX_Problem_Name with the specific problem file you wish to execute.
// Example usage for LeetCode_02_Add_Two_Numbers
LeetCode_02_Add_Two_Numbers solution = new LeetCode_02_Add_Two_Numbers();
int result = solution.addTwoNumbers(list1, list2);
System.out.println(result);Contributions are welcome! If you'd like to add solutions or improve existing ones:
-
Fork the repository.
-
Create a new branch:
git checkout -b feature/your-feature-name
-
Commit your changes:
git commit -m 'Add new solution or improve existing one' -
Push to the branch:
git push origin feature/your-feature-name
-
Open a pull request detailing your changes.
- Comprehensive solutions for LeetCode problems.
- Each solution includes problem descriptions and comments for clarity.
- Regular updates with new problems and solutions.
This project is licensed under the GNU General Public License v3.0.
LeetCode for providing a vast array of algorithmic challenges.
The open-source community for continuous learning and inspiration.
Documentation for additional resources and explanations.
- Future improvements and additional problem solutions will be added.
- Potential for translation into other programming languages.