Intuition Rewire

Home Roadmap Visualizer & Lessons Dry-Run Engine Pricing

Esc

Loading…

↑ ↓ to moveEnter to openEsc to close

Sign in Sign up free

Home Roadmap Visualizer & Lessons Dry-Run Engine Pricing Learning Path

0% completed

Introduction to strings

Understanding characters and bytes
Understanding the problem
How encodings change what length means
Overview of supported operations
Internal mechanics of strings
Working example

Immutability and building

Understanding the problem
The hidden cost of concatenation
How string builders avoid the cost
Repeat a string n times
Run length encoding

Pattern: Two pointers

Understanding the two pointer pattern
Identifying direct application
Reverse a string in place
Palindrome checker
Vowel exchange
Reverse words
Palindrome after one deletion

Pattern: Sliding window

Understanding the sliding window pattern
Carrying a frequency map in the window
Longest substring without repeats
Longest substring with k distinct characters
Permutation in a string
Minimum window substring

Pattern: Frequency counting

Understanding frequency counting
Choosing a canonical signature
Valid anagram
Group anagrams
First unique character

Pattern: Substring search

Understanding substring search
Why brute force degrades to O(N·M)
Building the prefix function
Find the first occurrence
Detect a repeated pattern

Pattern: Parsing and partitioning

Understanding parse-as-you-scan
Validate a number
Partition labels
Decode a nested string

Intuition Rewire— Algorithmic Mental Models & Hardware Diagnostics

Privacy Terms Refunds Contact

© 2026 Intuition Rewire. Systematic Engineering Mastery.

Why brute force degrades to O(N·M) – Strings

Home
Courses
Strings
Why brute force degrades to O(N·M)

Why brute force degrades to O(N·M)

This lesson is still being written.

Mark completed

Was this helpful?

Keep exploring

ArraysContiguous, indexable memory — the foundation almost every other data structure builds on.12 lessons · 16 problems
Hash MapKey → value lookups in O(1) on average — the tool behind counting, “seen it before?” checks, prefix sums and sliding windows.4 lessons · 11 problems
StackLast-in, first-out — the structure behind call stacks, undo history, and expression parsing.6 lessons · 13 problems