Word Break Problem?

Short answer: bool WordBreak(string s, HashSet<string> wordDict) { bool[] dp = new bool[s.Length + 1]; dp[0] = true; for (int i = 1; i <= s.Length; i++) { for (int j = 0; j < i; j++) { if (dp[j] && wordDict.Contains(s.Substring(j, i - j))) { dp[i] = true; break; } } } return dp[s.Length]; } Explanation: DP to check if substring can be segmented using dictionary words. Follow on:

Example code

bool WordBreak(string s, HashSet<string> wordDict) {
bool[] dp = new bool[s.Length + 1];
dp[0] = true;
for (int i = 1; i <= s.Length; i++)
{
for (int j = 0; j < i; j++)
{
if (dp[j] && wordDict.Contains(s.Substring(j, i - j)))
{
dp[i] = true; break; }
}
}
return dp[s.Length];
} Explanation: DP to check if substring can be segmented using dictionary words. Follow on:

Real-world example (ShopNest)

In coding rounds, state complexity aloud, write a clear ShopNest-flavored example (orders, carts), then handle edge cases (empty list, null, overflow).

Say this in the interview

1. Define — one clear sentence (the short answer above).
2. Example — relate it to a project like ShopNest or your real work.
3. Trade-off — when you would not use it.