🎓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#cpq010-962
1810

Permutation Cycle Split

Phase 3 / permutation, cycles, greedy

permutationcyclesgreedy
Custom#cpq005-142
1580

Minimal Lexicographic Rotation After Swaps

Phase 2 / greedy, strings

greedystringssorting
Custom#P014-143
1600

Minimum Cost All-Active Switches

Phase 4 / greedy/flipping/min_cost

greedyflippingarray
Custom#P012-991
1500

Minimum Cost Even-Odd Matching

Phase 4 / greedy/matching/abs_sum

greedymatchingsorting
Custom#P011-287
2000

Maximal Sum Partition with Constraints

Phase 5 / binary_search/greedy/partition

binary searchgreedypartition
Custom#P010-912
1500

Fixed-Point Segment Minimization

Phase 4 / greedy/fixed_points/segment_cover

greedyfixed pointssegments
Custom#P008-845
1800

Tree Path Maximum After Pruning

Phase 5 / trees/pruning/path_max

treegreedypruning
Custom#P004-704
1850

Subset XOR Reversal

Phase 5 / greedy/xor/array_manipulation

XORgreedyarray
Custom#cp020-490
2200

Minimal Product Cover

Phase 5 / number theory, primes, greedy

number theorygreedyprimes
Custom#cp017-61
1400

Minimal Segment Tree Value Flip

Phase 5 / greedy, intervals

greedyintervalsbits
Custom#cp013-529
2000

Graph Degree Redistribution

Phase 5 / graphs, degree, greedy

graphsdegreegreedy
Custom#cp012-842
1800

Minimal Unique Subsequence Merge

Phase 5 / strings, greedy, sets

stringsgreedysubsequence
12345