🎓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#cptp019
2100

Weighted Unique Substring Sum

Phase 5 / suffix_automaton, string_hashing

stringssuffix-automatonhashing
Custom#cptp018
1500

Tournament Swap Sorting

Phase 4 / greedy, inversions

greedypermutationsorting
Custom#cptp017
2200

Range LCM Updates

Phase 5 / segment_tree, lazy_propagation

segment-treegcdlcmrange-updates
Custom#cptp016
2500

K-th Smallest XOR in Range

Phase 6 / persistent_trie, offline_queries

offlinetriequeriesXOR
Custom#cptp015
2100

Minimum Operations to All Primes

Phase 5 / prime_sieve, nearest_prime

primesgreedynumber-theory
Custom#cptp014
2300

Longest Sum-Free Subsequence

Phase 5 / set_theory, greedy

greedysetconstruction
Custom#cptp013
1600

Minimum Swap Parity Sort

Phase 4 / cycle_decomposition, parity_position

permutationgreedycycleimplementation
Custom#cptp012
1700

Tree Path Divisor Query

Phase 4 / tree_queries, offline_processing

treesqueriesdivisibilityoffline
Custom#cptp011
2200

Range Inversion Query

Phase 5 / mo_algorithm, fenwick

mo-algorithminversionsqueries
Custom#cptp010
1400

Cycle Length GCD

Phase 4 / cycle_decomposition, gcd

permutationcyclesgcd
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
7891011