🎓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

Problems8

All SourcesLeetCodeCodeforcesBOJCustom
All LevelsEasyMediumHard
sliding window
Custom#cp014
1500

Longest Contiguous Segment with Unique Sums

Phase 4 / prefix sum, set, sliding window

sliding windowprefix sumset
Custom#cp003
1700

Maximum Rectangle with Bounded Zeros

Phase 5 / 2D prefix sums, sliding window

2d prefix sumrectanglesliding window
Custom#cp001
2100

Split Array with Maximum Distincts

Phase 6 / dp, sliding window, optimization

dpgreedysliding windowset
Custom#P001
1400

Sliding Median XOR

Phase 2 / Sliding Window, Order Statistics

sliding windoworder-statisticsxor
Custom#p013
1950

Segment Maximum After Reversals

Phase 1 / sliding_window, monotonic_queue, greedy

sliding windowarraysmaximagreedy
Custom#p009
1550

Unique Remainder Subarrays

Phase 1 / sliding_window, hashing

arrayssliding windowmodulohashing
Custom#p005
1800

Subarray Product with Modulo

Phase 1 / number_theory, sliding_window

number theoryarrayssliding windowmultiplicative
Custom#p002
1400

Bounded Distance Pair Sums

Phase 1 / sliding_window, parity

sliding windowparityarrays