Kevin and Nivek

divide and conquer, dp

Kevin and Teams

2-sat, binary search, bitmasks, brute force, chinese remainder theorem, combinatorics, constructive algorithms, data structures, dfs and similar, divide and conquer, dp, dsu, expression parsing, fft, flows, games, geometry, graph matchings, graphs, greedy, hashing, implementation, interactive, math, matrices, meet-in-the-middle, number theory, probabilities, schedules, shortest paths, sortings, string suffix structures, strings, ternary search, trees, two pointers

Kevin and Binary String (Hard Version)

2-sat, binary search, bitmasks, brute force, chinese remainder theorem, combinatorics, constructive algorithms, data structures, dfs and similar, divide and conquer, dp, dsu, expression parsing, fft, flows, games, geometry, graph matchings, graphs, greedy, hashing, implementation, interactive, math, matrices, meet-in-the-middle, number theory, probabilities, schedules, shortest paths, sortings, string suffix structures, strings, ternary search, trees, two pointers

Kevin and Binary String (Easy Version)

binary search, bitmasks, brute force, chinese remainder theorem, combinatorics, constructive algorithms, data structures, dfs and similar, divide and conquer, dp, dsu, expression parsing, fft, flows, games, geometry, graph matchings, graphs, greedy, hashing, implementation, interactive, math, matrices, meet-in-the-middle, number theory, probabilities, schedules, shortest paths, sortings, string suffix structures, strings, ternary search, trees, two pointers

Kevin and And

binary search, bitmasks, dfs and similar, divide and conquer, dp, dsu, expression parsing, fft, flows, games, geometry, graph matchings, graphs, greedy, hashing, implementation, interactive, math, matrices, meet-in-the-middle, number theory, probabilities, schedules, shortest paths, sortings, string suffix structures, strings, ternary search, trees, two pointers

Kevin and Numbers

2-sat, binary search, bitmasks, brute force, chinese remainder theorem, combinatorics, constructive algorithms, data structures, dfs and similar, divide and conquer, dp, dsu, expression parsing, fft, flows, games, geometry, graph matchings, graphs, greedy, hashing, implementation, interactive, math, matrices, meet-in-the-middle, number theory, probabilities, schedules, shortest paths, sortings, string suffix structures, strings, ternary search, trees, two pointers

Kevin and Puzzle

2-sat, binary search, bitmasks, brute force, chinese remainder theorem, combinatorics, constructive algorithms, data structures, dfs and similar, divide and conquer, dp, dsu, expression parsing, fft, flows, games, geometry, graph matchings, graphs, greedy, hashing, implementation, interactive, math, matrices, meet-in-the-middle, number theory, probabilities, schedules, shortest paths, sortings, string suffix structures, strings, ternary search, trees, two pointers

Kevin and Geometry

2-sat, binary search, bitmasks, brute force, chinese remainder theorem, combinatorics, constructive algorithms, data structures, dfs and similar, divide and conquer, dp, dsu, expression parsing, fft, flows, games, geometry, graph matchings, graphs, greedy, hashing, implementation, interactive, math, matrices, meet-in-the-middle, number theory, probabilities, schedules, shortest paths, sortings, string suffix structures, strings, ternary search, trees, two pointers

Kevin and Arithmetic

2-sat, binary search, bitmasks, brute force, chinese remainder theorem, combinatorics, constructive algorithms, data structures, dfs and similar, divide and conquer, dp, dsu, expression parsing, fft, flows, games, geometry, graph matchings, graphs, greedy, hashing, implementation, interactive, math, matrices, meet-in-the-middle, number theory, probabilities, schedules, shortest paths, sortings, string suffix structures, strings, ternary search, trees, two pointers

Unique Median

binary search, brute force, combinatorics, data structures, divide and conquer, dp

Bewitching Stargazer

bitmasks, divide and conquer, dp, math

Maximum modulo equality

data structures, divide and conquer, math, number theory

Kevin and Math Class

brute force, data structures, divide and conquer, dp, implementation, math, trees

Vertex Pairs

binary search, brute force, data structures, dfs and similar, divide and conquer, greedy, implementation, trees

Bottle Arrangement

data structures, divide and conquer, dp, dsu, greedy

Library of Magic

binary search, constructive algorithms, divide and conquer, interactive, math, number theory

Go Learn! (Hard Version)

divide and conquer, dp

Yet Another Real Number Problem

binary search, data structures, divide and conquer, greedy, implementation, math

Bermart Ice Cream

data structures, dfs and similar, divide and conquer, dp, implementation, trees

Complex Segments (Hard Version)

binary search, data structures, divide and conquer, dsu, greedy, math, sortings

Complex Segments (Easy Version)

binary search, data structures, divide and conquer, dsu, greedy, math, sortings

Robin Hood Archery

data structures, divide and conquer, greedy, hashing

Stack and Queue

*special problem, data structures, divide and conquer

Eri and Expanded Sets

data structures, divide and conquer, math, number theory, two pointers

Alter the GCD

binary search, brute force, data structures, divide and conquer, implementation, number theory

Turtle and Inversions (Hard Version)

brute force, data structures, divide and conquer, dp, greedy, math, two pointers

Turtle and Inversions (Easy Version)

brute force, divide and conquer, dp, greedy, math

Guess The Tree

binary search, brute force, dfs and similar, divide and conquer, dsu, greedy, interactive, trees

Eliminating Balls With Merging (Hard Version)

binary search, brute force, data structures, divide and conquer, greedy, implementation

Eliminating Balls With Merging (Easy Version)

binary search, brute force, data structures, divide and conquer, greedy

Level Up

binary search, brute force, data structures, divide and conquer, implementation

Polygonal Segments

brute force, data structures, divide and conquer, dp, greedy, two pointers

