O(n^2) time and O(n) space using BFS

Author: 149ps

139. Word Break/139. Word Break.py

@@ -30,8 +30,9 @@ def wordBreak(self, s: str, wordDict: List[str]) -> bool:
             if start not in visited:
                 for end in range(start+1,len(s)+1):
                     if s[start:end] in wordDict:
-                        q.append(end)
                         if end == len(s):
                             return True
+                        else:
+                            q.append(end)
                 visited.add(start)
         return False