← Amazon questions

Largest Contiguous Sum, Connect Ropes, Print Left View

Filed under Amazon

Solve three problems: 1) Find the largest contiguous sum in an array (Maximum Subarray Problem). 2) Connect N ropes with minimum cost (Huffman coding greedy approach). 3) Print the left view of a…

You've read your 3 free write-ups

Sign up free to keep reading. Your account opens the first 10 questions of every company.

Related Amazon questions

Collected from public candidate posts and coding forums. Updated Nov 2026.