Hi everyone !!\nI was recently asked this question in the onsite at Amazon.\nhttps://leetcode.com/problems/word-break/\nI explained him the standard solution using BFS which is O(n) time ans O(n) space.However, the interviewer was deeply interested with me solving the question via making a Graph and then solving it.\nI didn\'t find it to be any better approach as it had the same time and space run.\n Can anyone help me with the approaches to this question ?\n \n What is the most optimum solution to this problem ?

Hi everyone !!\nI was recently asked this question in the onsite at Amazon.\nhttps://leetcode.com/problems/word-break/\nI explained him the standard solution us