princesah09 / hacktoberfest2023

Make your first Pull Request on Hacktoberfest 2023. Don't forget to spread love and if you like give us a ⭐️

Join our telegram-group

HacktoberFest-2023

Welcome to the HacktoberFest-2023 repository!

Motive

This repository is dedicated to organizing and merging solutions to Data Structure and Algorithm (DSA) questions from Striver's DSA sheet. The primary goal is to create a comprehensive and structured collection of DSA solutions that can serve as a valuable resource for learners and enthusiasts.

Hacktoberfest 2023

Hacktoberfest is an annual event that celebrates open source. During the month of October, developers from around the world are encouraged to contribute to open-source projects on GitHub. By participating in Hacktoberfest, you have the opportunity to make meaningful contributions to the open-source community and earn exciting rewards!

How to Contribute

To contribute to this repository for Hacktoberfest 2023, follow these steps:

1. Fork this repository.
2. Clone your forked repository to your local machine.
3. Add your DSA solutions to the appropriate folders or categories.
4. Commit your changes and push them to your fork.
5. Create a pull request to merge your contributions into this repository.

Please ensure that your contributions adhere to the guidelines provided in the CONTRIBUTING.md file.

Contribution Rules📚:

• You are allowed to make pull requests that break the rules. We just merge it ;)
• Do NOT add any build steps e.g npm install (we want to keep this a simple static site)
• Do NOT remove other content.
• Styling/code can be pretty, ugly or stupid, big or small as long as it works

• Try to keep pull requests small to minimize merge conflicts

Getting Started 🤩🤗:

• Fork this repo (button on top)
• Clone on your local machine

git clone https://github.com/fineanmol/Hacktoberfest2022.git

• Navigate to project directory.

cd Hacktoberfest2022

• Create a new Branch

git checkout -b my-new-branch

git add .

• Commit your changes.

git commit -m "Relevant message"

• Then push

git push origin my-new-branch

• Create a new pull request from your forked repository

Our Top Contributors

hacktoberfest2023's Issues

Implement Upper Bound (Binary Search)

Write C++ program to implement upper bound.

Search in Rotated Sorted Array I (Binary Search)

Sqrt of a number (Binary Search)

Find peak element (Binary Search)

Search in Rotated Sorted Array II (Binary Search)

Implement Lower Bound (Binary Search)