Mozilla-Campus-Club-Cummins/Git-Avengers-Workshop

Find GCD and LCM of two numbers

Open

#23 opened on Mar 8, 2023

View on GitHub
 (0 comments) (0 reactions) (0 assignees)Java (63 forks)auto 404
easygood first issue

Repository metrics

Stars
 (1 star)
PR merge metrics
 (No merged PRs in 30d)

Description

Enter 2 integer numbers 30 40 GCD = 10 LCM = 120

Contributor guide

Research direction
Write a Java program that reads two integers and computes their GCD and LCM. Implement Euclid's algorithm for GCD and use the relationship GCD * LCM = product of numbers.
Tech stack
java
Domain
backend
Issue type
Feature
DifficultyEstimated implementation difficulty for a new contributor, from 1 for very small changes to 5 for expert-level work.
1
Estimated timeA rough time range for an experienced contributor to investigate, implement, test, and prepare a pull request.
Under 1 hour
Activity statusHow available the issue appears right now: fresh, active, stale, blocked, or waiting on maintainer input.
Fresh
ClarityHow clearly the issue explains the expected change, acceptance criteria, and next step.
Clear
Prerequisites
None
Newbie friendlinessA 1-100 score estimating how approachable this issue is for first-time contributors.
95