I had my amazon OA and below is one of  the questions. Please let me know your approach and what type of problem is it? (Math, greedy etc)\nI had hard time figuring out and writing backtracking solution.\n\nIt was similar to "shopping options" given 4 arrays and target and need to give all the combination that result in target sum. All items should be picked only once.\n\nfor eg - A = [2,3]\n\t\t\t\tB = [4]\n\t\t\t\t C = [2,3]\n\t\t\t\t D = [1,2]\n\t\t\t\t Target = 10\n\t\t\t\t Ans = 4 ways\n\tExplanation:\t\t\t\n\tSince B has only one item so we have to pick it everytime so target-B = 6\n\tAll the other combination would be [2,2,1] [2,2,2] [3,2,1] [2,3,1]\n\n\t\t\t\t\n\t

I had my amazon OA and below is one of  the questions. Please let me know your approach and what type of problem is it? (Math, greedy etc)\nI had hard time figu