🎓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#p019
1850

Modulo Range Jump Game

Phase 1 / bfs, modulo

bfsarraysmodulojump game
Custom#p018
2150

Balanced Subtree Queries

Phase 1 / tree, dfs, dp

treedpdfssubtree
Custom#p017
1700

Sum of Minimums on Intervals

Phase 1 / monotonic_stack, range

arraysrangemonotonic stackenumeration
Custom#p016
1600

Odd Degree Vertex Removal

Phase 1 / graph, parity, dp

graphdegreeparitydp
Custom#p015
1750

Array Shuffling Inversion Count

Phase 1 / greedy, inversion_count

arraysinversion countgreedypermutation
Custom#p014
1700

Tree Diameter After Edge Addition

Phase 1 / tree, diameter, greedy

treediametergraphgreedy
Custom#p013
1950

Segment Maximum After Reversals

Phase 1 / sliding_window, monotonic_queue, greedy

sliding windowarraysmaximagreedy
Custom#p012
2450

Path Maximum with Shortcuts

Phase 1 / dijkstra, optimization

graphsdijkstrashortest pathoptimization
Custom#p011
1650

Colorful Range Queries

Phase 1 / mo, sqrt_decomp

mo's algorithmrange queryfrequency
Custom#p010
1850

Almost Increasing Sequence Removals

Phase 1 / dp, subsequence

dpgreedysubsequencearrays
Custom#p009
1550

Unique Remainder Subarrays

Phase 1 / sliding_window, hashing

arrayssliding windowmodulohashing
Custom#p008
2300

Kth Smallest in Path

Phase 1 / tree, lca, path_query

treelcapath queryorder statistics
1213141516