Grokking Microsoft Coding Interview
Vote

0% completed

​
Hidden Document
Hidden Document Content Hidden Document Content Hidden Document Content Hidden Document Content Hidden Document Content Hidden Document Content Hidden Document Content Hidden Document Content Hidden Document Content Hidden Document Content Hidden Document Content Hidden Document Content Hidden Document Content Hidden Document Content Hidden Document Content Hidden Document Content Hidden Document Content Hidden Document Content Hidden Document Content Hidden Document Content Hidden Document Content Hidden Document Content Hidden Document Content Hidden Document Content

.....

.....

.....

Like the course? Get enrolled and start learning!
S

sujay.gunjal

· 2 years ago

This can be solved with O(n) time and O(1) space complexity

Show 1 reply
Z

zerochen231

· 2 years ago

Sorting is n*log(n), we can pass through the array twice to get the two smallest prices.

Show 1 reply

Reading Progress

0%

Vote for new content