🎓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

Problems51

All SourcesLeetCodeCodeforcesBOJCustom
All LevelsEasyMediumHard
greedy
Custom#cp008-700
1500

Minimal Cuts for Equal Segment Sums

Phase 5 / prefix sums, greedy

prefix sumspartitiongreedy
Custom#cp005-400
1400

Minimal Moves to Palindromic Array

Phase 5 / arrays, greedy, math

arraysgreedypalindrome
Custom#cp003-202
1400

Range Partition with Uniques

Phase 5 / arrays, hashset, greedy

arraysgreedyhashing
Custom#cp001-893
1500

Modulo K Equal Frequency

Phase 5 / arrays, greedy, math

arraysgreedyfrequencymodulo
Custom#cpq013
1550

Graph Degree Parity Transform

Phase 6 / graph/degree-parity

graphparitydegreegreedy
Custom#cpq011
1450

K-Color Consecutive Difference

Phase 6 / dp/greedy

greedydpcoloring
Custom#cpq007
1900

Lexicographically Minimal Increasing Subsequences

Phase 6 / greedy/partition

greedypartitionsequencelexicographic
Custom#cpq005
1700

Array XOR Equalization

Phase 6 / greedy/xor

xorgreedyarray
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#cp008
1500

Minimum Total Weight to Balance Array

Phase 4 / greedy, math, optimization

greedyarraymath
Custom#cp001
2100

Split Array with Maximum Distincts

Phase 6 / dp, sliding window, optimization

dpgreedysliding windowset
12345