🎓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#cp007-705
1900

Balanced Circular Subarray

Phase 5 / prefix sums, modular arithmetic

prefix sumscircular arraymodular
Custom#cp006-60
1600

Unique Path Lengths in Grid

Phase 5 / dp, path counting

dpgridpath counting
Custom#cp005-400
1400

Minimal Moves to Palindromic Array

Phase 5 / arrays, greedy, math

arraysgreedypalindrome
Custom#cp004-347
1800

Tree Path K-Split Sums

Phase 5 / trees, dfs, prefix sums

treesdfspath queries
Custom#cp003-202
1400

Range Partition with Uniques

Phase 5 / arrays, hashset, greedy

arraysgreedyhashing
Custom#cp002-157
2100

Graph Reversal Path Cost

Phase 5 / graphs, shortest paths

graphsdijkstrareverse edge
Custom#cp001-893
1500

Modulo K Equal Frequency

Phase 5 / arrays, greedy, math

arraysgreedyfrequencymodulo
Custom#cpq020
2100

Minimal Range Maximum Query After Deletion

Phase 6 / offline/segment-tree

offlinesegment-treerange-maxdeletion
Custom#cpq019
1500

Colorful Connected Components

Phase 6 / dsu/components

graphdsuconnected-componentscolors
Custom#cpq018
1800

Circular Bitwise AND Range

Phase 6 / bitwise/sliding-window

bitwisesliding-windowcircular-array
Custom#cpq017
1550

Rooted Subtree Maximum Path

Phase 6 / tree/dp

treedpmax-path
Custom#cpq016
1750

K-Partition Equal Sums

Phase 6 / prefix-sum/partition

prefix-sumpartitionarray
34567