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

 

frew@mclean.com > isOnto
prev  |  next  |  chance

Given a function f from {1, 2, . . . , n} to itself, determine whether f is onto.


isOnto([1, 2, 3, 4], [4, 3, 1, 2], 4) → true
isOnto([1, 1, 1, 1], [4, 3, 2, 1], 4) → true
isOnto([1, 2, 3], [1, 2, 3], 3) → true

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

public boolean isOnto(int[] x, int[] y, int n) { }

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: 200

Copyright Nick Parlante 2017 - privacy