id/email
password
forgot password | create account
about | help | code help+videos | done | prefs
CodingBat code practice

 

getDigit


Define a function that when passed two integers (say n and k), returns the k h digit in n, where the 1st digit is the right most digit (least significant digit). Return 0 if n does not have k digits.


getDigit(1729, 1) → 9
getDigit(1729, 3) → 7
getDigit(1729, 4) → 1

...Save, Compile, Run (ctrl-enter)

int getDigit(int n, int k) { }

Editor font size %:
Shorter output


Forget It! -- delete my code for this problem

Progress graphs:
 Your progress graph for this problem
 Random user progress graph for this problem
 Random Epic Progress Graph

Java Help

Misc Code Practice

Difficulty: 2 Post-solution available

Copyright Nick Parlante 2017 - privacy