🎓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#cptp007
2100

Bipartite Path Color Switches

Phase 5 / bfs, multi-state_shortest

bfscoloringgraphqueries
Custom#cptp006
1400

Minimal Cost Array Rotation

Phase 4 / array_rotation, monotonicity

arrayrotationgreedy
Custom#cptp005
2200

Directed Graph Two-Edge Connectivity

Phase 5 / graph_theory, connectivity

graphsconnectivityedge-disjoint pathsstrongly-connected
Custom#cptp004
1600

Increasing Subsequence Partition

Phase 4 / patience_sorting, sequence_decomposition

greedysubsequencepatience-sorting
Custom#cptp003
1500

Bitwise Or Interval Count

Phase 4 / bitmasks, set_maintenance

bitmaskssetsubarrays
Custom#cptp002
1800

Unique Path Pair Query

Phase 4 / tree_queries, mo_on_tree

treesqueriesmo-algorithmoffline
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-019
2450

Subtree Maximum XOR Query

Phase 3 / tree-query

treequeryxoroffline
Custom#cp-tp3-018
2300

Longest Monotone Bitwise Subsequence

Phase 3 / bitwise-lis

arraybitwiseLISdp
Custom#cp-tp3-017
1725

Sumset Subsequence Counting

Phase 3 / subsequence-enumeration

combinatoricsdpsubsequenceset
Custom#cp-tp3-016
2100

Minimal Unique Substring Split

Phase 3 / string-split

stringgreedyhashingsuffix-array
89101112