Top 10 coding interview problems asked in Google with solutions: Algorithmic Approach by Lin Quan

Author:Lin Quan [Quan, Lin]
Language: eng
Format: epub
Published: 2014-01-21T00:00:00+00:00

4.2.3 Time Complexity

This algorithm consists of n additions and at most 2n comparisons, so the complexity is around 3n.

Hence complexity is linear, i.e., O(n).

4.3 Find subarray with sum closest to zero

Find a sub-array whose sum is closest to zero rather than that with maximum sum. Please note that closest to zero doesn’t mean minimum sum

Assuming input array is a, let us have a notion of prefix array prefixa such that

prefixa[i] = a[0] + a[1] + a[2] + … + a[i - 1] + a[i]

prefixa[i] = prefixa[i - 1] + a[i]

Download

Copyright Disclaimer:
This site does not store any files on its server. We only index and link to content provided by other sites. Please contact the content providers to delete copyright contents if any and email us, we'll remove relevant links or contents immediately.