🎓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

Problems21

All SourcesLeetCodeCodeforcesBOJCustom
All LevelsEasyMediumHard
array
Custom#cpq008-200
1700

Subarray Unique Element Sum

Phase 2 / sliding-window, inclusion-exclusion

sliding-windowinclusion-exclusionarray
Custom#P015-164
2100

Unique Divisor Path Sum

Phase 5 / prefix_sum/divisor/unique

prefix sumdivisibilityarray
Custom#P014-143
1600

Minimum Cost All-Active Switches

Phase 4 / greedy/flipping/min_cost

greedyflippingarray
Custom#P004-704
1850

Subset XOR Reversal

Phase 5 / greedy/xor/array_manipulation

XORgreedyarray
Custom#cpq016
1750

K-Partition Equal Sums

Phase 6 / prefix-sum/partition

prefix-sumpartitionarray
Custom#cpq014
1400

Minimum Unique Window

Phase 6 / sliding-window/set

sliding-windowuniquesetarray
Custom#cpq010
1400

Interleaved Segment Sums

Phase 6 / prefix-sum/queries

prefix-sumqueriesarray
Custom#cpq006
1400

Sliding Window GCD Coverage

Phase 6 / gcd/sliding-window

gcdsliding-windowarray
Custom#cpq005
1700

Array XOR Equalization

Phase 6 / greedy/xor

xorgreedyarray
Custom#cpq002
1500

Sum-Free Permutation

Phase 6 / greedy/array

greedypartitionarray
Custom#cp016
1500

Minimal Jumps to Reach Zero

Phase 4 / bfs, array, shortest path

bfsarrayshortest path
Custom#cp008
1500

Minimum Total Weight to Balance Array

Phase 4 / greedy, math, optimization

greedyarraymath
12