Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Jump to bottom

Euclid’s Algorithm to find GCD of two numbers #2550

Open
nikhilmaurya26 opened this issue Oct 26, 2022 · 7 comments
Open

Euclid’s Algorithm to find GCD of two numbers #2550

nikhilmaurya26 opened this issue Oct 26, 2022 · 7 comments

Comments

@nikhilmaurya26
Copy link

Euclid’s Algorithm to find GCD of two numbers
@MohitKumarSingh-01
Copy link

@tarunsinghofficial Please Assign this issue to me
Thanking you in Anticipation...
Regards
Mohit Kumar Singh

@uchihapk07
Copy link

Hello @tarunsinghofficial sir, Please assign this issue to me.

@hacreating
Copy link

Hello @nikhilmaurya26 , please assign this issue to me i have optimized and efficient approaches to do it .
Thanks and Regards
shashwat sharma

@utkarshaskumbhar
Copy link

Please assign me this issue as today is last day and this is my last pr

@srinjoy07pal
Copy link

hello @nikhilmaurya26 pls assign this issue to me i am a newbie and am practising for the fest this year

@abhichauhan824
Copy link

Hello @nikhilmaurya26 give me a chance i will provide you more efficient and readable code

@Abhi13070
Copy link

Hello @tarunsinghofficial please assign this issue to me

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Assignees
No one assigned
Labels
None yet
Projects
None yet
Milestone
No milestone
Development

No branches or pull requests
8 participants
@hacreating @nikhilmaurya26 @MohitKumarSingh-01 @uchihapk07 @abhichauhan824 @Abhi13070 @utkarshaskumbhar @srinjoy07pal