🎓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#cptp018
1500

Tournament Swap Sorting

Phase 4 / greedy, inversions

greedypermutationsorting
Custom#cptp015
2100

Minimum Operations to All Primes

Phase 5 / prime_sieve, nearest_prime

primesgreedynumber-theory
Custom#cptp014
2300

Longest Sum-Free Subsequence

Phase 5 / set_theory, greedy

greedysetconstruction
Custom#cptp013
1600

Minimum Swap Parity Sort

Phase 4 / cycle_decomposition, parity_position

permutationgreedycycleimplementation
Custom#cptp009
1500

Minimum Cost Non-Adjacent

Phase 4 / dp, house_robber_variant

dparraysgreedy
Custom#cptp006
1400

Minimal Cost Array Rotation

Phase 4 / array_rotation, monotonicity

arrayrotationgreedy
Custom#cptp004
1600

Increasing Subsequence Partition

Phase 4 / patience_sorting, sequence_decomposition

greedysubsequencepatience-sorting
Custom#cptp001
1500

Minimum Segment Sum Split

Phase 4 / binary_search_on_answer

arraybinary-searchgreedyprefix-sum
Custom#cp-tp3-020
1775

Lexicographical Array Jump

Phase 3 / array-jump

arrayjumpgreedylex-order
Custom#cp-tp3-016
2100

Minimal Unique Substring Split

Phase 3 / string-split

stringgreedyhashingsuffix-array
Custom#cp-tp3-014
2150

Maximal Pairwise Flow Assignment

Phase 3 / orientation-flow

graphorientationflowgreedy
Custom#cp-tp3-013
1800

Divisible Subset Coverage

Phase 3 / set-cover

divisibilityset-covergreedy
12345