🎓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#p007
1700

Special Palindrome Split

Phase 1 / strings, palindrome, prefix_suffix

stringspalindromesplitmanacher
Custom#p006
1750

Minimal Operations to Make Graph Bipartite

Phase 1 / graph, dfs, coloring

graphbipartitedfscycles
Custom#p005
1800

Subarray Product with Modulo

Phase 1 / number_theory, sliding_window

number theoryarrayssliding windowmultiplicative
Custom#p004
1600

Lexicographically Minimal Path Grid

Phase 1 / dp, lex_order

dpgridstringslexicographical
Custom#p003
1900

Cycle-Finding Graph Labeler

Phase 1 / mst, parity, union_find

graphmstforestunion-find
Custom#p002
1400

Bounded Distance Pair Sums

Phase 1 / sliding_window, parity

sliding windowparityarrays
Custom#p001
1450

Prefix XOR Equalizer

Phase 1 / prefix_xor, greedy

xorprefixgreedyarrays
Custom#ct-p6-06
2420

Hybrid Query Engine

Phase 6 / combined-techniques

heavy-lightsegment-treeeuler-tour
Custom#ct-p5-04
2280

Aliens Trick Budget DP

Phase 5 / advanced-dp

dpparametric-searchoptimization
Custom#ct-p4-04
2080

Range Majority Candidate

Phase 4 / segment-tree

segment-treeboyer-mooreoffline
Custom#ct-p3-04
1880

Two-Layer Topological Scheduling

Phase 3 / graph-shortest-path

topological-sortdpscheduling
Custom#ct-p2-04
1680

Median Feasibility Subarray

Phase 2 / binary-search-answer

binary-searchprefix-summonotonicity
1314151617