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

 

orion.a.smith@gmail.com apcsa-primitives > apcsaPrimitivesReturnMod
prev  |  next  |  chance

Given two int inputs, return the remainder of num after dividing by mod.


apcsaPrimitivesReturnMod(3, 5) → 3
apcsaPrimitivesReturnMod(6, 5) → 1
apcsaPrimitivesReturnMod(12, 5) → 2

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

public int apcsaPrimitivesReturnMod(int num, int mod) { }

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: 100 Post-solution available

Copyright Nick Parlante 2017 - privacy