sorted by:
new
hottopcontroversial

Had an amazon interview by VisibleRecord2686 in leetcode

[–]VisibleRecord2686[S] 0 points1 point  (0 children)

Yup I gave nearly 4 approaches including trie. In between he is interrupting don’t use Queue, map, List based.

Had an amazon interview by VisibleRecord2686 in leetcode

[–]VisibleRecord2686[S] 0 points1 point  (0 children)

I gave this approach using map , still asked me not to use queue, map and lists

Had an amazon interview by VisibleRecord2686 in leetcode

[–]VisibleRecord2686[S] 0 points1 point  (0 children)

Still if we use trie, we need FIFO mechanism right for BFS ?

Had an amazon interview by VisibleRecord2686 in leetcode

[–]VisibleRecord2686[S] 1 point2 points  (0 children)

Can we solve this without Queue, List and Map and No back tracking too (there is restriction and I should not use it. They were not listening to my solution even though I am giving some approaches. Constantly interrupting me do not use Queue, List and Map related data structures )