New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
WordBreak #112
Comments
interviews/company/uber/WordBreak.java This is not a good solution for the WordBreak problem referenced above. It will fail for the following input string and any other input string that has a word within a word. i.e buzzword -> this can be broken up into: "buzz", "word". So for input string == "buzzwordsarecool" |
This problem only returns boolean. while boolean state is return, this may be a better solution in O(n^2) time complexity. |
No description provided.
The text was updated successfully, but these errors were encountered: