🎓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-003
1650

Weighted Range Reversal

Phase 3 / array-reversal

arrayprefix-sumreversaloptimization
Custom#cp-tp3-002
1850

Unique Pairwise GCD Path

Phase 3 / tree-gcd

treeGCDpathcounting
Custom#cp-tp3-001
1450

Sequence Parity Partition

Phase 3 / array-partition

greedyprefix-sumparitypartitioning
Custom#P020
1700

Critical Edge Removals for Disconnection

Phase 2 / Graphs, Bridges

graphsbridgescut
Custom#P019
2300

Range GCD Update and Query

Phase 2 / Segment Tree, Lazy Propagation

segment treerange updategcd
Custom#P018
2200

Bitmask Minimal Path

Phase 2 / Graphs, Bitmask Dijkstra

graphsbitmaskdijkstra
Custom#P017
1600

Minimal Cost Full Coverage Intervals

Phase 2 / Greedy, Segment Cover

greedyinterval coverdp
Custom#P016
1800

Longest Path With Type Alternation

Phase 2 / Tree DP

treedppath
Custom#P015
1500

Unordered Pair Palindromic Concatenation

Phase 2 / String, Hashing

stringpalindromehash
Custom#P014
2100

Multiset Range Query with Updates

Phase 2 / Mo's Algorithm, Segment Tree

mo's algorithmrange queryupdates
Custom#P013
2000

Swap to Sort with Constraints

Phase 2 / Graphs, Permutations

graphpermutationswapping
Custom#P012
1900

Subarray Distinct Product Modulo

Phase 2 / Subarray, Hashing, Math

subarraymathhash
1011121314