🎓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#cpq015
1700

Tree Path Sum With Multipliers

Phase 6 / tree/path-query

treelcaqueriespath-sum
Custom#cpq014
1400

Minimum Unique Window

Phase 6 / sliding-window/set

sliding-windowuniquesetarray
Custom#cpq013
1550

Graph Degree Parity Transform

Phase 6 / graph/degree-parity

graphparitydegreegreedy
Custom#cpq012
2000

Weighted Range Median Query

Phase 6 / segment-tree/order-statistics

medianweightedsegment-treequeries
Custom#cpq011
1450

K-Color Consecutive Difference

Phase 6 / dp/greedy

greedydpcoloring
Custom#cpq010
1400

Interleaved Segment Sums

Phase 6 / prefix-sum/queries

prefix-sumqueriesarray
Custom#cpq009
2500

Minimal Cost All-Reachability in DAG

Phase 6 / graph/dag/transitive-closure

graphdagminimumreachability
Custom#cpq008
1800

Treewise Bitwise Convolution

Phase 6 / tree/xor

treexorsubtreedfs
Custom#cpq007
1900

Lexicographically Minimal Increasing Subsequences

Phase 6 / greedy/partition

greedypartitionsequencelexicographic
Custom#cpq006
1400

Sliding Window GCD Coverage

Phase 6 / gcd/sliding-window

gcdsliding-windowarray
Custom#cpq005
1700

Array XOR Equalization

Phase 6 / greedy/xor

xorgreedyarray
Custom#cpq004
1700

Edge Weight Matching

Phase 6 / dp/tree

dptreematching
45678