🎓How I Study AIHISA

📖Read

📄Papers 📰Blogs 🎬Courses

💡Learn

🛤️Paths 📚Topics 💡Concepts 🎴Shorts

🎯Practice

⏱️Coach 🧩Problems 🧠Thinking 🎯Prompts 🧠Review

Search Settings

How I Study AI - Learn AI Papers & Lectures the Easy Way

Problems13

All Sources LeetCode Codeforces BOJ Custom

All Levels Easy Medium Hard

offline

Custom#cp019-345

Longest Good Segment After Deletions

Phase 5 / segment tree, offline queries

segment treeofflinerange query

Minimal Range Maximum Query After Deletion

Phase 6 / offline/segment-tree

offlinesegment-treerange-maxdeletion

Component Merge After Edge Deletions

Phase 6 / dsu, offline, reverse delete

dsuofflinereverse delete

K-th Smallest XOR in Range

Phase 6 / persistent_trie, offline_queries

offlinetriequeriesXOR

Tree Path Divisor Query

Phase 4 / tree_queries, offline_processing

treesqueriesdivisibilityoffline

Unique Path Pair Query

Phase 4 / tree_queries, mo_on_tree

treesqueriesmo-algorithmoffline

Custom#cp-tp3-019

Subtree Maximum XOR Query

Phase 3 / tree-query

treequeryxoroffline

Connected Components After Queries

Phase 2 / DSU, Offline Processing

dsuofflinegraphs

Custom#ct-p4-04

Range Majority Candidate

Phase 4 / segment-tree

segment-treeboyer-mooreoffline

Custom#ct-p6-05

Dynamic SCC Longest Condensation Path

Phase 6 / combined-techniques

sccofflinedag-dp

Custom#ct-p6-04

Persistent K-th with Point Updates

Phase 6 / combined-techniques

persistent-segment-treeorder-statisticsoffline

Custom#ct-p4-03

Rollback DSU Interval Connectivity

Phase 4 / dsu-rollback

dsuofflinedivide-and-conquer

1 2