← Amazon questions

Connect Ropes with Minimum Cost and Reverse Alternate K Nodes

Filed under Amazon

Given an unsorted array of pipe lengths, combine them to minimize cumulative cost until one pipe remains (standard Huffman tree / min-cost connect ropes problem). Additionally, given a singly linked…

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.