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

 

zbaharav@kehillah.org 43-arrays1d-nestedloops > zz555_maxProduct2vectors
prev  |  next  |  chance

Given two non-empty integer arrays, a and b, find the maximum value which can be achieved as a product of an element from a with element from b.


zz555_maxProduct2vectors([1, 2, 3], [3, 4, 2]) → 12
zz555_maxProduct2vectors([0, 1, 0], [7, 8]) → 8
zz555_maxProduct2vectors([0, -1, -2], [3, -2]) → 4

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

public int zz555_maxProduct2vectors(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