🎓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

Problems200

All SourcesLeetCodeCodeforcesBOJCustom
All LevelsEasyMediumHard
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#P009-722
1400

Array Sequential Product Query

Phase 4 / prefix_products/range_query

prefix productrange query
Custom#P008-845
1800

Tree Path Maximum After Pruning

Phase 5 / trees/pruning/path_max

treegreedypruning
Custom#P007-720
1450

Minimal Prime Gaps

Phase 4 / number_theory/primes/difference

number theoryprimessorting
Custom#P006-366
2100

Graph Path Swap Parity

Phase 5 / graphs/parity/path_reversal

graphbfsparityquery
Custom#P005-451
1400

Nearest Power Multiple

Phase 4 / number_theory/powers_of_two

number theorybit manipulation
Custom#P004-704
1850

Subset XOR Reversal

Phase 5 / greedy/xor/array_manipulation

XORgreedyarray
Custom#P003-195
1550

Range-Query Increasing Triplet Count

Phase 4 / combinatorics/range_query/increasing_triplets

range querytripletscombinatorics
Custom#P002-431
2000

Maximal XOR Connected Subgraph

Phase 5 / graphs/xor/connected_subgraph

XORgraphsubgraph
Custom#P001-121
1450

Constrained Palindromic Split

Phase 4 / palindromes/dp/partition

dynamic programmingpalindromepartition
Custom#cp020-490
2200

Minimal Product Cover

Phase 5 / number theory, primes, greedy

number theorygreedyprimes
12345