← Amazon questions

LRU Cache Implementation and Connect N Ropes with Minimum Cost

Filed under Amazon

Implement an LRU Cache with O(1) operations and solve the 'Connect N Ropes' problem to minimize total cost, where cost is the sum of lengths of ropes connected.

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.