/Revisiting-DSA-Fundamentals-with-Java-From-Scratch-to-Practice

This repository is all about revisiting the fundamentals of (DSA) using Java, starting from scratch and building up to practical problems.

Primary LanguageJava

Revisiting-DSA-Fundamentals-with-Java-From-Scratch-to-Practice

This repository is dedicated to revisiting my fundamentals of Data Structures and Algorithms, starting from scratch. I'll be using Java to implement the algorithms and solving real-world problems using the most commonly asked interview questions.

The journey starts with the basics, such as arrays, linked lists, stacks, and queues, and progresses through more advanced topics, such as trees, graphs, and dynamic programming. Along the way, I'll be using Leetcode to challenge myself and test my understanding.

Table of Contents

To-do List

  • Foundation (Math+FuzzBuzz)
  • Arrays
  • Strings
  • More Coming

Contribution Guidelines

I appreciate your interest in contributing to this project! If you're looking to make a contribution, please keep in mind that I'm currently only accepting pull requests that optimize existing code.

Before submitting a pull request, please:

  1. Fork the repository.
  2. Create a new branch for your changes.
  3. Make your changes and test them thoroughly.
  4. Ensure that your code adheres to our coding style and standards.

To submit a pull request:

  1. Go to the main repository page.
  2. Click the "Pull Request" button.
  3. Fill out the required information in the pull request form.
  4. Provide a clear and concise description of your changes, and explain why they are necessary.
  5. Make sure that your changes are based on the latest version of the code.

Note: I review all pull requests carefully, but I reserve the right to reject pull requests that do not meet these standards or do not align with the goals of the project.

Thank you for considering contributing to this project! I will look forward to reviewing your changes.

License

This repo is licenced under MIT License.