LeetCode 628 – Maximum Product of Three Numbers | C++

The main idea: Sort the array → Take the two smallest × largest → Take the three largest → Compare both products → Return the maximum Time Complexity: O(n log n) Space Complexity: O(1) #LeetCode #LeetCode628 #DSA #Cpp #Coding #Programming #MaximumProduct #Array #Sorting #DSAForBeginners #CodingInterview #ProblemSolving