🎓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#cp019-345
2100

Longest Good Segment After Deletions

Phase 5 / segment tree, offline queries

segment treeofflinerange query
Custom#cp018-77
2300

Divisor Sum Path in DAG

Phase 5 / DAG, DP, modular arithmetic

DAGDPmodulo
Custom#cp017-61
1400

Minimal Segment Tree Value Flip

Phase 5 / greedy, intervals

greedyintervalsbits
Custom#cp016-365
2100

Grid Row-Column Swap Sort

Phase 5 / permutations, cycles, grid

permutationgridcycle decomposition
Custom#cp015-512
2300

Increasing Subarrays with K Changes

Phase 5 / segment tree, binary search

segment treequeriestwo pointers
Custom#cp014-180
1800

Range Bitwise Sum Query

Phase 5 / bitwise, prefix sums

bitwiserange queryprefix sums
Custom#cp013-529
2000

Graph Degree Redistribution

Phase 5 / graphs, degree, greedy

graphsdegreegreedy
Custom#cp012-842
1800

Minimal Unique Subsequence Merge

Phase 5 / strings, greedy, sets

stringsgreedysubsequence
Custom#cp011-118
2100

Tree Subset Connectivity

Phase 5 / trees, lca, dfs order

treesconnectivitylca
Custom#cp010-332
2000

Kth Distinct Subarray XOR

Phase 5 / prefix xor, trie, set

prefix xortriesubarray
Custom#cp009-975
1600

Smallest Covering Rectangle After Removal

Phase 5 / geometry, brute-force min-max

geometrybrute-forcesorting
Custom#cp008-700
1500

Minimal Cuts for Equal Segment Sums

Phase 5 / prefix sums, greedy

prefix sumspartitiongreedy
23456