Word Break | Recursion vs DP | DSA Shorts

Can you split this string into real dictionary words? The brute force tries every possible split — that's 2^n combinations.

In this Code Battle, we compare two approaches:

Approach A: Brute Force Recursion — O(2^n)
At each position, try every possible prefix. If it's a word, recursively check the rest. Exponential time. For a string of length 20, over a million combinations.

Approach B: Dynamic Programming — O(n^2)
DP array where dp[i] means the first i characters can be segmented. For each position, check all possible words ending there. If dp[start] is true and the substring is a word, dp[end] is true. Build left to right.

Winner: Approach B. DP checks each position once. Exponential to polynomial — the difference between timeout and accepted. Google and Meta test this in round 2.

Practice coding interviews with AI feedback on interviewforge.dev

#dsa #leetcode #coding #programming #dynamicprogramming #dp #wordbreak #interviewprep #codinginterview #faang #google #meta #datastructures #algorithms #interviewforge #tech

Видео Word Break | Recursion vs DP | DSA Shorts канала InterviewForge