Finding HCF of two numbers using Euclid's Algorithm

Ayu-hack / Hacktoberfest-Contributions

This repository helps beginners contribute to open source and participate in Hacktoberfest. We welcome all pull requests (Python & Java), prioritize genuine contributions, and promote good first issues! #hacktoberfest2022 #hacktoberfest2023 #hacktoberfest2024

15 stars 29 forks source link

Finding HCF of two numbers using Euclid's Algorithm #54

Open Virat-Shrimali opened 2 hours ago

Virat-Shrimali commented 2 hours ago

Problem Statement: Write a Java program to find the HCF (also known as GCD - Greatest Common Divisor) of two numbers.

Can you please assign me this issue under Hacktoberfest 2024?

github-actions[bot] commented 2 hours ago

👋 Thank you for raising an issue! We appreciate your effort in helping us improve. Our team will review it shortly. Stay tuned!

Ayu-hack commented 59 minutes ago

Assigned. There are more repos where you can make pull requests, and your contributions will definitely be accepted! They are also part of Hacktoberfest 2024. Don’t forget to tag me in your LinkedIn certificate post if possible. Thank you! 😄

👉 Do follow my GitHub and connect with me on LinkedIn ⭐ Also, don't forget to star these repos to stay updated for next year's Hacktoberfest!