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

 

pais@kinetigram.com > A116_middleWay
prev  |  next  |  chance

APCS Array 1, Problem 16. Given 2 int arrays, a and b, each length 3, return a new array length 2 containing their middle elements.


A116_middleWay([1, 2, 3], [4, 5, 6]) → [2, 5]
A116_middleWay([7, 7, 7], [3, 8, 0]) → [7, 8]
A116_middleWay([5, 2, 9], [1, 4, 5]) → [2, 4]

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

public int[] A116_middleWay(int[] a, int[] b) { }

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

Copyright Nick Parlante 2017 - privacy