🎓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#cpq003-882
2100

Sum of Distinct Graph Paths

Phase 2 / dag, topological-order, reachability

graphdagquery
Custom#cpq002-877
1700

Lowest Absent Number in Ranges

Phase 1 / mo-algorithm, sqrt-decomposition

mo-algorithmrange-querymex
Custom#cpq001-61
1450

Repeated XOR Path Sum

Phase 1 / prefix-xor, range-query

prefix-xorrange-querydata-structures
Custom#P020-341
2500

Weighted Subset XOR Query

Phase 6 / xor/subset_dp/weighted

xordpsubsetquery
Custom#P019-773
2100

Maximum Segment Set Sum

Phase 5 / dp/set/nonoverlap

dpsetsegments
Custom#P018-829
1500

Balanced Bitwise Segment

Phase 4 / prefix_sum/equality/binary

prefix sumhashingbinary array
Custom#P017-732
1400

Maximum Unique Suffix Array

Phase 4 / hashing/unique/suffix

suffixuniquehashing
Custom#P016-820
1700

K-Radius Tree Value Propagation

Phase 5 / tree/distance/propagation

treebfsdistance
Custom#P015-164
2100

Unique Divisor Path Sum

Phase 5 / prefix_sum/divisor/unique

prefix sumdivisibilityarray
Custom#P014-143
1600

Minimum Cost All-Active Switches

Phase 4 / greedy/flipping/min_cost

greedyflippingarray
Custom#P013-241
2200

K-Longest Paths in Grid

Phase 5 / dp/kth_path/grid

dpkth pathgrid
Custom#P012-991
1500

Minimum Cost Even-Odd Matching

Phase 4 / greedy/matching/abs_sum

greedymatchingsorting
12345