🎓How I Study AIHISA
📖Read
📄Papers📰Blogs🎬Courses
💡Learn
🛤️Paths📚Topics💡Concepts🎴Shorts
🎯Practice
⏱️Coach🧩Problems🧠Thinking🎯Prompts🧠Review
SearchSettings
How I Study AI - Learn AI Papers & Lectures the Easy Way

Problems9

All SourcesLeetCodeCodeforcesBOJCustom
All LevelsEasyMediumHard
string
Custom#cpq003
1800

Distinct K-Difference Substrings

Phase 6 / string/hash

stringhashsubstringset
Custom#cp005
1600

Sequence Periodic Repeats

Phase 5 / string, array, hashing, two pointers

stringarrayhashperiodicity
Custom#cp-tp3-016
2100

Minimal Unique Substring Split

Phase 3 / string-split

stringgreedyhashingsuffix-array
Custom#cp-tp3-009
1600

Anti-Palindrome Partition

Phase 3 / string-partition

stringpartitionpalindromegreedy
Custom#cp-tp3-006
1400

Shortest Repeating Subsequence Cover

Phase 3 / string-period

stringperiodicitykmpprefix-function
Custom#P015
1500

Unordered Pair Palindromic Concatenation

Phase 2 / String, Hashing

stringpalindromehash
Custom#p020
1900

Weighted Longest Common Subsequence

Phase 1 / dp, lcs, greedy

dpstringlcsgreedy
Custom#ct-p5-03
2250

Versioned String Frequency

Phase 5 / string-advanced

persistent-segment-treestringdata-structure
Custom#ct-p3-01
1800

Minimum Palindromic Cuts with Cost

Phase 3 / classic-dp

dpstringtransition-design