🎓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

Problems15

All SourcesLeetCodeCodeforcesBOJCustom
All LevelsEasyMediumHard
arrays
Custom#cp005-400
1400

Minimal Moves to Palindromic Array

Phase 5 / arrays, greedy, math

arraysgreedypalindrome
Custom#cp003-202
1400

Range Partition with Uniques

Phase 5 / arrays, hashset, greedy

arraysgreedyhashing
Custom#cp001-893
1500

Modulo K Equal Frequency

Phase 5 / arrays, greedy, math

arraysgreedyfrequencymodulo
Custom#cptp020
1500

Longest Subarray with Limited Changes

Phase 4 / sliding_window, frequency_map

sliding-windowarraysfrequency
Custom#cptp009
1500

Minimum Cost Non-Adjacent

Phase 4 / dp, house_robber_variant

dparraysgreedy
Custom#cptp008
1400

Fixed-Length Distinct Subarrays

Phase 4 / sliding_window, hash_map

sliding-windowhashingarrays
Custom#p019
1850

Modulo Range Jump Game

Phase 1 / bfs, modulo

bfsarraysmodulojump game
Custom#p017
1700

Sum of Minimums on Intervals

Phase 1 / monotonic_stack, range

arraysrangemonotonic stackenumeration
Custom#p015
1750

Array Shuffling Inversion Count

Phase 1 / greedy, inversion_count

arraysinversion countgreedypermutation
Custom#p013
1950

Segment Maximum After Reversals

Phase 1 / sliding_window, monotonic_queue, greedy

sliding windowarraysmaximagreedy
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
12