🎓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

Problems9

All SourcesLeetCodeCodeforcesBOJCustom
All LevelsEasyMediumHard
queries
Custom#cp015-512
2300

Increasing Subarrays with K Changes

Phase 5 / segment tree, binary search

segment treequeriestwo pointers
Custom#cpq015
1700

Tree Path Sum With Multipliers

Phase 6 / tree/path-query

treelcaqueriespath-sum
Custom#cpq012
2000

Weighted Range Median Query

Phase 6 / segment-tree/order-statistics

medianweightedsegment-treequeries
Custom#cpq010
1400

Interleaved Segment Sums

Phase 6 / prefix-sum/queries

prefix-sumqueriesarray
Custom#cptp016
2500

K-th Smallest XOR in Range

Phase 6 / persistent_trie, offline_queries

offlinetriequeriesXOR
Custom#cptp012
1700

Tree Path Divisor Query

Phase 4 / tree_queries, offline_processing

treesqueriesdivisibilityoffline
Custom#cptp011
2200

Range Inversion Query

Phase 5 / mo_algorithm, fenwick

mo-algorithminversionsqueries
Custom#cptp007
2100

Bipartite Path Color Switches

Phase 5 / bfs, multi-state_shortest

bfscoloringgraphqueries
Custom#cptp002
1800

Unique Path Pair Query

Phase 4 / tree_queries, mo_on_tree

treesqueriesmo-algorithmoffline