Hi,

I'm trying to solve greedy algo problem listed here. Can you guys drop some hints on how can I solve this?

Thanks in advance!

Problem -

Given an array of integers, return the highest product possible by multiplying 3 numbers from the array

Qt Code:
  1. array of integers e.g {1, 2, 3}
To copy to clipboard, switch view to plain text mode 

Example:

Qt Code:
  1. [0, -1, 3, 100, 70, 50]
  2.  
  3. => 70*50*100 = 350000
To copy to clipboard, switch view to plain text mode