Function that takes a two-digit number and determines if it's the largest of two possible digit swaps. :
Probelm Link : https://edabit.com/challenge/mQbddasCYNTTzQEgmChoose one Cateorgy - Easy
question category : Numbers
Before submitting a PR please Check some details.
[x] fileName formet should be in camelcase
example- returnTheNextNumber.py
[x] Choose label for Problem , example- "good first issue", "easy"
[x] In file there should be problem statement and link to problem
/* Problem-Task : This program will add two numbers
* Problem Link : https://edabit.com/challenge/SFzHtm63XT6EYNHWY
*/
int main() {
int bla;
return 0;
}
Before jumping into Pr first comment for assign.
Function that takes a two-digit number and determines if it's the largest of two possible digit swaps. : Probelm Link : https://edabit.com/challenge/mQbddasCYNTTzQEgm Choose one Cateorgy - Easy question category : Numbers
Before submitting a PR please Check some details.
This repository is vaild for HacktoberFest2020
Read before making PR - How to contribute on Github Good Luck,