Dynamic Programming vs Divide-and-Conquer
In this article I’m trying to explain the difference/similarities between dynamic programing and divide and conquer approaches based on two examples - binary search and minimum edit distance (Levenshtein distance)
Find Your Interest
- Common misconceptions about testing accessibility
- Common misconceptions about implementing accessibility
- Common accessibility misconceptions
- Permutations/Combinations Algorithms Cheat Sheets
- CSS3: Auto Hyphenation for Text-Elements
- The multiplier effect: How authoring tools can transform web accessibility
- Common misconceptions about disability
- Accessibility in the age of AI
- Common misconceptions about WCAG
- Accessibility foundations





