InterviewBit Problems   Highest Product : Solved

About the Highest Product : Solved category (1)
3 line code.....have a look (1)
Easy few lines C++ code (1)
One of easiest approach using sorting (1)
Very easy 3 lines c++ solution (2)
O(logn) simple solution (3)
Simple Cpp solution without sorting O(n) (1)
Simple 3 line answer in C++ (3)
Priority Q is overkill, follow this soln (C++ with comments) (1)
Python 3 O(nlogn) Solution (1)
All solutions here are wrong. Here's the correct one in Java (1)
Easiest Java O(nlogn) Solution (2)
Use heap for O(n) solution if the O(nlogn) is deemed too slow! (4)
Two line cpp code (4)
Only 2 line c++ solution (1)
C++ O(n) solution easy (1)
One line python code: (1)
Java Solution using sorting (1)
Easy short o(n) sol. cpp (1)
A Good Solution ( O(n)+O(1) ) (3)
C++ O(n) solution without sorting (1)
Simple Java Solution O(1) (2)
Why there is run-time error for my below code (1)
Probably a neater solution: sort (A.begin(), A.end()); int n = A.size(); return m (3)
Weak test cases. nlogn is passing! (1)