Maximum product of two numbers in an array in O(n) time
Filed under Western Digital
The question
Given an array of integers that may contain negative values, write a C program to find the maximum product of two numbers in O(n) time.
No write-up yet. Related questions below have one.
Related Western Digital questions
- Represent Number Greater than 7 as Sum of Multiples of 3 and 5
- Form a Straight Line from a Single Given Point
- Macros, Primes, Linked List Deletion, Bit Manipulation
- Detect/Remove Loop, Middle of Linked List, Stack via List, Longest Palindromic Substring
- Segregate 0s and 1s, and sort an array of 0s, 1s, and 2s
Collected from public candidate posts and coding forums. Updated Nov 2026.