Title: Interesting Dyn. Pgming question · Issue #11 · AlgorithmCrackers/Interview-Questions · GitHub
Open Graph Title: Interesting Dyn. Pgming question · Issue #11 · AlgorithmCrackers/Interview-Questions
X Title: Interesting Dyn. Pgming question · Issue #11 · AlgorithmCrackers/Interview-Questions
Description: You have an array of english words {cat, then, hen, end, dog}. Can you make out if the given sentence is a concatenation of only words from the array? Cathen -> valid thend -> not valid cathenend -> valid I think a trie can be used here....
Open Graph Description: You have an array of english words {cat, then, hen, end, dog}. Can you make out if the given sentence is a concatenation of only words from the array? Cathen -> valid thend -> not valid cathenend -...
X Description: You have an array of english words {cat, then, hen, end, dog}. Can you make out if the given sentence is a concatenation of only words from the array? Cathen -> valid thend -> not valid cathe...
Opengraph URL: https://github.com/AlgorithmCrackers/Interview-Questions/issues/11
X: @github
Domain: patch-diff.githubusercontent.com
{"@context":"https://schema.org","@type":"DiscussionForumPosting","headline":"Interesting Dyn. Pgming question","articleBody":"You have an array of english words `{cat, then, hen, end, dog}`. Can you make out if the given sentence is a concatenation of only words from the array? \n\n`Cathen` -\u003e `valid` \n`thend` -\u003e `not valid` \n`cathenend` -\u003e `valid` \n\n---\n\nI think a trie can be used here. Like a suffix tree. What do you think? (google qn btw)\n\nEDIT: [GFG link](http://www.geeksforgeeks.org/dynamic-programming-set-32-word-break-problem/)\n","author":{"url":"https://github.com/santhoshvai","@type":"Person","name":"santhoshvai"},"datePublished":"2015-06-30T07:11:06.000Z","interactionStatistic":{"@type":"InteractionCounter","interactionType":"https://schema.org/CommentAction","userInteractionCount":0},"url":"https://github.com/11/Interview-Questions/issues/11"}
| route-pattern | /_view_fragments/issues/show/:user_id/:repository/:id/issue_layout(.:format) |
| route-controller | voltron_issues_fragments |
| route-action | issue_layout |
| fetch-nonce | v2:56ca1fad-7d1a-3f1d-f052-cf9b9510e27d |
| current-catalog-service-hash | 81bb79d38c15960b92d99bca9288a9108c7a47b18f2423d0f6438c5b7bcd2114 |
| request-id | B63C:F5DBC:FBBCCE:15B26F8:69776ECA |
| html-safe-nonce | d70fe972df655c7d2fb1ecd0bcae60e2fb07b56cd7a93e4d31ae4af6adfb6d57 |
| visitor-payload | eyJyZWZlcnJlciI6IiIsInJlcXVlc3RfaWQiOiJCNjNDOkY1REJDOkZCQkNDRToxNUIyNkY4OjY5Nzc2RUNBIiwidmlzaXRvcl9pZCI6IjY0NjIwOTE0ODc2MTY2NTkxNDYiLCJyZWdpb25fZWRnZSI6ImlhZCIsInJlZ2lvbl9yZW5kZXIiOiJpYWQifQ== |
| visitor-hmac | 424adebfb00a1b7aa66eecccc619f653029bf8e507ec08f222aef6633f21bd03 |
| hovercard-subject-tag | issue:92010149 |
| github-keyboard-shortcuts | repository,issues,copilot |
| google-site-verification | Apib7-x98H0j5cPqHWwSMm6dNU4GmODRoqxLiDzdx9I |
| octolytics-url | https://collector.github.com/github/collect |
| analytics-location | / |
| fb:app_id | 1401488693436528 |
| apple-itunes-app | app-id=1477376905, app-argument=https://github.com/_view_fragments/issues/show/AlgorithmCrackers/Interview-Questions/11/issue_layout |
| twitter:image | https://opengraph.githubassets.com/f0c0d7b6a683cfe44078c34d0bcdc0631e9bbb1a1a30f7a8f85c7f01844b30eb/AlgorithmCrackers/Interview-Questions/issues/11 |
| twitter:card | summary_large_image |
| og:image | https://opengraph.githubassets.com/f0c0d7b6a683cfe44078c34d0bcdc0631e9bbb1a1a30f7a8f85c7f01844b30eb/AlgorithmCrackers/Interview-Questions/issues/11 |
| og:image:alt | You have an array of english words {cat, then, hen, end, dog}. Can you make out if the given sentence is a concatenation of only words from the array? Cathen -> valid thend -> not valid cathenend -... |
| og:image:width | 1200 |
| og:image:height | 600 |
| og:site_name | GitHub |
| og:type | object |
| og:author:username | santhoshvai |
| hostname | github.com |
| expected-hostname | github.com |
| None | 9fea6af76c6e24ca5c5728a18d4220d768790d04abe1ba6aafa18526daff96e7 |
| turbo-cache-control | no-preview |
| go-import | github.com/AlgorithmCrackers/Interview-Questions git https://github.com/AlgorithmCrackers/Interview-Questions.git |
| octolytics-dimension-user_id | 7671025 |
| octolytics-dimension-user_login | AlgorithmCrackers |
| octolytics-dimension-repository_id | 26155198 |
| octolytics-dimension-repository_nwo | AlgorithmCrackers/Interview-Questions |
| octolytics-dimension-repository_public | true |
| octolytics-dimension-repository_is_fork | false |
| octolytics-dimension-repository_network_root_id | 26155198 |
| octolytics-dimension-repository_network_root_nwo | AlgorithmCrackers/Interview-Questions |
| turbo-body-classes | logged-out env-production page-responsive |
| disable-turbo | false |
| browser-stats-url | https://api.github.com/_private/browser/stats |
| browser-errors-url | https://api.github.com/_private/browser/errors |
| release | 6c4a3fa336c0d96309887d0be819777cadd37121 |
| ui-target | full |
| theme-color | #1e2327 |
| color-scheme | light dark |
Links:
Viewport: width=device-width