← Amazon questions

LCA in BST/Tree, pointer modification, coin ways, and loop removal

Filed under Amazon

Given an array of possible run values (e.g., [1, 2, 3, 4, 6]) and a target score 'N', find the number of ways a batsman can score exactly 'N' runs. The order of scoring does not matter (combinations).

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.