negative listlengths 3 3 | positive dict | reference dict |
|---|---|---|
[
{
"prob_id": "tree and constraints152",
"tags": [
"Principle of Inclusion-Exclusion|Counting|Intermediate"
]
},
{
"prob_id": "islands war103",
"tags": [
"Greedy Stays Ahead|Greedy|Basics"
]
},
{
"prob_id": "one-stroke path054",
"tags": [
"All-Permutations|Co... | {
"prob_id": "329b",
"tags": [
"Grid Graphs|Graphs|Basics"
]
} | {
"prob_id": "maze master151",
"tags": [
"Grid Graphs|Graphs|Basics"
]
} |
[
{
"prob_id": "735e",
"tags": [
"DP on Trees and DAGs|Dp on Different Structures|Dynamic Programming (DP)"
]
},
{
"prob_id": "739e",
"tags": [
"Aliens Trick / WQS Binary Search|DP Optimizations|Dynamic Programming (DP)"
]
},
{
"prob_id": "57c",
"tags": [
"Per... | {
"prob_id": "must be rectangular!131",
"tags": [
"Bipartite Graph||"
]
} | {
"prob_id": "741c",
"tags": [
"Bipartite Graph||"
]
} |
[
{
"prob_id": "847b",
"tags": [
"Binary Search|Leveraging Monotonicity|Basics"
]
},
{
"prob_id": "577b",
"tags": [
"Counting with DP||Intermediate"
]
},
{
"prob_id": "576a",
"tags": [
"Prime Factorization|Number Theory|Basics"
]
}
] | {
"prob_id": "75e",
"tags": [
"Vectors and Applications|Geometry|Basics"
]
} | {
"prob_id": "598c",
"tags": [
"Vectors and Applications|Geometry|Basics"
]
} |
[
{
"prob_id": "601e",
"tags": [
"Dynamic Connectivity Problem (Offline)|Dynamic Connectivity|Data Structures (DS)",
"Offline Deletion||"
]
},
{
"prob_id": "505d",
"tags": [
"Strongly Connected Components (SCC)|Graph Connectivity|Graph Theory"
]
},
{
"prob_id": "7... | {
"prob_id": ": (colon)168",
"tags": [
"Vectors and Applications|Geometry|Basics"
]
} | {
"prob_id": "850a",
"tags": [
"Vectors and Applications|Geometry|Basics"
]
} |
[
{
"prob_id": "721c",
"tags": [
"Directed Acyclic Graphs|Shortest Paths|Intermediate",
"Rotate the Recurrence|DP Optimization|Advanced Algorithms"
]
},
{
"prob_id": "463d",
"tags": [
"Longest Common Subsequence (LCS)|Longest Common Subsequence (LCS)|Strings"
]
},
{
... | {
"prob_id": ": (colon)168",
"tags": [
"Vectors and Applications|Geometry|Basics"
]
} | {
"prob_id": "32e",
"tags": [
"Vectors and Applications|Geometry|Basics"
]
} |
[
{
"prob_id": "megalomania131",
"tags": [
"Exchange Argument|Greedy|Basics"
]
},
{
"prob_id": "even relation126",
"tags": [
"Trees and Tree Traversals|Graphs|Basics"
]
},
{
"prob_id": "11066",
"tags": [
"Binomial Coefficients|Fundamentals|Combinatorics"
]... | {
"prob_id": "32e",
"tags": [
"Vectors and Applications|Geometry|Basics"
]
} | {
"prob_id": "engines139",
"tags": [
"Vectors and Applications|Geometry|Basics"
]
} |
[
{
"prob_id": "241c",
"tags": [
"Reflections on a Rectangle|Miscellaneous|Geometry"
]
},
{
"prob_id": "76a",
"tags": [
"Minimum Spanning Tree||"
]
},
{
"prob_id": "679e",
"tags": [
"Segment Tree Beats|Segment Tree|Data Structures (DS)"
]
}
] | {
"prob_id": "league139",
"tags": [
"Directed Acyclic Graphs|Shortest Paths|Intermediate"
]
} | {
"prob_id": "30c",
"tags": [
"Directed Acyclic Graphs|Shortest Paths|Intermediate"
]
} |
[
{
"prob_id": "727d",
"tags": [
"Bipartite Matching|Network Flows|Advanced Algorithms"
]
},
{
"prob_id": "191a",
"tags": [
"Flatten the Memo|DP Optimization|Advanced Algorithms"
]
},
{
"prob_id": "559d",
"tags": [
"Pick's Theorem|Geometry|Advanced Mathematics... | {
"prob_id": "wall079",
"tags": [
"All-Pairs|Shortest Paths|Intermediate"
]
} | {
"prob_id": "25c",
"tags": [
"All-Pairs|Shortest Paths|Intermediate"
]
} |
[
{
"prob_id": "an ordinary game048",
"tags": [
"Winning and Losing Positions, Strategy Stealing|Combinatorial Games|Advanced Algorithms"
]
},
{
"prob_id": "five dishes123",
"tags": [
"All-Permutations|Complete Search|Basics"
]
},
{
"prob_id": "summer vacation137",
... | {
"prob_id": "1204c",
"tags": [
"All-Pairs|Shortest Paths|Intermediate"
]
} | {
"prob_id": "travel by car143",
"tags": [
"All-Pairs|Shortest Paths|Intermediate"
]
} |
[
{
"prob_id": "778a",
"tags": [
"Binary Search|Leveraging Monotonicity|Basics"
]
},
{
"prob_id": "343e",
"tags": [
"Gomory-Hu Tree|Flow and Min Cut|Graph Theory"
]
},
{
"prob_id": "727e",
"tags": [
"String Hashing|Hashing|Strings"
]
}
] | {
"prob_id": "match matching118",
"tags": [
"DP with Solution Construction||Intermediate"
]
} | {
"prob_id": "31e",
"tags": [
"DP with Solution Construction||Intermediate"
]
} |
[
{
"prob_id": "877d",
"tags": [
"Grid Graphs|Graphs|Basics"
]
},
{
"prob_id": "1312f",
"tags": [
"Nim, Sprague-Grundy Theorem|Combinatorial Games|Advanced Mathematics"
]
},
{
"prob_id": "1385e",
"tags": [
"Topological Sorting|Graph Traversal|Graph Theory"
... | {
"prob_id": "grouping067",
"tags": [
"Harmonic Lemma||Intermediate"
]
} | {
"prob_id": "990e",
"tags": [
"Harmonic Lemma||Intermediate"
]
} |
[
{
"prob_id": "577e",
"tags": [
"Mo's Algorithm|Square Root Decomposition|Data Structures (DS)"
]
},
{
"prob_id": "1179c",
"tags": [
"Segment Tree|Trees|Data Structures"
]
},
{
"prob_id": "727e",
"tags": [
"String Hashing|Hashing|Strings"
]
}
] | {
"prob_id": "mole and abandoned mine078",
"tags": [
"DP on Subsets||Intermediate"
]
} | {
"prob_id": "580d",
"tags": [
"DP on Subsets||Intermediate"
]
} |
[
{
"prob_id": "873d",
"tags": [
"Divide and Conquer DP|DP optimizations|Dynamic Programming"
]
},
{
"prob_id": "167e",
"tags": [
"Determinant of a Matrix|Linear Algebra|Math"
]
},
{
"prob_id": "439d",
"tags": [
"Ternary Search|Search Techniques|Miscellaneous"... | {
"prob_id": "11d",
"tags": [
"DP on Subsets||Intermediate"
]
} | {
"prob_id": "678e",
"tags": [
"DP on Subsets||Intermediate"
]
} |
[
{
"prob_id": "1476a",
"tags": [
"Basic Constructive Algorithms|Greedy and Constructive|Basics"
]
},
{
"prob_id": "1288f",
"tags": [
"L-R Flow|Flow and Min Cut|Graph Theory",
"Min Cost Max Flow (MCMF)|Flow and Min Cut|Graph Theory"
]
},
{
"prob_id": "702f",
"... | {
"prob_id": "11d",
"tags": [
"DP on Subsets||Intermediate"
]
} | {
"prob_id": "543c",
"tags": [
"DP on Subsets||Intermediate"
]
} |
[
{
"prob_id": "235c",
"tags": [
"String Suffix||",
"Suffix Automaton|Suffix Structures|Strings"
]
},
{
"prob_id": "862b",
"tags": [
"Bipartite Graph||",
"Graph Traversal||"
]
},
{
"prob_id": "852f",
"tags": [
"Multiplicative Order and Carmichael's... | {
"prob_id": "558e",
"tags": [
"Segment Tree with Lazy Propagation|Segment Tree|Data Structures (DS)"
]
} | {
"prob_id": "52c",
"tags": [
"Segment Tree with Lazy Propagation|Segment Tree|Data Structures (DS)"
]
} |
[
{
"prob_id": "906d",
"tags": [
"Divisibility||"
]
},
{
"prob_id": "1073g",
"tags": [
"String Suffix||",
"Suffix Automaton|Suffix Structures|Strings"
]
},
{
"prob_id": "1037h",
"tags": [
"String Suffix||",
"Suffix Array|Suffix Structures|Strings"
... | {
"prob_id": "1263e",
"tags": [
"Segment Tree with Lazy Propagation|Segment Tree|Data Structures (DS)"
]
} | {
"prob_id": "558e",
"tags": [
"Segment Tree with Lazy Propagation|Segment Tree|Data Structures (DS)"
]
} |
[
{
"prob_id": "277a",
"tags": [
"Bipartite Graph||"
]
},
{
"prob_id": "911g",
"tags": [
"Pragmas|Miscellaneous|Miscellaneous",
"Splay Trees and Treaps|Augmenting Data Structures|Advanced Data Structures"
]
},
{
"prob_id": "612c",
"tags": [
"Balanced Bra... | {
"prob_id": "1263e",
"tags": [
"Segment Tree with Lazy Propagation|Segment Tree|Data Structures (DS)"
]
} | {
"prob_id": "446c",
"tags": [
"Segment Tree with Lazy Propagation|Segment Tree|Data Structures (DS)"
]
} |
[
{
"prob_id": "1398g",
"tags": [
"Fast Fourier Transform (FFT)|Convolution|Math"
]
},
{
"prob_id": "911g",
"tags": [
"Pragmas|Miscellaneous|Miscellaneous",
"Splay Trees and Treaps|Augmenting Data Structures|Advanced Data Structures"
]
},
{
"prob_id": "1603f",
... | {
"prob_id": "1263e",
"tags": [
"Segment Tree with Lazy Propagation|Segment Tree|Data Structures (DS)"
]
} | {
"prob_id": "817f",
"tags": [
"Segment Tree with Lazy Propagation|Segment Tree|Data Structures (DS)"
]
} |
[
{
"prob_id": "576a",
"tags": [
"Prime Factorization|Number Theory|Basics"
]
},
{
"prob_id": "526g",
"tags": [
"Long Path Decomposition|Long Path Decomposition|Data Structures (DS)"
]
},
{
"prob_id": "1381a2",
"tags": [
"Basic Constructive Algorithms|Greedy a... | {
"prob_id": "1263e",
"tags": [
"Segment Tree with Lazy Propagation|Segment Tree|Data Structures (DS)"
]
} | {
"prob_id": "580e",
"tags": [
"Segment Tree with Lazy Propagation|Segment Tree|Data Structures (DS)"
]
} |
[
{
"prob_id": "121a",
"tags": [
"All-Subsets / Binary Choice|Complete Search|Basics"
]
},
{
"prob_id": "1218i",
"tags": [
"2-SAT|DFS Lowlink|Advanced Algorithms"
]
},
{
"prob_id": "954i",
"tags": [
"Fast Fourier Transform (FFT)|Convolution|Math",
"Strin... | {
"prob_id": "1555e",
"tags": [
"Segment Tree with Lazy Propagation|Segment Tree|Data Structures (DS)"
]
} | {
"prob_id": "145e",
"tags": [
"Segment Tree with Lazy Propagation|Segment Tree|Data Structures (DS)"
]
} |
[
{
"prob_id": "920g",
"tags": [
"Mobius Function and Mobius Inversion|Multiplicative Functions|Number Theory"
]
},
{
"prob_id": "1392i",
"tags": [
"Euler's Formula||",
"Fast Fourier Transform (FFT)|Convolution|Math"
]
},
{
"prob_id": "1153c",
"tags": [
... | {
"prob_id": "47e",
"tags": [
"Amortized Analysis||Intermediate"
]
} | {
"prob_id": "1100b",
"tags": [
"Amortized Analysis||Intermediate"
]
} |
[
{
"prob_id": "295b",
"tags": [
"All-Pairs|Shortest Paths|Intermediate"
]
},
{
"prob_id": "61e",
"tags": [
"Order Statistics||Intermediate"
]
},
{
"prob_id": "643c",
"tags": [
"Convex Hull Trick|DP Optimization|Advanced Algorithms",
"Divide and Conquer ... | {
"prob_id": "i hate shortest path problem177",
"tags": [
"Amortized Analysis||Intermediate"
]
} | {
"prob_id": "609f",
"tags": [
"Amortized Analysis||Intermediate"
]
} |
[
{
"prob_id": "1365d",
"tags": [
"Flood Fill||"
]
},
{
"prob_id": "827e",
"tags": [
"Fast Fourier Transform (FFT)|Convolution|Math",
"String Matching with FFT ft Wildcard Matching|String Matching|Strings"
]
},
{
"prob_id": "114b",
"tags": [
"All-Subsets... | {
"prob_id": "small products132",
"tags": [
"Square-Root Discrimination||Intermediate"
]
} | {
"prob_id": "1263c",
"tags": [
"Square-Root Discrimination||Intermediate"
]
} |
[
{
"prob_id": "603e",
"tags": [
"Link Cut Tree (LCT)|Link Cut Tree (LCT)|Data Structures (DS)"
]
},
{
"prob_id": "95e",
"tags": [
"Knapsack DP||"
]
},
{
"prob_id": "932g",
"tags": [
"Palindromic Tree|Palindromes|Strings",
"String Suffix||"
]
}
] | {
"prob_id": "679c",
"tags": [
"Sliding Window|Data Structure Techniques|Intermediate"
]
} | {
"prob_id": "808b",
"tags": [
"Sliding Window|Data Structure Techniques|Intermediate"
]
} |
[
{
"prob_id": "932g",
"tags": [
"Palindromic Tree|Palindromes|Strings",
"String Suffix||"
]
},
{
"prob_id": "300c",
"tags": [
"Binomial Coefficients|Fundamentals|Combinatorics"
]
},
{
"prob_id": "895e",
"tags": [
"Segment Tree with Lazy Propagation|Segm... | {
"prob_id": "dice in line154",
"tags": [
"Sliding Window|Data Structure Techniques|Intermediate"
]
} | {
"prob_id": "898d",
"tags": [
"Sliding Window|Data Structure Techniques|Intermediate"
]
} |
[
{
"prob_id": "1143f",
"tags": [
"Convex Hull Trick|DP Optimization|Advanced Algorithms"
]
},
{
"prob_id": "975d",
"tags": [
"Vectors and Applications|Geometry|Basics"
]
},
{
"prob_id": "1383f",
"tags": [
"Maximum Flow / Minimum Cut|Flow and Min Cut|Graph The... | {
"prob_id": "361b",
"tags": [
"Relatively Prime, Euler Totient Function|Number Theory|Intermediate"
]
} | {
"prob_id": "1009d",
"tags": [
"Relatively Prime, Euler Totient Function|Number Theory|Intermediate"
]
} |
[
{
"prob_id": "318a",
"tags": [
"Sums and Asymptotics||Preliminaries"
]
},
{
"prob_id": "616c",
"tags": [
"Grid Graphs|Graphs|Basics"
]
},
{
"prob_id": "18c",
"tags": [
"Prefix Sums and Difference Arrays|Range Queries|Basics"
]
}
] | {
"prob_id": "factorization110",
"tags": [
"Permutations with Repetition, Stars and Bars|Counting|Intermediate"
]
} | {
"prob_id": "617b",
"tags": [
"Permutations with Repetition, Stars and Bars|Counting|Intermediate"
]
} |
[
{
"prob_id": "exhausted?076",
"tags": [
"Bipartite Matching|Network Flows|Advanced Algorithms"
]
},
{
"prob_id": "sandglass082",
"tags": [
"Global Deltaing||Advanced Data Structures"
]
},
{
"prob_id": "travel by car143",
"tags": [
"All-Pairs|Shortest Paths|I... | {
"prob_id": "617b",
"tags": [
"Permutations with Repetition, Stars and Bars|Counting|Intermediate"
]
} | {
"prob_id": "roaming156",
"tags": [
"Permutations with Repetition, Stars and Bars|Counting|Intermediate"
]
} |
[
{
"prob_id": "joisino's travel073",
"tags": [
"All-Pairs|Shortest Paths|Intermediate",
"All-Permutations|Complete Search|Basics"
]
},
{
"prob_id": "enclose all151",
"tags": [
"Intersections and Containment|Geometry|Intermediate"
]
},
{
"prob_id": "mul085",
"... | {
"prob_id": "839d",
"tags": [
"Principle of Inclusion-Exclusion|Counting|Intermediate"
]
} | {
"prob_id": "ubiquity178",
"tags": [
"Principle of Inclusion-Exclusion|Counting|Intermediate"
]
} |
[
{
"prob_id": "431b",
"tags": [
"All-Permutations|Complete Search|Basics"
]
},
{
"prob_id": "362e",
"tags": [
"Bipartite Matching|Network Flows|Advanced Algorithms"
]
},
{
"prob_id": "61d",
"tags": [
"Trees and Tree Traversals|Graphs|Basics"
]
}
] | {
"prob_id": "we like agc122",
"tags": [
"Counting with DP||Intermediate"
]
} | {
"prob_id": "414b",
"tags": [
"Counting with DP||Intermediate"
]
} |
[
{
"prob_id": "362e",
"tags": [
"Bipartite Matching|Network Flows|Advanced Algorithms"
]
},
{
"prob_id": "633a",
"tags": [
"Linear Diophantine Equations|Fundamentals|Algebra"
]
},
{
"prob_id": "26a",
"tags": [
"Sieve of Eratosthenes|Prime numbers|Algebra"
... | {
"prob_id": "9d",
"tags": [
"Counting with DP||Intermediate"
]
} | {
"prob_id": "118d",
"tags": [
"Counting with DP||Intermediate"
]
} |
[
{
"prob_id": "776b",
"tags": [
"Prime and Composite, Primality Testing, Prime Sieves, Finding Divisors|Number Theory|Preliminaries"
]
},
{
"prob_id": "21d",
"tags": [
"Floyd Warshall|Shortest Paths|Graph Theory"
]
},
{
"prob_id": "55e",
"tags": [
"Point in C... | {
"prob_id": "9d",
"tags": [
"Counting with DP||Intermediate"
]
} | {
"prob_id": "149d",
"tags": [
"Counting with DP||Intermediate"
]
} |
[
{
"prob_id": "530g",
"tags": [
"Edit Distance|Classic DP|Dynamic Programming (DP)"
]
},
{
"prob_id": "825e",
"tags": [
"Topological Sorting|Graph Traversal|Graph Theory"
]
},
{
"prob_id": "114b",
"tags": [
"All-Subsets / Binary Choice|Complete Search|Basics"... | {
"prob_id": "1245e",
"tags": [
"Markov Chains|Probability and Expectation|Intermediate"
]
} | {
"prob_id": "518d",
"tags": [
"Markov Chains|Probability and Expectation|Intermediate"
]
} |
[
{
"prob_id": "1427g",
"tags": [
"Min Cost Max Flow (MCMF)|Flow and Min Cut|Graph Theory"
]
},
{
"prob_id": "961e",
"tags": [
"BIT / Fenwick Tree|Binary Indexed Tree (BIT)|Data Structures (DS)"
]
},
{
"prob_id": "1365d",
"tags": [
"Flood Fill||"
]
}
] | {
"prob_id": "623d",
"tags": [
"Probabilities and Expected Values|Probabilities and Expected Values|Math"
]
} | {
"prob_id": "906b",
"tags": [
"Probabilities and Expected Values|Probabilities and Expected Values|Math"
]
} |
[
{
"prob_id": "893f",
"tags": [
"Tree Flattening||Advanced Data Structures"
]
},
{
"prob_id": "724c",
"tags": [
"Reflections on a Rectangle|Miscellaneous|Geometry"
]
},
{
"prob_id": "600f",
"tags": [
"Bipartite Matching|Network Flows|Advanced Algorithms"
... | {
"prob_id": "113d",
"tags": [
"Probabilities and Expected Values|Probabilities and Expected Values|Math"
]
} | {
"prob_id": "1096f",
"tags": [
"Probabilities and Expected Values|Probabilities and Expected Values|Math"
]
} |
[
{
"prob_id": "1011e",
"tags": [
"Bezout's Identity|Euclidean Algorithm|Number Theory"
]
},
{
"prob_id": "873f",
"tags": [
"Suffix Array|Suffix Structures|Strings"
]
},
{
"prob_id": "1105e",
"tags": [
"Meet in the Middle|Techniques|Miscellaneous"
]
}
] | {
"prob_id": "843b",
"tags": [
"Probabilities and Expected Values|Probabilities and Expected Values|Math"
]
} | {
"prob_id": "26d",
"tags": [
"Probabilities and Expected Values|Probabilities and Expected Values|Math"
]
} |
[
{
"prob_id": "path pass i163",
"tags": [
"DP on Trees and DAGs|Dp on Different Structures|Dynamic Programming (DP)"
]
},
{
"prob_id": "modularness156",
"tags": [
"Divisibility, Modular Arithmetic|Number Theory|Basics"
]
},
{
"prob_id": "payment155",
"tags": [
... | {
"prob_id": "61e",
"tags": [
"Order Statistics||Intermediate"
]
} | {
"prob_id": "sorted and sorted097",
"tags": [
"Order Statistics||Intermediate"
]
} |
[
{
"prob_id": "865d",
"tags": [
"Slope Trick|More Tricks|Dynamic Programming (DP)"
]
},
{
"prob_id": "1132g",
"tags": [
"Segment Tree with Lazy Propagation|Segment Tree|Data Structures (DS)"
]
},
{
"prob_id": "522d",
"tags": [
"Persistent Segment Tree|Segment... | {
"prob_id": "flip and rectangles081",
"tags": [
"All Nearest Smaller Values and All Subarray Maximum/Minimum|Miscellaneous|Miscellaneous"
]
} | {
"prob_id": "817d",
"tags": [
"All Nearest Smaller Values and All Subarray Maximum/Minimum|Miscellaneous|Miscellaneous"
]
} |
[
{
"prob_id": "1073g",
"tags": [
"String Suffix||",
"Suffix Automaton|Suffix Structures|Strings"
]
},
{
"prob_id": "919d",
"tags": [
"Topological Sorting|Graph Traversal|Graph Theory"
]
},
{
"prob_id": "506d",
"tags": [
"Splitting Objects into Light and... | {
"prob_id": "flip and rectangles081",
"tags": [
"All Nearest Smaller Values and All Subarray Maximum/Minimum|Miscellaneous|Miscellaneous"
]
} | {
"prob_id": "602d",
"tags": [
"All Nearest Smaller Values and All Subarray Maximum/Minimum|Miscellaneous|Miscellaneous"
]
} |
[
{
"prob_id": "280d",
"tags": [
"Min Cost Max Flow (MCMF)|Flow and Min Cut|Graph Theory"
]
},
{
"prob_id": "10d",
"tags": [
"Longest Increasing Subsequence (LIS)|Classic DP|Dynamic Programming (DP)"
]
},
{
"prob_id": "486a",
"tags": [
"Sums and Asymptotics||P... | {
"prob_id": "707d",
"tags": [
"Offline Processing of Queries||Advanced Data Structures"
]
} | {
"prob_id": "DIVQUERY",
"tags": [
"Offline Processing of Queries||Advanced Data Structures"
]
} |
[
{
"prob_id": "585f",
"tags": [
"Aho-Corasick|String Structures|Advanced Data Structures"
]
},
{
"prob_id": "296c",
"tags": [
"Prefix Sums and Difference Arrays|Range Queries|Basics"
]
},
{
"prob_id": "295a",
"tags": [
"Prefix Sums and Difference Arrays|Range... | {
"prob_id": "577e",
"tags": [
"Mo's Algorithm|Square Root Decomposition|Data Structures (DS)"
]
} | {
"prob_id": "351d",
"tags": [
"Mo's Algorithm|Square Root Decomposition|Data Structures (DS)"
]
} |
[
{
"prob_id": "51c",
"tags": [
"Two Pointers|Leveraging Monotonicity|Basics"
]
},
{
"prob_id": "916e",
"tags": [
"Binary Lifting||Advanced Data Structures"
]
},
{
"prob_id": "860d",
"tags": [
"Spanning Tree||"
]
}
] | {
"prob_id": "577e",
"tags": [
"Mo's Algorithm|Square Root Decomposition|Data Structures (DS)"
]
} | {
"prob_id": "620f",
"tags": [
"Mo's Algorithm|Square Root Decomposition|Data Structures (DS)"
]
} |
[
{
"prob_id": "1004e",
"tags": [
"Tree Diameter|Graph Traversal|Graph Theory"
]
},
{
"prob_id": "587e",
"tags": [
"Vector Space and XOR Basis|Linear Algebra|Math"
]
},
{
"prob_id": "756114",
"tags": [
"Prime Factorization|Number Theory|Basics"
]
}
] | {
"prob_id": "DGCD",
"tags": [
"Heavy Light Decomposition (HLD) ft Subtrees and Path Query|Heavy Light Decomposition (HLD)|Data Structures (DS)"
]
} | {
"prob_id": "696e",
"tags": [
"Heavy Light Decomposition (HLD) ft Subtrees and Path Query|Heavy Light Decomposition (HLD)|Data Structures (DS)"
]
} |
[
{
"prob_id": "263d",
"tags": [
"Cycle Detection|Cycles|Graph Theory"
]
},
{
"prob_id": "341d",
"tags": [
"2D BIT with Range Update and Range Query|Binary Indexed Tree (BIT)|Data Structures (DS)"
]
},
{
"prob_id": "87e",
"tags": [
"Minkowski Sum|Convex Polygo... | {
"prob_id": "796c",
"tags": [
"Tree Flattening||Advanced Data Structures"
]
} | {
"prob_id": "276e",
"tags": [
"Tree Flattening||Advanced Data Structures"
]
} |
[
{
"prob_id": "527d",
"tags": [
"Maximum Clique|Cliques and Independent Sets|Graph Theory"
]
},
{
"prob_id": "305b",
"tags": [
"Continued Fractions|Miscellaneous|Math"
]
},
{
"prob_id": "237e",
"tags": [
"Min Cost Max Flow (MCMF)|Flow and Min Cut|Graph Theory... | {
"prob_id": "808g",
"tags": [
"Knuth Morris Pratt (KMP) and Prefix Automaton|String Matching|Strings"
]
} | {
"prob_id": "631d",
"tags": [
"Knuth Morris Pratt (KMP) and Prefix Automaton|String Matching|Strings"
]
} |
[
{
"prob_id": "1100f",
"tags": [
"XOR Basis||"
]
},
{
"prob_id": "33b",
"tags": [
"Floyd Warshall|Shortest Paths|Graph Theory"
]
},
{
"prob_id": "438e",
"tags": [
"Fast Fourier Transform (FFT)|Convolution|Math",
"Generating Functions|Polynomial|Math"
... | {
"prob_id": "863d",
"tags": [
"Splay Trees and Treaps|Augmenting Data Structures|Advanced Data Structures"
]
} | {
"prob_id": "809d",
"tags": [
"Splay Trees and Treaps|Augmenting Data Structures|Advanced Data Structures"
]
} |
[
{
"prob_id": "869e",
"tags": [
"Orthogonal Range Queries|Range Queries|Advanced Data Structures"
]
},
{
"prob_id": "722c",
"tags": [
"Disjoint Set Union||"
]
},
{
"prob_id": "1240f",
"tags": [
"Edge Coloring of Bipartite Graph|Graph Coloring|Graph Theory"
... | {
"prob_id": "455d",
"tags": [
"Splay Trees and Treaps|Augmenting Data Structures|Advanced Data Structures"
]
} | {
"prob_id": "702f",
"tags": [
"Splay Trees and Treaps|Augmenting Data Structures|Advanced Data Structures"
]
} |
[
{
"prob_id": "852f",
"tags": [
"Multiplicative Order and Carmichael's Lambda Function|Modular Arithmetic|Number Theory"
]
},
{
"prob_id": "1252l",
"tags": [
"Network Flows||Advanced Algorithms"
]
},
{
"prob_id": "455c",
"tags": [
"Tree Centers and Diameter||... | {
"prob_id": "863d",
"tags": [
"Splay Trees and Treaps|Augmenting Data Structures|Advanced Data Structures"
]
} | {
"prob_id": "167d",
"tags": [
"Splay Trees and Treaps|Augmenting Data Structures|Advanced Data Structures"
]
} |
[
{
"prob_id": "456e",
"tags": [
"Tree Diameter|Graph Traversal|Graph Theory"
]
},
{
"prob_id": "383e",
"tags": [
"Bit Manipulation|Bit Manipulation|Basics",
"Sum Over Subsets DP (SOS DP)|Bit Related DP|Dynamic Programming (DP)"
]
},
{
"prob_id": "777e",
"tags... | {
"prob_id": "762e",
"tags": [
"Splay Trees and Treaps|Augmenting Data Structures|Advanced Data Structures"
]
} | {
"prob_id": "420d",
"tags": [
"Splay Trees and Treaps|Augmenting Data Structures|Advanced Data Structures"
]
} |
[
{
"prob_id": "585b",
"tags": [
"Grid Graphs|Graphs|Basics"
]
},
{
"prob_id": "760f",
"tags": [
"Binomial Coefficients|Fundamentals|Combinatorics"
]
},
{
"prob_id": "329c",
"tags": [
"Probabilities and Expected Values|Probabilities and Expected Values|Math"
... | {
"prob_id": "lotus leaves074",
"tags": [
"Network Flows||Advanced Algorithms"
]
} | {
"prob_id": "546e",
"tags": [
"Network Flows||Advanced Algorithms"
]
} |
[
{
"prob_id": "855d",
"tags": [
"Level Ancestors and Lowest Common Ancestors||Advanced Data Structures"
]
},
{
"prob_id": "594e",
"tags": [
"Lyndon Factorization / Duval Algorithm|Miscellaneous|Strings"
]
},
{
"prob_id": "873e",
"tags": [
"Sparse Table|Sparse... | {
"prob_id": "lotus leaves074",
"tags": [
"Network Flows||Advanced Algorithms"
]
} | {
"prob_id": "434d",
"tags": [
"Network Flows||Advanced Algorithms"
]
} |
[
{
"prob_id": "802i",
"tags": [
"Suffix Array|Suffix Structures|Strings"
]
},
{
"prob_id": "598c",
"tags": [
"Vectors and Applications|Geometry|Basics"
]
},
{
"prob_id": "1305c",
"tags": [
"Pigeonhole Principle|Basic Counting|Basics"
]
}
] | {
"prob_id": "lotus leaves074",
"tags": [
"Network Flows||Advanced Algorithms"
]
} | {
"prob_id": "653d",
"tags": [
"Network Flows||Advanced Algorithms"
]
} |
[
{
"prob_id": "1381a2",
"tags": [
"Basic Constructive Algorithms|Greedy and Constructive|Basics"
]
},
{
"prob_id": "120j",
"tags": [
"Closest Pair of Points|Sweep Line|Geometry"
]
},
{
"prob_id": "1108e2",
"tags": [
"Sorted Set||"
]
}
] | {
"prob_id": "mul085",
"tags": [
"Network Flows||Advanced Algorithms"
]
} | {
"prob_id": "1082g",
"tags": [
"Network Flows||Advanced Algorithms"
]
} |
[
{
"prob_id": "6e",
"tags": [
"Two Pointers|Leveraging Monotonicity|Basics"
]
},
{
"prob_id": "1148h",
"tags": [
"[Problem] MEX of all Subarrays|Miscellaneous|Miscellaneous"
]
},
{
"prob_id": "407c",
"tags": [
"Binomial Coefficients|Fundamentals|Combinatorics... | {
"prob_id": "prime flip080",
"tags": [
"Bipartite Matching|Network Flows|Advanced Algorithms"
]
} | {
"prob_id": "727d",
"tags": [
"Bipartite Matching|Network Flows|Advanced Algorithms"
]
} |
[
{
"prob_id": "1081c",
"tags": [
"Counting with DP||Intermediate"
]
},
{
"prob_id": "852f",
"tags": [
"Multiplicative Order and Carmichael's Lambda Function|Modular Arithmetic|Number Theory"
]
},
{
"prob_id": "398d",
"tags": [
"Splitting Objects into Light an... | {
"prob_id": "prime flip080",
"tags": [
"Bipartite Matching|Network Flows|Advanced Algorithms"
]
} | {
"prob_id": "387d",
"tags": [
"Bipartite Matching|Network Flows|Advanced Algorithms"
]
} |
[
{
"prob_id": "703d",
"tags": [
"Offline Processing of Queries||Advanced Data Structures"
]
},
{
"prob_id": "505d",
"tags": [
"Strongly Connected Components (SCC)|Graph Connectivity|Graph Theory"
]
},
{
"prob_id": "149d",
"tags": [
"Counting with DP||Intermed... | {
"prob_id": "prime flip080",
"tags": [
"Bipartite Matching|Network Flows|Advanced Algorithms"
]
} | {
"prob_id": "1009g",
"tags": [
"Bipartite Matching|Network Flows|Advanced Algorithms"
]
} |
[
{
"prob_id": "78e",
"tags": [
"Bipartite Matching|Network Flows|Advanced Algorithms"
]
},
{
"prob_id": "662a",
"tags": [
"Vector Space and XOR Basis|Linear Algebra|Math"
]
},
{
"prob_id": "348a",
"tags": [
"Binary Search|Leveraging Monotonicity|Basics"
]... | {
"prob_id": "select half162",
"tags": [
"Skip Useless States|DP Optimization|Advanced Algorithms"
]
} | {
"prob_id": "729f",
"tags": [
"Skip Useless States|DP Optimization|Advanced Algorithms"
]
} |
[
{
"prob_id": "362e",
"tags": [
"Bipartite Matching|Network Flows|Advanced Algorithms"
]
},
{
"prob_id": "585d",
"tags": [
"Meet in the Middle|Techniques|Miscellaneous"
]
},
{
"prob_id": "280d",
"tags": [
"Min Cost Max Flow (MCMF)|Flow and Min Cut|Graph Theor... | {
"prob_id": "946g",
"tags": [
"O(n lg n) Longest Monotonic Subsequence|DP Optimization|Advanced Algorithms"
]
} | {
"prob_id": "474e",
"tags": [
"O(n lg n) Longest Monotonic Subsequence|DP Optimization|Advanced Algorithms"
]
} |
[
{
"prob_id": "160d",
"tags": [
"Biconnectivity|DFS Lowlink|Advanced Algorithms"
]
},
{
"prob_id": "877f",
"tags": [
"Square Root Decomposition||"
]
},
{
"prob_id": "1176e",
"tags": [
"Bipartite Graph||",
"Graph Traversal||"
]
}
] | {
"prob_id": "314c",
"tags": [
"O(n lg n) Longest Monotonic Subsequence|DP Optimization|Advanced Algorithms"
]
} | {
"prob_id": "960f",
"tags": [
"O(n lg n) Longest Monotonic Subsequence|DP Optimization|Advanced Algorithms"
]
} |
[
{
"prob_id": "1109f",
"tags": [
"Link Cut Tree (LCT)|Link Cut Tree (LCT)|Data Structures (DS)"
]
},
{
"prob_id": "715b",
"tags": [
"Dijkstra's Algorithm|Shortest Paths|Graph Theory"
]
},
{
"prob_id": "891e",
"tags": [
"Generating Functions|Polynomial|Math"
... | {
"prob_id": "946g",
"tags": [
"O(n lg n) Longest Monotonic Subsequence|DP Optimization|Advanced Algorithms"
]
} | {
"prob_id": "930c",
"tags": [
"O(n lg n) Longest Monotonic Subsequence|DP Optimization|Advanced Algorithms"
]
} |
[
{
"prob_id": "367b",
"tags": [
"Sliding Window|Data Structure Techniques|Intermediate"
]
},
{
"prob_id": "37c",
"tags": [
"Trie||"
]
},
{
"prob_id": "280d",
"tags": [
"Min Cost Max Flow (MCMF)|Flow and Min Cut|Graph Theory"
]
}
] | {
"prob_id": "629d",
"tags": [
"O(n lg n) Longest Monotonic Subsequence|DP Optimization|Advanced Algorithms"
]
} | {
"prob_id": "314c",
"tags": [
"O(n lg n) Longest Monotonic Subsequence|DP Optimization|Advanced Algorithms"
]
} |
[
{
"prob_id": "587e",
"tags": [
"Vector Space and XOR Basis|Linear Algebra|Math"
]
},
{
"prob_id": "849e",
"tags": [
"BIT / Fenwick Tree|Binary Indexed Tree (BIT)|Data Structures (DS)"
]
},
{
"prob_id": "716e",
"tags": [
"Centroid Decomposition|Centroid Decom... | {
"prob_id": "BEAUTY",
"tags": [
"Subset Convolution|Bit Related DP|Dynamic Programming (DP)"
]
} | {
"prob_id": "772d",
"tags": [
"Subset Convolution|Bit Related DP|Dynamic Programming (DP)"
]
} |
[
{
"prob_id": "371c",
"tags": [
"Binary Search|Leveraging Monotonicity|Basics"
]
},
{
"prob_id": "DIVQUERY",
"tags": [
"Offline Processing of Queries||Advanced Data Structures"
]
},
{
"prob_id": "149e",
"tags": [
"Z algorithm|String Matching|Strings"
]
... | {
"prob_id": "or plus max100",
"tags": [
"Subset Convolution|Bit Related DP|Dynamic Programming (DP)"
]
} | {
"prob_id": "BEAUTY",
"tags": [
"Subset Convolution|Bit Related DP|Dynamic Programming (DP)"
]
} |
[
{
"prob_id": "1439b",
"tags": [
"Maximum Clique|Cliques and Independent Sets|Graph Theory"
]
},
{
"prob_id": "678f",
"tags": [
"Convex Hull Trick|DP Optimization|Advanced Algorithms"
]
},
{
"prob_id": "27d",
"tags": [
"Bipartite Graph||"
]
}
] | {
"prob_id": "unhappy hacking059",
"tags": [
"Fast Fourier Transform (FFT)|Convolution|Math"
]
} | {
"prob_id": "286e",
"tags": [
"Fast Fourier Transform (FFT)|Convolution|Math"
]
} |
[
{
"prob_id": "817d",
"tags": [
"All Nearest Smaller Values and All Subarray Maximum/Minimum|Miscellaneous|Miscellaneous"
]
},
{
"prob_id": "678f",
"tags": [
"Convex Hull Trick|DP Optimization|Advanced Algorithms"
]
},
{
"prob_id": "594e",
"tags": [
"Lyndon F... | {
"prob_id": "unhappy hacking059",
"tags": [
"Fast Fourier Transform (FFT)|Convolution|Math"
]
} | {
"prob_id": "553e",
"tags": [
"Fast Fourier Transform (FFT)|Convolution|Math"
]
} |
[
{
"prob_id": "1000c",
"tags": [
"Coordinate Compression|Techniques|Miscellaneous",
"Prefix Sum|Range Queries Without Updates|Basics"
]
},
{
"prob_id": "1193a",
"tags": [
"Chromatic Polynomial ft Number of DAGs|Graph Coloring|Graph Theory"
]
},
{
"prob_id": "1082... | {
"prob_id": "958f3",
"tags": [
"Fast Fourier Transform (FFT)|Convolution|Math"
]
} | {
"prob_id": "1398g",
"tags": [
"Fast Fourier Transform (FFT)|Convolution|Math"
]
} |
[
{
"prob_id": "1106f",
"tags": [
"Discrete Logarithm||Advanced Mathematics"
]
},
{
"prob_id": "76f",
"tags": [
"O(n lg n) Longest Monotonic Subsequence|DP Optimization|Advanced Algorithms"
]
},
{
"prob_id": "318a",
"tags": [
"Sums and Asymptotics||Preliminari... | {
"prob_id": "453d",
"tags": [
"Fast Walsh Hadamard Transform (FWHT) and its Variations|Convolution|Math"
]
} | {
"prob_id": "850e",
"tags": [
"Fast Walsh Hadamard Transform (FWHT) and its Variations|Convolution|Math"
]
} |
[
{
"prob_id": "704c",
"tags": [
"2-SAT|DFS Lowlink|Advanced Algorithms"
]
},
{
"prob_id": "1591d",
"tags": [
"Invariants and Monovariants|Techniques|Miscellaneous",
"Permutations and Permutation Cycles|Permutations|Miscellaneous"
]
},
{
"prob_id": "768b",
"ta... | {
"prob_id": "986f",
"tags": [
"Linear Diophantine Equations|Fundamentals|Algebra"
]
} | {
"prob_id": "633a",
"tags": [
"Linear Diophantine Equations|Fundamentals|Algebra"
]
} |
[
{
"prob_id": "776d",
"tags": [
"2-SAT|DFS Lowlink|Advanced Algorithms",
"Disjoint Set Union||",
"Strongly Connected Components (SCC)|Graph Connectivity|Graph Theory"
]
},
{
"prob_id": "860d",
"tags": [
"Spanning Tree||"
]
},
{
"prob_id": "358c",
"tags"... | {
"prob_id": "1036f",
"tags": [
"Euler's totient function|Number-theoretic functions|Algebra"
]
} | {
"prob_id": "776e",
"tags": [
"Euler's totient function|Number-theoretic functions|Algebra"
]
} |
[
{
"prob_id": "585d",
"tags": [
"Meet in the Middle|Techniques|Miscellaneous"
]
},
{
"prob_id": "862b",
"tags": [
"Bipartite Graph||",
"Graph Traversal||"
]
},
{
"prob_id": "518d",
"tags": [
"Markov Chains|Probability and Expectation|Intermediate"
]... | {
"prob_id": "863e",
"tags": [
"Sparse Table|Sparse Table|Data Structures (DS)"
]
} | {
"prob_id": "475d",
"tags": [
"Sparse Table|Sparse Table|Data Structures (DS)"
]
} |
[
{
"prob_id": "1353d",
"tags": [
"Basic Constructive Algorithms|Greedy and Constructive|Basics"
]
},
{
"prob_id": "1421a",
"tags": [
"Bit Manipulation|Bit Manipulation|Basics"
]
},
{
"prob_id": "727d",
"tags": [
"Bipartite Matching|Network Flows|Advanced Algo... | {
"prob_id": "597c",
"tags": [
"BIT / Fenwick Tree|Binary Indexed Tree (BIT)|Data Structures (DS)"
]
} | {
"prob_id": "669e",
"tags": [
"BIT / Fenwick Tree|Binary Indexed Tree (BIT)|Data Structures (DS)"
]
} |
[
{
"prob_id": "442b",
"tags": [
"Probabilities and Expected Values|Probabilities and Expected Values|Math"
]
},
{
"prob_id": "687b",
"tags": [
"Chinese Remainder Theorem|Modular arithmetic|Algebra"
]
},
{
"prob_id": "962f",
"tags": [
"DFS Tree|Graph Traversal... | {
"prob_id": "707e",
"tags": [
"BIT / Fenwick Tree|Binary Indexed Tree (BIT)|Data Structures (DS)"
]
} | {
"prob_id": "597c",
"tags": [
"BIT / Fenwick Tree|Binary Indexed Tree (BIT)|Data Structures (DS)"
]
} |
[
{
"prob_id": "846d",
"tags": [
"Monotonic Queue 2D|Miscellaneous|Data Structures (DS)"
]
},
{
"prob_id": "987e",
"tags": [
"Permutations and Permutation Cycles|Permutations|Miscellaneous"
]
},
{
"prob_id": "1205f",
"tags": [
"Permutation Tree|More Tree Data ... | {
"prob_id": "669e",
"tags": [
"BIT / Fenwick Tree|Binary Indexed Tree (BIT)|Data Structures (DS)"
]
} | {
"prob_id": "849e",
"tags": [
"BIT / Fenwick Tree|Binary Indexed Tree (BIT)|Data Structures (DS)"
]
} |
[
{
"prob_id": "427c",
"tags": [
"Strongly Connected Components (SCC)|Graph Connectivity|Graph Theory"
]
},
{
"prob_id": "877d",
"tags": [
"Grid Graphs|Graphs|Basics"
]
},
{
"prob_id": "371d",
"tags": [
"Disjoint Set Union||"
]
}
] | {
"prob_id": "786c",
"tags": [
"Sqrt Decomposition|Trees|Data Structures"
]
} | {
"prob_id": "433b",
"tags": [
"Sqrt Decomposition|Trees|Data Structures"
]
} |
[
{
"prob_id": "821e",
"tags": [
"Matrix Exponentiation|Matrices|Math"
]
},
{
"prob_id": "704d",
"tags": [
"Flow with Lower Bounds||"
]
},
{
"prob_id": "1085e",
"tags": [
"Tree Centers and Diameter||Advanced Data Structures"
]
}
] | {
"prob_id": "7d",
"tags": [
"String Hashing|Hashing|Strings"
]
} | {
"prob_id": "727e",
"tags": [
"String Hashing|Hashing|Strings"
]
} |
[
{
"prob_id": "231e",
"tags": [
"Biconnectivity|DFS Lowlink|Advanced Algorithms"
]
},
{
"prob_id": "878c",
"tags": [
"Sorted Set||"
]
},
{
"prob_id": "607b",
"tags": [
"Interval DP / Range DP / Matrix Chain Multiplication (MCM)|Classic DP|Dynamic Programming ... | {
"prob_id": "757f",
"tags": [
"Dijkstra's Algorithm|Shortest Paths|Graph Theory"
]
} | {
"prob_id": "464e",
"tags": [
"Dijkstra's Algorithm|Shortest Paths|Graph Theory"
]
} |
[
{
"prob_id": "505d",
"tags": [
"Strongly Connected Components (SCC)|Graph Connectivity|Graph Theory"
]
},
{
"prob_id": "878c",
"tags": [
"Sorted Set||"
]
},
{
"prob_id": "1213g",
"tags": [
"Disjoint Set Union||",
"Minimum Spanning Tree||"
]
}
] | {
"prob_id": "757f",
"tags": [
"Dijkstra's Algorithm|Shortest Paths|Graph Theory"
]
} | {
"prob_id": "843d",
"tags": [
"Dijkstra's Algorithm|Shortest Paths|Graph Theory"
]
} |
[
{
"prob_id": "567e",
"tags": [
"Dijkstra's Algorithm|Shortest Paths|Graph Theory"
]
},
{
"prob_id": "25c",
"tags": [
"All-Pairs|Shortest Paths|Intermediate"
]
},
{
"prob_id": "700c",
"tags": [
"Finding Bridges in O(N+M)|Connected components, bridges, articul... | {
"prob_id": "828f",
"tags": [
"Lowest Common Ancestor|Lowest common ancestor|Graphs"
]
} | {
"prob_id": "733f",
"tags": [
"Lowest Common Ancestor|Lowest common ancestor|Graphs"
]
} |
[
{
"prob_id": "painting graphs with atcodeer062",
"tags": [
"Biconnectivity|DFS Lowlink|Advanced Algorithms",
"Burnside's Lemma / Polya Enumeration Theorem|Miscellaneous|Combinatorics"
]
},
{
"prob_id": "snuke line068",
"tags": [
"Harmonic Lemma||Intermediate"
]
},
{... | {
"prob_id": "1434d",
"tags": [
"Tree Diameter|Graph Traversal|Graph Theory"
]
} | {
"prob_id": "removing coins033",
"tags": [
"Tree Diameter|Graph Traversal|Graph Theory"
]
} |
[
{
"prob_id": "704e",
"tags": [
"Heavy Light Decomposition (HLD) ft Subtrees and Path Query|Heavy Light Decomposition (HLD)|Data Structures (DS)"
]
},
{
"prob_id": "527d",
"tags": [
"Maximum Clique|Cliques and Independent Sets|Graph Theory"
]
},
{
"prob_id": "1085e",
... | {
"prob_id": "papple sort088",
"tags": [
"Inversions|Miscellaneous|Miscellaneous"
]
} | {
"prob_id": "1526d",
"tags": [
"Inversions|Miscellaneous|Miscellaneous"
]
} |
[
{
"prob_id": "983b",
"tags": [
"Prefix Sums and Difference Arrays|Range Queries|Basics"
]
},
{
"prob_id": "145e",
"tags": [
"Segment Tree with Lazy Propagation|Segment Tree|Data Structures (DS)"
]
},
{
"prob_id": "1404e",
"tags": [
"Maximum Flow / Minimum Cu... | {
"prob_id": "DPOWPERM",
"tags": [
"Permutations and Permutation Cycles|Permutations|Miscellaneous"
]
} | {
"prob_id": "987e",
"tags": [
"Permutations and Permutation Cycles|Permutations|Miscellaneous"
]
} |
[
{
"prob_id": "1073e",
"tags": [
"DP on Digits||Intermediate"
]
},
{
"prob_id": "235c",
"tags": [
"String Suffix||",
"Suffix Automaton|Suffix Structures|Strings"
]
},
{
"prob_id": "1225d",
"tags": [
"Divisibility||"
]
}
] | {
"prob_id": "1396a",
"tags": [
"Basic Constructive Algorithms|Greedy and Constructive|Basics"
]
} | {
"prob_id": "1335b",
"tags": [
"Basic Constructive Algorithms|Greedy and Constructive|Basics"
]
} |
[
{
"prob_id": "1603f",
"tags": [
"q Binomial|Linear Algebra|Math"
]
},
{
"prob_id": "1444d",
"tags": [
"Bitsets||"
]
},
{
"prob_id": "1439b",
"tags": [
"Maximum Clique|Cliques and Independent Sets|Graph Theory"
]
}
] | {
"prob_id": "1028b",
"tags": [
"Basic Constructive Algorithms|Greedy and Constructive|Basics"
]
} | {
"prob_id": "1353d",
"tags": [
"Basic Constructive Algorithms|Greedy and Constructive|Basics"
]
} |
[
{
"prob_id": "1603f",
"tags": [
"q Binomial|Linear Algebra|Math"
]
},
{
"prob_id": "1364e",
"tags": [
"Interactive Problems|Interactive Problems|Miscellaneous"
]
},
{
"prob_id": "1439b",
"tags": [
"Maximum Clique|Cliques and Independent Sets|Graph Theory"
... | {
"prob_id": "1028b",
"tags": [
"Basic Constructive Algorithms|Greedy and Constructive|Basics"
]
} | {
"prob_id": "1364c",
"tags": [
"Basic Constructive Algorithms|Greedy and Constructive|Basics"
]
} |
[
{
"prob_id": "1603f",
"tags": [
"q Binomial|Linear Algebra|Math"
]
},
{
"prob_id": "1349a",
"tags": [
"Divisibility||",
"Prime Factorization|Number Theory|Basics"
]
},
{
"prob_id": "1325f",
"tags": [
"DFS Tree|Graph Traversal|Graph Theory"
]
}
] | {
"prob_id": "1028b",
"tags": [
"Basic Constructive Algorithms|Greedy and Constructive|Basics"
]
} | {
"prob_id": "1381a2",
"tags": [
"Basic Constructive Algorithms|Greedy and Constructive|Basics"
]
} |
[
{
"prob_id": "1328a",
"tags": [
"Big O Notation and Time and Space Complexity Analysis|Complexity Analysis|Basics"
]
},
{
"prob_id": "1175f",
"tags": [
"XOR Hashing|Hashing|Strings"
]
},
{
"prob_id": "120j",
"tags": [
"Closest Pair of Points|Sweep Line|Geome... | {
"prob_id": "852e",
"tags": [
"Rerooting Technique|More Tree Stuff|Graph Theory"
]
} | {
"prob_id": "1092f",
"tags": [
"Rerooting Technique|More Tree Stuff|Graph Theory"
]
} |
[
{
"prob_id": "176e",
"tags": [
"Level Ancestors and Lowest Common Ancestors||Advanced Data Structures"
]
},
{
"prob_id": "2c",
"tags": [
"Hill Climbing and Simulated Annealing|Miscellaneous|Geometry"
]
},
{
"prob_id": "280d",
"tags": [
"Min Cost Max Flow (MC... | {
"prob_id": "1561d2",
"tags": [
"Sieve, Prime Factorization and Divisors|Primes and Divisors|Number Theory"
]
} | {
"prob_id": "222c",
"tags": [
"Sieve, Prime Factorization and Divisors|Primes and Divisors|Number Theory"
]
} |
[
{
"prob_id": "1245f",
"tags": [
"DP on Digits||Intermediate"
]
},
{
"prob_id": "1430e",
"tags": [
"Inversions|Miscellaneous|Miscellaneous"
]
},
{
"prob_id": "915g",
"tags": [
"Mobius Function and Mobius Inversion|Multiplicative Functions|Number Theory"
]... | {
"prob_id": "118e",
"tags": [
"DFS Tree|Graph Traversal|Graph Theory"
]
} | {
"prob_id": "962f",
"tags": [
"DFS Tree|Graph Traversal|Graph Theory"
]
} |
[
{
"prob_id": "1213g",
"tags": [
"Disjoint Set Union||",
"Minimum Spanning Tree||"
]
},
{
"prob_id": "1299c",
"tags": [
"Convex Hull Trick|DP Optimization|Advanced Algorithms"
]
},
{
"prob_id": "914e",
"tags": [
"Centroid Decomposition|Centroid Decompos... | {
"prob_id": "190e",
"tags": [
"Inverse Graph|Graph Traversal|Graph Theory"
]
} | {
"prob_id": "1508c",
"tags": [
"Inverse Graph|Graph Traversal|Graph Theory"
]
} |
[
{
"prob_id": "1454a",
"tags": [
"Basic Constructive Algorithms|Greedy and Constructive|Basics"
]
},
{
"prob_id": "855d",
"tags": [
"Level Ancestors and Lowest Common Ancestors||Advanced Data Structures"
]
},
{
"prob_id": "1383f",
"tags": [
"Maximum Flow / Mi... | {
"prob_id": "980f",
"tags": [
"Cactus Graph|Special Graphs|Graph Theory"
]
} | {
"prob_id": "1510c",
"tags": [
"Cactus Graph|Special Graphs|Graph Theory"
]
} |
[
{
"prob_id": "1430g",
"tags": [
"DP on Trees and DAGs|Dp on Different Structures|Dynamic Programming (DP)",
"Duality in Linear Programming (LP <> Flow)|Mathematical Optimization|Math"
]
},
{
"prob_id": "1408e",
"tags": [
"Minimum Spanning Tree||"
]
},
{
"prob_id... | {
"prob_id": "920g",
"tags": [
"Mobius Function and Mobius Inversion|Multiplicative Functions|Number Theory"
]
} | {
"prob_id": "1436f",
"tags": [
"Mobius Function and Mobius Inversion|Multiplicative Functions|Number Theory"
]
} |
[
{
"prob_id": "803d",
"tags": [
"Basic Greedy Algorithms|Greedy and Constructive|Basics",
"Binary Search|Leveraging Monotonicity|Basics",
"Two Pointers|Leveraging Monotonicity|Basics"
]
},
{
"prob_id": "865g",
"tags": [
"Generating Functions|Polynomial|Math"
]
},... | {
"prob_id": "920g",
"tags": [
"Mobius Function and Mobius Inversion|Multiplicative Functions|Number Theory"
]
} | {
"prob_id": "915g",
"tags": [
"Mobius Function and Mobius Inversion|Multiplicative Functions|Number Theory"
]
} |
[
{
"prob_id": "1091e",
"tags": [
"Degree Sequences|Miscellaneous|Graph Theory"
]
},
{
"prob_id": "1181d",
"tags": [
"Binary Search|Leveraging Monotonicity|Basics",
"Point Update Range Sum||"
]
},
{
"prob_id": "1240f",
"tags": [
"Edge Coloring of Biparti... | {
"prob_id": "243e",
"tags": [
"PQ Tree|More Tree Data Structures|Data Structures (DS)"
]
} | {
"prob_id": "1552i",
"tags": [
"PQ Tree|More Tree Data Structures|Data Structures (DS)"
]
} |
[
{
"prob_id": "1093e",
"tags": [
"2D BIT|Binary Indexed Tree (BIT)|Data Structures (DS)",
"CDQ Divide and Conquer|Techniques|Data Structures (DS)"
]
},
{
"prob_id": "1205f",
"tags": [
"Permutation Tree|More Tree Data Structures|Data Structures (DS)"
]
},
{
"prob_... | {
"prob_id": "398d",
"tags": [
"Splitting Objects into Light and Heavy / Case Processing|Square Root Decomposition|Data Structures (DS)"
]
} | {
"prob_id": "1619h",
"tags": [
"Splitting Objects into Light and Heavy / Case Processing|Square Root Decomposition|Data Structures (DS)"
]
} |
[
{
"prob_id": "543b",
"tags": [
"Breadth First Search|Graph traversal|Graphs"
]
},
{
"prob_id": "546e",
"tags": [
"Network Flows||Advanced Algorithms"
]
},
{
"prob_id": "118e",
"tags": [
"DFS Tree|Graph Traversal|Graph Theory"
]
}
] | {
"prob_id": "1187e",
"tags": [
"DP on Trees and DAGs|Dp on Different Structures|Dynamic Programming (DP)"
]
} | {
"prob_id": "543d",
"tags": [
"Rerooting Technique|More Tree Stuff|Graph Theory"
]
} |
[
{
"prob_id": "868f",
"tags": [
"Divide and Conquer DP|DP optimizations|Dynamic Programming",
"Divide and Conquer DP|DP optimizations|Dynamic Programming"
]
},
{
"prob_id": "1132g",
"tags": [
"Segment Tree with Lazy Propagation|Segment Tree|Data Structures (DS)"
]
},
... | {
"prob_id": "701c",
"tags": [
"Two Pointers|Leveraging Monotonicity|Basics"
]
} | {
"prob_id": "1006c",
"tags": [
"Two Pointers|Leveraging Monotonicity|Basics"
]
} |
[
{
"prob_id": "33b",
"tags": [
"Floyd Warshall|Shortest Paths|Graph Theory"
]
},
{
"prob_id": "33c",
"tags": [
"Classic Problems with Twists|DP|Intermediate"
]
},
{
"prob_id": "689b",
"tags": [
"Breadth First Search|Graph traversal|Graphs"
]
}
] | {
"prob_id": "702c",
"tags": [
"Binary Search|Leveraging Monotonicity|Basics",
"Two Pointers|Leveraging Monotonicity|Basics"
]
} | {
"prob_id": "279b",
"tags": [
"Two Pointers|Leveraging Monotonicity|Basics"
]
} |
[
{
"prob_id": "739e",
"tags": [
"Aliens Trick / WQS Binary Search|DP Optimizations|Dynamic Programming (DP)"
]
},
{
"prob_id": "332b",
"tags": [
"Classic Problems with Twists|DP|Intermediate"
]
},
{
"prob_id": "190e",
"tags": [
"Inverse Graph|Graph Traversal|... | {
"prob_id": "1006c",
"tags": [
"Two Pointers|Leveraging Monotonicity|Basics"
]
} | {
"prob_id": "701c",
"tags": [
"Two Pointers|Leveraging Monotonicity|Basics"
]
} |
[
{
"prob_id": "546e",
"tags": [
"Network Flows||Advanced Algorithms"
]
},
{
"prob_id": "707b",
"tags": [
"Single Source|Shortest Paths|Intermediate"
]
},
{
"prob_id": "1572f",
"tags": [
"Segment Tree Beats|Segment Tree|Data Structures (DS)",
"Segment Tr... | {
"prob_id": "1006c",
"tags": [
"Two Pointers|Leveraging Monotonicity|Basics"
]
} | {
"prob_id": "702c",
"tags": [
"Binary Search|Leveraging Monotonicity|Basics",
"Two Pointers|Leveraging Monotonicity|Basics"
]
} |
[
{
"prob_id": "920f",
"tags": [
"Segment Tree|Trees|Data Structures"
]
},
{
"prob_id": "407c",
"tags": [
"Binomial Coefficients|Fundamentals|Combinatorics"
]
},
{
"prob_id": "602d",
"tags": [
"All Nearest Smaller Values and All Subarray Maximum/Minimum|Miscel... | {
"prob_id": "1513b",
"tags": [
"Bit Manipulation|Bit Manipulation|Basics"
]
} | {
"prob_id": "484a",
"tags": [
"Bit Manipulation|Bit Manipulation|Basics"
]
} |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.