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

 

tlsmith2@wsfcs.k12.nc.us > array1DSmallestProduct
prev  |  next  |  chance

Start with 2 int arrays, a and b, each length 2. Consider the product of the values in each array. Return the the smallest product.


array1DSmallestProduct([4, 5], [3, 2]) → 6
array1DSmallestProduct([-1, 2], [-4, -5]) → -2
array1DSmallestProduct([8, 2], [4, 4]) → 16

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

public int array1DSmallestProduct(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: 10 Post-solution available

Copyright Nick Parlante 2017 - privacy