K5kC | Code & More

Computer Science

Algorithms Programming Languages Database System Design

Blind 75 Difficulty: Easy Difficulty: Medium Difficulty: Hard

Android Data Science Computer Vision Simulations

UUID Generator Code Formatter

Word Break 1 - Check if word is breakable

medium Solve on LeetCode

Problem
Examples
Follow up
Solution
Video explanation
Method 1 - Naive - Generate all substrings
Method 2 - Still naive - Try to break the string using all prefixes
Code
Complexity
Method 3 - Still naive - Looping Over Dict
Code
Complexity
Method 4 - Top Down DP - DFS with memoization
Repetitive Subproblems
Code
Complexity
Method 5 - Bottom up DP
Code
Method 5 - BFS
Intuition
Approach
Dry Run
Code
Complexity
Method 6 - Using Trie DS
Intuition
Approach
Code
Complexity
Dry run

video explanation

Related Tags

backtracking bfs dfs dynamic-programming hash-table leetcode memoization string trie video word word-break

Privacy Disclaimer Report an Issue About

© 2026 K5kC | Code & More. All rights reserved.

चरैवेति चरैवेति | Keep moving on