Hi Team,

I have been recently interviewed at Amazon AWS , below are the rounds and questions asked . I want to find out exact question/approach/answer for the last round question.

Round 1 : top k elements in stream
Round 2 : top k closest elements for a target in an array
Round 3 : Max Stack
Round 4: Design instagram
Round 5 : Baby blocks - given a target word Ex:"baby" . we need to identify whether we can form the target from below pairs . we should use one pair only once .

Target - ------------Pairs--------------output
baby - <b,a><a,b><b,c><x,y><e,f> - Yes
able - <b,a><a,b><l,e><c,d> - No

I suspect this is related to word break problem , If any one has clear understanding , please help me and other in understanding the exact problem.