🎓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#cp-tp3-015
1550

Counting Visible Peaks

Phase 3 / array-peaks

arraymonotonic-stackvisibility
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
Custom#cp-tp3-012
2000

Minimal Block Merge Cost

Phase 3 / dp-knuth

dpinterval-dpknuthmerge-cost
Custom#cp-tp3-011
1950

K-Bounded Shortest Cycle

Phase 3 / graph-cycles

graphcycleshortest-pathbounded-search
Custom#cp-tp3-010
2250

Binary Tree Subpath Sum XOR

Phase 3 / tree-dp

treedpxorprefix-sum
Custom#cp-tp3-009
1600

Anti-Palindrome Partition

Phase 3 / string-partition

stringpartitionpalindromegreedy
Custom#cp-tp3-008
1500

Equal Height Pyramid

Phase 3 / greedy-operations

greedyarrayoperations
Custom#cp-tp3-007
2100

Endless Game: Minimum Score to Lose

Phase 3 / game-theory

game-theorybitmasknumber-theory
Custom#cp-tp3-006
1400

Shortest Repeating Subsequence Cover

Phase 3 / string-period

stringperiodicitykmpprefix-function
Custom#cp-tp3-005
1850

Circular Array Maximum Modulo

Phase 3 / circular-partition

arraycircularpartitionbinary-search
Custom#cp-tp3-004
1700

Monochrome Component Removals

Phase 3 / graph-components

graphcomponentscoloringgreedy
910111213