Catch the Mole(Hard Version)

binary search, data structures, dfs and similar, divide and conquer, interactive, trees

Simultaneous Coloring

dfs and similar, divide and conquer, graphs

Range Minimum Sum

binary search, brute force, data structures, divide and conquer, implementation

Spinning Round (Hard Version)

divide and conquer, dp, trees

Spinning Round (Easy Version)

divide and conquer, dp, trees

Swap Dilemma

constructive algorithms, data structures, divide and conquer, greedy, math, sortings

Number of k-good subarrays

bitmasks, brute force, combinatorics, divide and conquer, dp, math, meet-in-the-middle

Invertible Bracket Sequences

binary search, combinatorics, data structures, divide and conquer, implementation, two pointers

Set

bitmasks, brute force, combinatorics, dfs and similar, divide and conquer, dp, math

Unique Array

binary search, data structures, divide and conquer, dp, greedy

Frequency Mismatch (Easy Version)

binary search, data structures, divide and conquer, hashing, probabilities, trees

Nene and the Mex Operator

bitmasks, brute force, constructive algorithms, divide and conquer, dp, greedy, implementation, math

No Palindromes

brute force, constructive algorithms, divide and conquer, greedy, hashing, implementation, math, strings

Burenka and Pether

*special problem, data structures, dfs and similar, divide and conquer, dsu, graphs, sortings, trees

Yet Yet Another Permutation Problem

divide and conquer, fft, math

Sum over all Substrings (Hard Version)

bitmasks, divide and conquer, dp, dsu, greedy, implementation, strings

Increasing Subsequences

bitmasks, constructive algorithms, divide and conquer, greedy, math

Mischievous Shooter

brute force, data structures, divide and conquer, dp, implementation

Tree LGM

constructive algorithms, divide and conquer, games, trees

ace5 and Task Order

constructive algorithms, divide and conquer, implementation, interactive, probabilities, sortings

Optimizations From Chelsu

divide and conquer, dp, number theory, trees

Greetings

data structures, divide and conquer, sortings

Array Collapse

data structures, divide and conquer, dp, trees

Blueprint for Seating

combinatorics, divide and conquer, math

Deck-Building Game

divide and conquer, math

Field Should Not Be Empty

brute force, data structures, divide and conquer

Set To Max (Hard Version)

constructive algorithms, data structures, divide and conquer, greedy, implementation, sortings

Maximum And Queries (hard version)

bitmasks, divide and conquer, dp, greedy

Trees and XOR Queries Again

data structures, dfs and similar, divide and conquer, graphs, implementation, math, trees

Vova Escapes the Matrix

brute force, dfs and similar, divide and conquer, shortest paths

Cyclic Hamming (Easy Version)

brute force, divide and conquer, dp, fft, math, number theory

Ones and Twos

binary search, data structures, divide and conquer, math, two pointers

Split

binary search, data structures, divide and conquer, dsu, math, trees, two pointers

Sum of XOR Functions

bitmasks, combinatorics, divide and conquer, dp, math

Jellyfish and Miku

divide and conquer, dp, math, probabilities

Teleportation in Byteland

data structures, dfs and similar, divide and conquer, graphs, shortest paths, trees

Counting Graphs

combinatorics, divide and conquer, dsu, graphs, greedy, sortings, trees

More Wrong

divide and conquer, interactive

XOR Partition

binary search, bitmasks, data structures, divide and conquer, greedy, trees

Max to the Right of Min

binary search, data structures, divide and conquer, dp, dsu, two pointers

Vika and Wiki

binary search, bitmasks, combinatorics, divide and conquer, dp, math

Omsk Metro (hard version)

data structures, dfs and similar, divide and conquer, dp, math, trees

Tenzing and Necklace

divide and conquer, dp, greedy

Half-sum

brute force, divide and conquer, greedy

Communication Towers

brute force, divide and conquer, dsu

Minibuses on Venus (medium version)

combinatorics, divide and conquer, dp, matrices

Minibuses on Venus (easy version)

combinatorics, divide and conquer, dp

Approximate Diameter

binary search, divide and conquer, graphs, shortest paths

Gasoline prices

data structures, divide and conquer, dsu, hashing, trees

Li Hua and Path

data structures, dfs and similar, divide and conquer, dsu, trees

Counting Factorizations

combinatorics, divide and conquer, dp, math, number theory

Rebrending

brute force, data structures, divide and conquer, implementation

Graph Coloring (hard version)

brute force, combinatorics, divide and conquer, dp, fft, graphs

Timofey and Black-White Tree

brute force, dfs and similar, divide and conquer, graphs, greedy, math, shortest paths, trees

Treasure Hunt

data structures, divide and conquer, two pointers

Weighed Tree Radius

data structures, divide and conquer, implementation, trees

Comfortably Numb

bitmasks, data structures, divide and conquer, strings, trees

BinCoin

binary search, divide and conquer, hashing, implementation, probabilities, trees

Koxia and Bracket

divide and conquer, fft, math

Decomposition

binary search, brute force, data structures, divide and conquer, dp, two pointers

Bracket Cost

binary search, data structures, divide and conquer, dp, greedy, strings

Yet Another Array Counting Problem

binary search, data structures, divide and conquer, dp, flows, math, trees

Masha and a Beautiful Tree

dfs and similar, divide and conquer, graphs, sortings, trees

Arranging Crystal Balls

data structures, divide and conquer, divide and conquer, dp, geometry, graphs, number theory

Zeros and Ones

bitmasks, divide and conquer, dp, math

Maximums and Minimums

combinatorics, data structures, divide and conquer, number theory

Maximum AND

bitmasks, dfs and similar, divide and conquer, greedy, sortings

Swap and Maximum Block

bitmasks, data structures, dfs and similar, divide and conquer, dp