🎓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

Problems11

All SourcesLeetCodeCodeforcesBOJCustom
All LevelsEasyMediumHard
partition
Custom#P011-287
2000

Maximal Sum Partition with Constraints

Phase 5 / binary_search/greedy/partition

binary searchgreedypartition
Custom#P001-121
1450

Constrained Palindromic Split

Phase 4 / palindromes/dp/partition

dynamic programmingpalindromepartition
Custom#cp008-700
1500

Minimal Cuts for Equal Segment Sums

Phase 5 / prefix sums, greedy

prefix sumspartitiongreedy
Custom#cpq016
1750

K-Partition Equal Sums

Phase 6 / prefix-sum/partition

prefix-sumpartitionarray
Custom#cpq007
1900

Lexicographically Minimal Increasing Subsequences

Phase 6 / greedy/partition

greedypartitionsequencelexicographic
Custom#cpq002
1500

Sum-Free Permutation

Phase 6 / greedy/array

greedypartitionarray
Custom#cp012
1700

K-Divisible Subset Partition

Phase 5 / modulo, dp, multiset

dpgreedypartitionmodulo
Custom#cp-tp3-009
1600

Anti-Palindrome Partition

Phase 3 / string-partition

stringpartitionpalindromegreedy
Custom#cp-tp3-005
1850

Circular Array Maximum Modulo

Phase 3 / circular-partition

arraycircularpartitionbinary-search
Custom#P006
1600

Minimal Swaps to K-Partition

Phase 2 / Greedy, Partitioning

greedypartitionswaps
Custom#P004
1600

Partitioned GCD Sum

Phase 2 / DP, GCD

dpgcdpartition