🎓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

Problems8

All SourcesLeetCodeCodeforcesBOJCustom
All LevelsEasyMediumHard
set
Custom#P019-773
2100

Maximum Segment Set Sum

Phase 5 / dp/set/nonoverlap

dpsetsegments
Custom#cpq014
1400

Minimum Unique Window

Phase 6 / sliding-window/set

sliding-windowuniquesetarray
Custom#cpq003
1800

Distinct K-Difference Substrings

Phase 6 / string/hash

stringhashsubstringset
Custom#cp014
1500

Longest Contiguous Segment with Unique Sums

Phase 4 / prefix sum, set, sliding window

sliding windowprefix sumset
Custom#cp001
2100

Split Array with Maximum Distincts

Phase 6 / dp, sliding window, optimization

dpgreedysliding windowset
Custom#cptp014
2300

Longest Sum-Free Subsequence

Phase 5 / set_theory, greedy

greedysetconstruction
Custom#cptp003
1500

Bitwise Or Interval Count

Phase 4 / bitmasks, set_maintenance

bitmaskssetsubarrays
Custom#cp-tp3-017
1725

Sumset Subsequence Counting

Phase 3 / subsequence-enumeration

combinatoricsdpsubsequenceset