🎓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#cpq003
1800

Distinct K-Difference Substrings

Phase 6 / string/hash

stringhashsubstringset
Custom#cpq002
1500

Sum-Free Permutation

Phase 6 / greedy/array

greedypartitionarray
Custom#cpq001
1400

Grid Teleportation Path

Phase 6 / graph/grid/shortest-path

graphsbfsgridssimulation
Custom#cp020
1700

Minimum Cost to Recolor Grid

Phase 5 / dp, coloring, min cost

dpcoloringgrid
Custom#cp019
1500

Subset Sum Parity Count

Phase 4 / dp, parity, combinatorics

dpcombinatoricsparity
Custom#cp018
2100

Colorful Path Queries

Phase 6 / tree, lca, path, color counting

treelcacoloroffline query
Custom#cp017
1700

Minimum Lexicographic Merge

Phase 5 / heap, lex order, merge

heapmergelexicographic
Custom#cp016
1500

Minimal Jumps to Reach Zero

Phase 4 / bfs, array, shortest path

bfsarrayshortest path
Custom#cp015
2100

Weighted Tree Diameter with Forbidden Vertices

Phase 6 / tree, dfs, component, diameter

treediameterdfscomponent
Custom#cp014
1500

Longest Contiguous Segment with Unique Sums

Phase 4 / prefix sum, set, sliding window

sliding windowprefix sumset
Custom#cp013
2000

Component Merge After Edge Deletions

Phase 6 / dsu, offline, reverse delete

dsuofflinereverse delete
Custom#cp012
1700

K-Divisible Subset Partition

Phase 5 / modulo, dp, multiset

dpgreedypartitionmodulo
56789