Given an array of integers, delete the max and min numbers (both could appear more than once) in place. Do it in O(n) without shifting.

Question

Removing max and mix · Accepted Answer

1. find max and min in first loop
2. In second loop following if element is min/max = simply increment a counter else a[i-counter] = a[i].

Anonymous · Answer

You could do in one loop, with two cursors :)

anonymous · Answer

Go through the array twice. In the first run save the min and max, in the second run remove them.
Both steps are O(N), so the entire algo is also O(N), it does not matter that the array is walked twice.

Removing max and mix · Answer

1. find max and min in first loop.
2. In second loop if a[i] is min/max then simply increment a counter else a[i-counter] = a[i].

Bloomberg

Bloomberg interview question

Interview Answers

Followed companies

Job searches

Bowls

Want the inside scoop on your own company?