| about | help | code help+videos | done | prefs |
APCS Logic 5, Problem 6. Given two ints, each in the range 10..99, return true if there is a digit that appears in both numbers, such as the 2 in 12 and 23. (Note: division, e.g. n/10, gives the left digit while the % "mod" n%10 gives the right digit.) L56_shareDigit(12, 23) → true L56_shareDigit(12, 43) → false L56_shareDigit(12, 44) → false ...Save, Compile, Run (ctrl-enter) |
Progress graphs:
Your progress graph for this problem
Random user progress graph for this problem
Random Epic Progress Graph
Difficulty: 200
Copyright Nick Parlante 2017 - privacy