negative listlengths 3 3 | positive dict | reference dict |
|---|---|---|
[
{
"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": "251a",
"tags": [
"Binary Search|Leveraging Monotonicity|Basics"
]
} | {
"prob_id": "702c",
"tags": [
"Binary Search|Leveraging Monotonicity|Basics",
"Two Pointers|Leveraging Monotonicity|Basics"
]
} |
[
{
"prob_id": "121a",
"tags": [
"All-Subsets / Binary Choice|Complete Search|Basics"
]
},
{
"prob_id": "113b",
"tags": [
"Hashing||Intermediate"
]
},
{
"prob_id": "243a",
"tags": [
"Bit Manipulation|Bit Manipulation|Basics"
]
}
] | {
"prob_id": "702c",
"tags": [
"Binary Search|Leveraging Monotonicity|Basics",
"Two Pointers|Leveraging Monotonicity|Basics"
]
} | {
"prob_id": "251a",
"tags": [
"Binary Search|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": "1073c",
"tags": [
"Two Pointers|Leveraging Monotonicity|Basics"
]
} | {
"prob_id": "701c",
"tags": [
"Two Pointers|Leveraging Monotonicity|Basics"
]
} |
[
{
"prob_id": "895e",
"tags": [
"Segment Tree with Lazy Propagation|Segment Tree|Data Structures (DS)"
]
},
{
"prob_id": "152e",
"tags": [
"DP on Subsets||Intermediate"
]
},
{
"prob_id": "1016c",
"tags": [
"Prefix Sums and Difference Arrays|Range Queries|Basi... | {
"prob_id": "701c",
"tags": [
"Two Pointers|Leveraging Monotonicity|Basics"
]
} | {
"prob_id": "1073c",
"tags": [
"Two Pointers|Leveraging Monotonicity|Basics"
]
} |
[
{
"prob_id": "363b",
"tags": [
"Prefix Sum|Range Queries Without Updates|Basics"
]
},
{
"prob_id": "798b",
"tags": [
"Iterative|Complete Search|Basics"
]
},
{
"prob_id": "1303e",
"tags": [
"Interval DP / Range DP / Matrix Chain Multiplication (MCM)|Classic D... | {
"prob_id": "1203f1",
"tags": [
"Exchange Argument|Greedy|Basics"
]
} | {
"prob_id": "922d",
"tags": [
"Exchange Argument|Greedy|Basics"
]
} |
[
{
"prob_id": "864e",
"tags": [
"Presorting|DP Common Tricks|Intermediate"
]
},
{
"prob_id": "961e",
"tags": [
"BIT / Fenwick Tree|Binary Indexed Tree (BIT)|Data Structures (DS)"
]
},
{
"prob_id": "808b",
"tags": [
"Sliding Window|Data Structure Techniques|In... | {
"prob_id": "922d",
"tags": [
"Exchange Argument|Greedy|Basics"
]
} | {
"prob_id": "1203f1",
"tags": [
"Exchange Argument|Greedy|Basics"
]
} |
[
{
"prob_id": "1552i",
"tags": [
"PQ Tree|More Tree Data Structures|Data Structures (DS)"
]
},
{
"prob_id": "500a",
"tags": [
"Depth-First Traversal, Connectivity, Cycle Detection|Graphs|Basics"
]
},
{
"prob_id": "780b",
"tags": [
"Binary Search|Leveraging Mo... | {
"prob_id": "979b",
"tags": [
"Structural Argument|Greedy|Basics"
]
} | {
"prob_id": "1283e",
"tags": [
"Greedy Stays Ahead|Greedy|Basics",
"Structural Argument|Greedy|Basics"
]
} |
[
{
"prob_id": "704d",
"tags": [
"Flow with Lower Bounds||"
]
},
{
"prob_id": "212a",
"tags": [
"Edge Coloring of Bipartite Graph|Graph Coloring|Graph Theory"
]
},
{
"prob_id": "621c",
"tags": [
"Basics|Probability and Expectation|Basics"
]
}
] | {
"prob_id": "219d",
"tags": [
"Trees and Tree Traversals|Graphs|Basics"
]
} | {
"prob_id": "814d",
"tags": [
"Trees and Tree Traversals|Graphs|Basics"
]
} |
[
{
"prob_id": "1416c",
"tags": [
"Trie on Strings and Bits|Trie|Data Structures (DS)"
]
},
{
"prob_id": "1132g",
"tags": [
"Segment Tree with Lazy Propagation|Segment Tree|Data Structures (DS)"
]
},
{
"prob_id": "1527a",
"tags": [
"Bit Manipulation|Bit Manipu... | {
"prob_id": "601a",
"tags": [
"Breadth First Search|Graph traversal|Graphs"
]
} | {
"prob_id": "1205b",
"tags": [
"Breadth First Search|Graph traversal|Graphs"
]
} |
[
{
"prob_id": "340c",
"tags": [
"Binomial Coefficients|Fundamentals|Combinatorics"
]
},
{
"prob_id": "587c",
"tags": [
"Level Ancestors and Lowest Common Ancestors||Advanced Data Structures"
]
},
{
"prob_id": "547c",
"tags": [
"Principle of Inclusion-Exclusio... | {
"prob_id": "1037d",
"tags": [
"Breadth First Search|Graph traversal|Graphs"
]
} | {
"prob_id": "689b",
"tags": [
"Breadth First Search|Graph traversal|Graphs"
]
} |
[
{
"prob_id": "611c",
"tags": [
"Prefix Sums and Difference Arrays|Range Queries|Basics"
]
},
{
"prob_id": "225c",
"tags": [
"Common Patterns|DP|Intermediate"
]
},
{
"prob_id": "1404e",
"tags": [
"Maximum Flow / Minimum Cut|Flow and Min Cut|Graph Theory"
... | {
"prob_id": "329b",
"tags": [
"Grid Graphs|Graphs|Basics"
]
} | {
"prob_id": "377a",
"tags": [
"Grid Graphs|Graphs|Basics"
]
} |
[
{
"prob_id": "778a",
"tags": [
"Binary Search|Leveraging Monotonicity|Basics"
]
},
{
"prob_id": "506d",
"tags": [
"Splitting Objects into Light and Heavy / Case Processing|Square Root Decomposition|Data Structures (DS)"
]
},
{
"prob_id": "786c",
"tags": [
"S... | {
"prob_id": "329b",
"tags": [
"Grid Graphs|Graphs|Basics"
]
} | {
"prob_id": "510b",
"tags": [
"Grid Graphs|Graphs|Basics"
]
} |
[
{
"prob_id": "617b",
"tags": [
"Permutations with Repetition, Stars and Bars|Counting|Intermediate"
]
},
{
"prob_id": "552d",
"tags": [
"Basics|Geometry|Basics"
]
},
{
"prob_id": "1081d",
"tags": [
"Minimum Spanning Tree||",
"Centroid Decomposition|Cen... | {
"prob_id": "540c",
"tags": [
"Grid Graphs|Graphs|Basics"
]
} | {
"prob_id": "31d",
"tags": [
"Grid Graphs|Graphs|Basics"
]
} |
[
{
"prob_id": "1394d",
"tags": [
"DP on Trees and DAGs|Dp on Different Structures|Dynamic Programming (DP)"
]
},
{
"prob_id": "1109f",
"tags": [
"Link Cut Tree (LCT)|Link Cut Tree (LCT)|Data Structures (DS)"
]
},
{
"prob_id": "1252l",
"tags": [
"Network Flows... | {
"prob_id": "850a",
"tags": [
"Vectors and Applications|Geometry|Basics"
]
} | {
"prob_id": "975d",
"tags": [
"Vectors and Applications|Geometry|Basics"
]
} |
[
{
"prob_id": "243a",
"tags": [
"Bit Manipulation|Bit Manipulation|Basics"
]
},
{
"prob_id": "282e",
"tags": [
"Trie on Strings and Bits|Trie|Data Structures (DS)"
]
},
{
"prob_id": "842b",
"tags": [
"Basics|Geometry|Basics"
]
}
] | {
"prob_id": "448d",
"tags": [
"Binary Search|Leveraging Monotonicity|Basics"
]
} | {
"prob_id": "371c",
"tags": [
"Binary Search|Leveraging Monotonicity|Basics"
]
} |
[
{
"prob_id": "580d",
"tags": [
"DP on Subsets||Intermediate"
]
},
{
"prob_id": "580c",
"tags": [
"Trees and Tree Traversals|Graphs|Basics"
]
},
{
"prob_id": "639a",
"tags": [
"Priority Queues, Sets, Maps, Counters|Basic Data Structures|Basics"
]
}
] | {
"prob_id": "701c",
"tags": [
"Two Pointers|Leveraging Monotonicity|Basics"
]
} | {
"prob_id": "580b",
"tags": [
"Binary Search|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": "580b",
"tags": [
"Binary Search|Leveraging Monotonicity|Basics"
]
} | {
"prob_id": "701c",
"tags": [
"Two Pointers|Leveraging Monotonicity|Basics"
]
} |
[
{
"prob_id": "305e",
"tags": [
"Nim, Sprague-Grundy Theorem|Combinatorial Games|Advanced Mathematics"
]
},
{
"prob_id": "785e",
"tags": [
"2D BIT|Binary Indexed Tree (BIT)|Data Structures (DS)"
]
},
{
"prob_id": "204e",
"tags": [
"Suffix Array|Suffix Structu... | {
"prob_id": "803d",
"tags": [
"Basic Greedy Algorithms|Greedy and Constructive|Basics",
"Binary Search|Leveraging Monotonicity|Basics",
"Two Pointers|Leveraging Monotonicity|Basics"
]
} | {
"prob_id": "778a",
"tags": [
"Binary Search|Leveraging Monotonicity|Basics"
]
} |
[
{
"prob_id": "629e",
"tags": [
"Binary Lifting||Advanced Data Structures"
]
},
{
"prob_id": "1283e",
"tags": [
"Greedy Stays Ahead|Greedy|Basics",
"Structural Argument|Greedy|Basics"
]
},
{
"prob_id": "29e",
"tags": [
"Breadth First Search|Graph traver... | {
"prob_id": "448d",
"tags": [
"Binary Search|Leveraging Monotonicity|Basics"
]
} | {
"prob_id": "780b",
"tags": [
"Binary Search|Leveraging Monotonicity|Basics",
"Ternary Search|Search Techniques|Miscellaneous"
]
} |
[
{
"prob_id": "540c",
"tags": [
"Grid Graphs|Graphs|Basics"
]
},
{
"prob_id": "1000e",
"tags": [
"Articulation Bridges and Bridge Tree|Graph Connectivity|Graph Theory"
]
},
{
"prob_id": "1240f",
"tags": [
"Edge Coloring of Bipartite Graph|Graph Coloring|Graph... | {
"prob_id": "803d",
"tags": [
"Basic Greedy Algorithms|Greedy and Constructive|Basics",
"Binary Search|Leveraging Monotonicity|Basics",
"Two Pointers|Leveraging Monotonicity|Basics"
]
} | {
"prob_id": "1260d",
"tags": [
"Binary Search|Leveraging Monotonicity|Basics"
]
} |
[
{
"prob_id": "794d",
"tags": [
"Depth First Search|Graph traversal|Graphs"
]
},
{
"prob_id": "191c",
"tags": [
"Level Ancestors and Lowest Common Ancestors||Advanced Data Structures"
]
},
{
"prob_id": "456d",
"tags": [
"Trie on Strings and Bits|Trie|Data Str... | {
"prob_id": "1260d",
"tags": [
"Binary Search|Leveraging Monotonicity|Basics"
]
} | {
"prob_id": "803d",
"tags": [
"Basic Greedy Algorithms|Greedy and Constructive|Basics",
"Binary Search|Leveraging Monotonicity|Basics",
"Two Pointers|Leveraging Monotonicity|Basics"
]
} |
[
{
"prob_id": "486e",
"tags": [
"O(n lg n) Longest Monotonic Subsequence|DP Optimization|Advanced Algorithms"
]
},
{
"prob_id": "280d",
"tags": [
"Min Cost Max Flow (MCMF)|Flow and Min Cut|Graph Theory"
]
},
{
"prob_id": "868f",
"tags": [
"Divide and Conquer ... | {
"prob_id": "201b",
"tags": [
"Ternary Search|Search Techniques|Miscellaneous"
]
} | {
"prob_id": "578c",
"tags": [
"Ternary Search|Search Techniques|Miscellaneous"
]
} |
[
{
"prob_id": "793d",
"tags": [
"Directed Acyclic Graphs|Shortest Paths|Intermediate"
]
},
{
"prob_id": "1407e",
"tags": [
"Breadth First Search|Graph traversal|Graphs"
]
},
{
"prob_id": "66e",
"tags": [
"Global Deltaing||Advanced Data Structures"
]
}
] | {
"prob_id": "578c",
"tags": [
"Ternary Search|Search Techniques|Miscellaneous"
]
} | {
"prob_id": "201b",
"tags": [
"Ternary Search|Search Techniques|Miscellaneous"
]
} |
[
{
"prob_id": "505d",
"tags": [
"Strongly Connected Components (SCC)|Graph Connectivity|Graph Theory"
]
},
{
"prob_id": "576d",
"tags": [
"Matrix Exponentiation|Matrices|Math"
]
},
{
"prob_id": "330b",
"tags": [
"Basic Graph Theory|Graphs|Basics"
]
}
] | {
"prob_id": "346d",
"tags": [
"Single Source with Negative Weights|Shortest Paths|Intermediate"
]
} | {
"prob_id": "241e",
"tags": [
"Single Source with Negative Weights|Shortest Paths|Intermediate"
]
} |
[
{
"prob_id": "212a",
"tags": [
"Edge Coloring of Bipartite Graph|Graph Coloring|Graph Theory"
]
},
{
"prob_id": "191c",
"tags": [
"Level Ancestors and Lowest Common Ancestors||Advanced Data Structures"
]
},
{
"prob_id": "440d",
"tags": [
"DP on Trees and DAG... | {
"prob_id": "295b",
"tags": [
"All-Pairs|Shortest Paths|Intermediate"
]
} | {
"prob_id": "25c",
"tags": [
"All-Pairs|Shortest Paths|Intermediate"
]
} |
[
{
"prob_id": "243e",
"tags": [
"PQ Tree|More Tree Data Structures|Data Structures (DS)"
]
},
{
"prob_id": "616c",
"tags": [
"Grid Graphs|Graphs|Basics"
]
},
{
"prob_id": "1451f",
"tags": [
"Nim, Sprague-Grundy Theorem|Combinatorial Games|Advanced Mathematics... | {
"prob_id": "119c",
"tags": [
"DP with Solution Construction||Intermediate"
]
} | {
"prob_id": "2b",
"tags": [
"DP with Solution Construction||Intermediate"
]
} |
[
{
"prob_id": "1500b",
"tags": [
"Chinese Remainder Theorem|Modular arithmetic|Algebra"
]
},
{
"prob_id": "1263c",
"tags": [
"Square-Root Discrimination||Intermediate"
]
},
{
"prob_id": "412d",
"tags": [
"Conclusion||",
"DFS||"
]
}
] | {
"prob_id": "2b",
"tags": [
"DP with Solution Construction||Intermediate"
]
} | {
"prob_id": "82d",
"tags": [
"DP with Solution Construction||Intermediate"
]
} |
[
{
"prob_id": "1012d",
"tags": [
"Tricky Implementation||Intermediate"
]
},
{
"prob_id": "1234d",
"tags": [
"Segment Tree|Trees|Data Structures"
]
},
{
"prob_id": "610e",
"tags": [
"Segment Tree with Lazy Propagation|Segment Tree|Data Structures (DS)"
]
... | {
"prob_id": "82d",
"tags": [
"DP with Solution Construction||Intermediate"
]
} | {
"prob_id": "56d",
"tags": [
"DP with Solution Construction||Intermediate"
]
} |
[
{
"prob_id": "191c",
"tags": [
"Level Ancestors and Lowest Common Ancestors||Advanced Data Structures"
]
},
{
"prob_id": "567e",
"tags": [
"Dijkstra's Algorithm|Shortest Paths|Graph Theory"
]
},
{
"prob_id": "434d",
"tags": [
"Network Flows||Advanced Algorit... | {
"prob_id": "2b",
"tags": [
"DP with Solution Construction||Intermediate"
]
} | {
"prob_id": "119c",
"tags": [
"DP with Solution Construction||Intermediate"
]
} |
[
{
"prob_id": "580c",
"tags": [
"Trees and Tree Traversals|Graphs|Basics"
]
},
{
"prob_id": "580e",
"tags": [
"Segment Tree with Lazy Propagation|Segment Tree|Data Structures (DS)"
]
},
{
"prob_id": "580b",
"tags": [
"Binary Search|Leveraging Monotonicity|Bas... | {
"prob_id": "8c",
"tags": [
"DP on Subsets||Intermediate"
]
} | {
"prob_id": "580d",
"tags": [
"DP on Subsets||Intermediate"
]
} |
[
{
"prob_id": "402e",
"tags": [
"Matrix Exponentiation|Matrices|Math"
]
},
{
"prob_id": "362e",
"tags": [
"Bipartite Matching|Network Flows|Advanced Algorithms"
]
},
{
"prob_id": "117c",
"tags": [
"Tournament Graph|Special Graphs|Graph Theory"
]
}
] | {
"prob_id": "855e",
"tags": [
"DP on Digits||Intermediate",
"DP on Subsets||Intermediate"
]
} | {
"prob_id": "16e",
"tags": [
"DP on Subsets||Intermediate",
"Markov Chains|Probability and Expectation|Intermediate"
]
} |
[
{
"prob_id": "761e",
"tags": [
"Depth First Search|Graph traversal|Graphs"
]
},
{
"prob_id": "877d",
"tags": [
"Grid Graphs|Graphs|Basics"
]
},
{
"prob_id": "827f",
"tags": [
"Dijkstra's Algorithm|Shortest Paths|Graph Theory"
]
}
] | {
"prob_id": "11d",
"tags": [
"DP on Subsets||Intermediate"
]
} | {
"prob_id": "8c",
"tags": [
"DP on Subsets||Intermediate"
]
} |
[
{
"prob_id": "639a",
"tags": [
"Priority Queues, Sets, Maps, Counters|Basic Data Structures|Basics"
]
},
{
"prob_id": "535e",
"tags": [
"Convex Hull Trick|DP Optimization|Advanced Algorithms"
]
},
{
"prob_id": "1000e",
"tags": [
"Articulation Bridges and Bri... | {
"prob_id": "855e",
"tags": [
"DP on Digits||Intermediate",
"DP on Subsets||Intermediate"
]
} | {
"prob_id": "417d",
"tags": [
"DP on Subsets||Intermediate"
]
} |
[
{
"prob_id": "587e",
"tags": [
"Vector Space and XOR Basis|Linear Algebra|Math"
]
},
{
"prob_id": "232d",
"tags": [
"Suffix Array|Suffix Structures|Strings"
]
},
{
"prob_id": "816b",
"tags": [
"Prefix Sum|Range Queries Without Updates|Basics",
"Prefix ... | {
"prob_id": "11d",
"tags": [
"DP on Subsets||Intermediate"
]
} | {
"prob_id": "855e",
"tags": [
"DP on Digits||Intermediate",
"DP on Subsets||Intermediate"
]
} |
[
{
"prob_id": "118e",
"tags": [
"DFS Tree|Graph Traversal|Graph Theory"
]
},
{
"prob_id": "700c",
"tags": [
"Finding Bridges in O(N+M)|Connected components, bridges, articulations points|Graphs"
]
},
{
"prob_id": "25d",
"tags": [
"Disjoint Set Union||"
]
... | {
"prob_id": "678e",
"tags": [
"DP on Subsets||Intermediate"
]
} | {
"prob_id": "53e",
"tags": [
"DP on Subsets||Intermediate"
]
} |
[
{
"prob_id": "1500b",
"tags": [
"Chinese Remainder Theorem|Modular arithmetic|Algebra"
]
},
{
"prob_id": "704d",
"tags": [
"Flow with Lower Bounds||"
]
},
{
"prob_id": "659a",
"tags": [
"Divisibility, Modular Arithmetic|Number Theory|Basics"
]
}
] | {
"prob_id": "11d",
"tags": [
"DP on Subsets||Intermediate"
]
} | {
"prob_id": "152e",
"tags": [
"DP on Subsets||Intermediate"
]
} |
[
{
"prob_id": "33b",
"tags": [
"Floyd Warshall|Shortest Paths|Graph Theory"
]
},
{
"prob_id": "1085e",
"tags": [
"Tree Centers and Diameter||Advanced Data Structures"
]
},
{
"prob_id": "898f",
"tags": [
"Hashing||Intermediate"
]
}
] | {
"prob_id": "1245f",
"tags": [
"DP on Digits||Intermediate"
]
} | {
"prob_id": "296b",
"tags": [
"Counting with DP||Intermediate",
"DP on Digits||Intermediate"
]
} |
[
{
"prob_id": "1362b",
"tags": [
"Bit Manipulation|Bit Manipulation|Basics"
]
},
{
"prob_id": "1420b",
"tags": [
"Bit Manipulation|Bit Manipulation|Basics"
]
},
{
"prob_id": "1304d",
"tags": [
"Longest Increasing Subsequence (LIS)|Classic DP|Dynamic Programmi... | {
"prob_id": "1073e",
"tags": [
"DP on Digits||Intermediate"
]
} | {
"prob_id": "1245f",
"tags": [
"DP on Digits||Intermediate"
]
} |
[
{
"prob_id": "580d",
"tags": [
"DP on Subsets||Intermediate"
]
},
{
"prob_id": "580c",
"tags": [
"Trees and Tree Traversals|Graphs|Basics"
]
},
{
"prob_id": "243a",
"tags": [
"Bit Manipulation|Bit Manipulation|Basics"
]
}
] | {
"prob_id": "558e",
"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": "47d",
"tags": [
"Backtracking|Miscellaneous|Miscellaneous"
]
},
{
"prob_id": "1143f",
"tags": [
"Convex Hull Trick|DP Optimization|Advanced Algorithms"
]
},
{
"prob_id": "1016c",
"tags": [
"Prefix Sums and Difference Arrays|Range Queries|Basics... | {
"prob_id": "47e",
"tags": [
"Amortized Analysis||Intermediate"
]
} | {
"prob_id": "56e",
"tags": [
"Amortized Analysis||Intermediate"
]
} |
[
{
"prob_id": "1328a",
"tags": [
"Big O Notation and Time and Space Complexity Analysis|Complexity Analysis|Basics"
]
},
{
"prob_id": "1476a",
"tags": [
"Basic Constructive Algorithms|Greedy and Constructive|Basics"
]
},
{
"prob_id": "1439b",
"tags": [
"Maxim... | {
"prob_id": "632d",
"tags": [
"Divisor Sieve|Number Theory|Intermediate",
"Harmonic Lemma||Intermediate"
]
} | {
"prob_id": "1311d",
"tags": [
"Harmonic Lemma||Intermediate"
]
} |
[
{
"prob_id": "704d",
"tags": [
"Flow with Lower Bounds||"
]
},
{
"prob_id": "739e",
"tags": [
"Aliens Trick / WQS Binary Search|DP Optimizations|Dynamic Programming (DP)"
]
},
{
"prob_id": "114b",
"tags": [
"All-Subsets / Binary Choice|Complete Search|Basics... | {
"prob_id": "126b",
"tags": [
"Z algorithm|String Matching|Strings"
]
} | {
"prob_id": "633c",
"tags": [
"Trie||"
]
} |
[
{
"prob_id": "639a",
"tags": [
"Priority Queues, Sets, Maps, Counters|Basic Data Structures|Basics"
]
},
{
"prob_id": "1091e",
"tags": [
"Degree Sequences|Miscellaneous|Graph Theory"
]
},
{
"prob_id": "1552i",
"tags": [
"PQ Tree|More Tree Data Structures|Dat... | {
"prob_id": "525e",
"tags": [
"Meet in the Middle|Techniques|Miscellaneous"
]
} | {
"prob_id": "1105e",
"tags": [
"Meet in the Middle|Techniques|Miscellaneous"
]
} |
[
{
"prob_id": "367b",
"tags": [
"Sliding Window|Data Structure Techniques|Intermediate"
]
},
{
"prob_id": "177d2",
"tags": [
"Prefix Sums and Difference Arrays|Range Queries|Basics"
]
},
{
"prob_id": "468b",
"tags": [
"Disjoint Set Union||"
]
}
] | {
"prob_id": "57c",
"tags": [
"Permutations with Repetition, Stars and Bars|Counting|Intermediate"
]
} | {
"prob_id": "272d",
"tags": [
"Permutations with Repetition, Stars and Bars|Counting|Intermediate"
]
} |
[
{
"prob_id": "343d",
"tags": [
"Small to Large||",
"Tree Flattening||Advanced Data Structures"
]
},
{
"prob_id": "587e",
"tags": [
"Vector Space and XOR Basis|Linear Algebra|Math"
]
},
{
"prob_id": "689b",
"tags": [
"Breadth First Search|Graph traversa... | {
"prob_id": "451e",
"tags": [
"Generating Functions|Polynomial|Math",
"Principle of Inclusion-Exclusion|Counting|Intermediate"
]
} | {
"prob_id": "547c",
"tags": [
"Möbius Inversion||Advanced Mathematics",
"Principle of Inclusion-Exclusion|Counting|Intermediate"
]
} |
[
{
"prob_id": "474f",
"tags": [
"Square-Root Decomposition, Segment Trees, Binary-Indexed Trees|Range Queries|Intermediate"
]
},
{
"prob_id": "741c",
"tags": [
"Bipartite Graph||"
]
},
{
"prob_id": "802n",
"tags": [
"Min Cost Max Flow (MCMF)|Flow and Min Cut|... | {
"prob_id": "118d",
"tags": [
"Counting with DP||Intermediate"
]
} | {
"prob_id": "474d",
"tags": [
"Counting with DP||Intermediate"
]
} |
[
{
"prob_id": "653f",
"tags": [
"Suffix Automaton|Advanced|String Processing",
"String Suffix||"
]
},
{
"prob_id": "223a",
"tags": [
"Balanced Brackets|Miscellaneous|Strings"
]
},
{
"prob_id": "380c",
"tags": [
"Square-Root Decomposition, Segment Trees,... | {
"prob_id": "118d",
"tags": [
"Counting with DP||Intermediate"
]
} | {
"prob_id": "149d",
"tags": [
"Counting with DP||Intermediate"
]
} |
[
{
"prob_id": "580c",
"tags": [
"Trees and Tree Traversals|Graphs|Basics"
]
},
{
"prob_id": "30e",
"tags": [
"Suffix Array|Suffix Structures|Strings"
]
},
{
"prob_id": "727e",
"tags": [
"String Hashing|Hashing|Strings"
]
}
] | {
"prob_id": "296b",
"tags": [
"Counting with DP||Intermediate",
"DP on Digits||Intermediate"
]
} | {
"prob_id": "9d",
"tags": [
"Counting with DP||Intermediate"
]
} |
[
{
"prob_id": "33b",
"tags": [
"Floyd Warshall|Shortest Paths|Graph Theory"
]
},
{
"prob_id": "1085e",
"tags": [
"Tree Centers and Diameter||Advanced Data Structures"
]
},
{
"prob_id": "898f",
"tags": [
"Hashing||Intermediate"
]
}
] | {
"prob_id": "9d",
"tags": [
"Counting with DP||Intermediate"
]
} | {
"prob_id": "296b",
"tags": [
"Counting with DP||Intermediate",
"DP on Digits||Intermediate"
]
} |
[
{
"prob_id": "535e",
"tags": [
"Convex Hull Trick|DP Optimization|Advanced Algorithms"
]
},
{
"prob_id": "827f",
"tags": [
"Dijkstra's Algorithm|Shortest Paths|Graph Theory"
]
},
{
"prob_id": "114b",
"tags": [
"All-Subsets / Binary Choice|Complete Search|Bas... | {
"prob_id": "148d",
"tags": [
"Markov Chains|Probability and Expectation|Intermediate"
]
} | {
"prob_id": "518d",
"tags": [
"Markov Chains|Probability and Expectation|Intermediate"
]
} |
[
{
"prob_id": "727e",
"tags": [
"String Hashing|Hashing|Strings"
]
},
{
"prob_id": "631c",
"tags": [
"Combining Data Structures|Data Structure Techniques|Intermediate"
]
},
{
"prob_id": "1572f",
"tags": [
"Segment Tree Beats|Segment Tree|Data Structures (DS)"... | {
"prob_id": "609e",
"tags": [
"Binary Lifting||Advanced Data Structures",
"Lowest Common Ancestor|Lowest common ancestor|Graphs"
]
} | {
"prob_id": "466e",
"tags": [
"Level Ancestors and Lowest Common Ancestors||Advanced Data Structures"
]
} |
[
{
"prob_id": "763d",
"tags": [
"Tree Isomorphism|Miscellaneous|Graph Theory"
]
},
{
"prob_id": "414b",
"tags": [
"Counting with DP||Intermediate"
]
},
{
"prob_id": "1081d",
"tags": [
"Minimum Spanning Tree||",
"Centroid Decomposition|Centroid Decomposi... | {
"prob_id": "383c",
"tags": [
"Tree Flattening||Advanced Data Structures"
]
} | {
"prob_id": "877e",
"tags": [
"Tree Flattening||Advanced Data Structures"
]
} |
[
{
"prob_id": "202a",
"tags": [
"All-Subsets / Binary Choice|Complete Search|Basics"
]
},
{
"prob_id": "380c",
"tags": [
"Square-Root Decomposition, Segment Trees, Binary-Indexed Trees|Range Queries|Intermediate"
]
},
{
"prob_id": "1016b",
"tags": [
"Prefix S... | {
"prob_id": "471d",
"tags": [
"Z algorithm|String Matching|Strings"
]
} | {
"prob_id": "432d",
"tags": [
"Z algorithm|String Matching|Strings"
]
} |
[
{
"prob_id": "547c",
"tags": [
"Principle of Inclusion-Exclusion|Counting|Intermediate",
"Möbius Inversion||Advanced Mathematics"
]
},
{
"prob_id": "650d",
"tags": [
"O(n lg n) Longest Monotonic Subsequence|DP Optimization|Advanced Algorithms"
]
},
{
"prob_id": ... | {
"prob_id": "432d",
"tags": [
"Z algorithm|String Matching|Strings"
]
} | {
"prob_id": "471d",
"tags": [
"Z algorithm|String Matching|Strings"
]
} |
[
{
"prob_id": "832d",
"tags": [
"Lowest Common Ancestor|Lowest common ancestor|Graphs"
]
},
{
"prob_id": "515c",
"tags": [
"Structural Argument|Greedy|Basics"
]
},
{
"prob_id": "232d",
"tags": [
"Suffix Array|Suffix Structures|Strings"
]
}
] | {
"prob_id": "835f",
"tags": [
"Tree Centers and Diameter||Advanced Data Structures"
]
} | {
"prob_id": "516d",
"tags": [
"Tree Centers and Diameter||Advanced Data Structures"
]
} |
[
{
"prob_id": "1394d",
"tags": [
"DP on Trees and DAGs|Dp on Different Structures|Dynamic Programming (DP)"
]
},
{
"prob_id": "330b",
"tags": [
"Basic Graph Theory|Graphs|Basics"
]
},
{
"prob_id": "456e",
"tags": [
"Tree Diameter|Graph Traversal|Graph Theory"... | {
"prob_id": "269c",
"tags": [
"Network Flows||Advanced Algorithms"
]
} | {
"prob_id": "1252l",
"tags": [
"Network Flows||Advanced Algorithms"
]
} |
[
{
"prob_id": "1249f",
"tags": [
"Combining Subtrees Technique|More Tricks|Dynamic Programming (DP)"
]
},
{
"prob_id": "1446a",
"tags": [
"Knapsack DP||"
]
},
{
"prob_id": "1000g",
"tags": [
"Lowest Common Ancestor|Lowest common ancestor|Graphs",
"Binar... | {
"prob_id": "1252l",
"tags": [
"Network Flows||Advanced Algorithms"
]
} | {
"prob_id": "1082g",
"tags": [
"Network Flows||Advanced Algorithms"
]
} |
[
{
"prob_id": "845e",
"tags": [
"Sweep Line||"
]
},
{
"prob_id": "780g",
"tags": [
"Sweep Line||"
]
},
{
"prob_id": "60b",
"tags": [
"Grid Graphs|Graphs|Basics"
]
}
] | {
"prob_id": "808f",
"tags": [
"Maximum Flow / Minimum Cut|Flow and Min Cut|Graph Theory"
]
} | {
"prob_id": "78e",
"tags": [
"Bipartite Matching|Network Flows|Advanced Algorithms"
]
} |
[
{
"prob_id": "817e",
"tags": [
"Trie on Strings and Bits|Trie|Data Structures (DS)"
]
},
{
"prob_id": "706c",
"tags": [
"Common Patterns|DP|Intermediate"
]
},
{
"prob_id": "4d",
"tags": [
"DP with Solution Construction||Intermediate"
]
}
] | {
"prob_id": "78e",
"tags": [
"Bipartite Matching|Network Flows|Advanced Algorithms"
]
} | {
"prob_id": "808f",
"tags": [
"Maximum Flow / Minimum Cut|Flow and Min Cut|Graph Theory"
]
} |
[
{
"prob_id": "13e",
"tags": [
"Square Root Decomposition||"
]
},
{
"prob_id": "505d",
"tags": [
"Strongly Connected Components (SCC)|Graph Connectivity|Graph Theory"
]
},
{
"prob_id": "101b",
"tags": [
"Sweep Line||",
"Knapsack DP||"
]
}
] | {
"prob_id": "818g",
"tags": [
"Min Cost Max Flow (MCMF)|Flow and Min Cut|Graph Theory"
]
} | {
"prob_id": "362e",
"tags": [
"Bipartite Matching|Network Flows|Advanced Algorithms"
]
} |
[
{
"prob_id": "280d",
"tags": [
"Min Cost Max Flow (MCMF)|Flow and Min Cut|Graph Theory"
]
},
{
"prob_id": "177d2",
"tags": [
"Prefix Sums and Difference Arrays|Range Queries|Basics"
]
},
{
"prob_id": "915g",
"tags": [
"Mobius Function and Mobius Inversion|Mu... | {
"prob_id": "191a",
"tags": [
"Flatten the Memo|DP Optimization|Advanced Algorithms"
]
} | {
"prob_id": "543a",
"tags": [
"Flatten the Memo|DP Optimization|Advanced Algorithms"
]
} |
[
{
"prob_id": "702c",
"tags": [
"Binary Search|Leveraging Monotonicity|Basics",
"Binary Search|Leveraging Monotonicity|Basics",
"Two Pointers|Leveraging Monotonicity|Basics"
]
},
{
"prob_id": "704d",
"tags": [
"Flow with Lower Bounds||"
]
},
{
"prob_id": "1... | {
"prob_id": "837d",
"tags": [
"Knapsack DP||"
]
} | {
"prob_id": "478d",
"tags": [
"Eliminate Dependent Parameters|DP Optimization|Advanced Algorithms",
"Flatten the Memo|DP Optimization|Advanced Algorithms"
]
} |
[
{
"prob_id": "617e",
"tags": [
"Mo's Algorithm|Square Root Decomposition|Data Structures (DS)"
]
},
{
"prob_id": "372d",
"tags": [
"Binary Lifting||Advanced Data Structures"
]
},
{
"prob_id": "280d",
"tags": [
"Min Cost Max Flow (MCMF)|Flow and Min Cut|Graph... | {
"prob_id": "478d",
"tags": [
"Eliminate Dependent Parameters|DP Optimization|Advanced Algorithms",
"Flatten the Memo|DP Optimization|Advanced Algorithms"
]
} | {
"prob_id": "837d",
"tags": [
"Knapsack DP||"
]
} |
[
{
"prob_id": "191c",
"tags": [
"Level Ancestors and Lowest Common Ancestors||Advanced Data Structures"
]
},
{
"prob_id": "226e",
"tags": [
"Persistent Segment Tree|Segment Tree|Data Structures (DS)"
]
},
{
"prob_id": "878c",
"tags": [
"Sorted Set||",
"... | {
"prob_id": "543a",
"tags": [
"Flatten the Memo|DP Optimization|Advanced Algorithms"
]
} | {
"prob_id": "191a",
"tags": [
"Flatten the Memo|DP Optimization|Advanced Algorithms"
]
} |
[
{
"prob_id": "214a",
"tags": [
"Iterative|Complete Search|Basics"
]
},
{
"prob_id": "610d",
"tags": [
"Sweep Line||"
]
},
{
"prob_id": "715c",
"tags": [
"Centroid Decomposition|Centroid Decomposition|Data Structures (DS)"
]
}
] | {
"prob_id": "837d",
"tags": [
"Knapsack DP||"
]
} | {
"prob_id": "213c",
"tags": [
"Eliminate Dependent Parameters|DP Optimization|Advanced Algorithms",
"Flatten the Memo|DP Optimization|Advanced Algorithms"
]
} |
[
{
"prob_id": "214a",
"tags": [
"Iterative|Complete Search|Basics"
]
},
{
"prob_id": "610d",
"tags": [
"Sweep Line||"
]
},
{
"prob_id": "715c",
"tags": [
"Centroid Decomposition|Centroid Decomposition|Data Structures (DS)"
]
}
] | {
"prob_id": "478d",
"tags": [
"Eliminate Dependent Parameters|DP Optimization|Advanced Algorithms",
"Flatten the Memo|DP Optimization|Advanced Algorithms"
]
} | {
"prob_id": "213c",
"tags": [
"Eliminate Dependent Parameters|DP Optimization|Advanced Algorithms",
"Flatten the Memo|DP Optimization|Advanced Algorithms"
]
} |
[
{
"prob_id": "204e",
"tags": [
"Suffix Array|Suffix Structures|Strings"
]
},
{
"prob_id": "706c",
"tags": [
"Common Patterns|DP|Intermediate"
]
},
{
"prob_id": "1012d",
"tags": [
"Tricky Implementation||Intermediate"
]
}
] | {
"prob_id": "268d",
"tags": [
"Eliminate Dependent Parameters|DP Optimization|Advanced Algorithms"
]
} | {
"prob_id": "17c",
"tags": [
"Eliminate Dependent Parameters|DP Optimization|Advanced Algorithms",
"Skip Useless States|DP Optimization|Advanced Algorithms"
]
} |
[
{
"prob_id": "15d",
"tags": [
"Level Ancestors and Lowest Common Ancestors||Advanced Data Structures"
]
},
{
"prob_id": "363b",
"tags": [
"Prefix Sum|Range Queries Without Updates|Basics"
]
},
{
"prob_id": "849b",
"tags": [
"Basics|Geometry|Basics"
]
}... | {
"prob_id": "17c",
"tags": [
"Eliminate Dependent Parameters|DP Optimization|Advanced Algorithms",
"Skip Useless States|DP Optimization|Advanced Algorithms"
]
} | {
"prob_id": "268d",
"tags": [
"Eliminate Dependent Parameters|DP Optimization|Advanced Algorithms"
]
} |
[
{
"prob_id": "204e",
"tags": [
"Suffix Array|Suffix Structures|Strings"
]
},
{
"prob_id": "706c",
"tags": [
"Common Patterns|DP|Intermediate"
]
},
{
"prob_id": "1012d",
"tags": [
"Tricky Implementation||Intermediate"
]
}
] | {
"prob_id": "729f",
"tags": [
"Skip Useless States|DP Optimization|Advanced Algorithms"
]
} | {
"prob_id": "17c",
"tags": [
"Eliminate Dependent Parameters|DP Optimization|Advanced Algorithms",
"Skip Useless States|DP Optimization|Advanced Algorithms"
]
} |
[
{
"prob_id": "621c",
"tags": [
"Basics|Probability and Expectation|Basics"
]
},
{
"prob_id": "794b",
"tags": [
"Basics|Geometry|Basics"
]
},
{
"prob_id": "623d",
"tags": [
"Probabilities and Expected Values|Probabilities and Expected Values|Math"
]
}
] | {
"prob_id": "314c",
"tags": [
"O(n lg n) Longest Monotonic Subsequence|DP Optimization|Advanced Algorithms"
]
} | {
"prob_id": "629d",
"tags": [
"O(n lg n) Longest Monotonic Subsequence|DP Optimization|Advanced Algorithms"
]
} |
[
{
"prob_id": "363b",
"tags": [
"Prefix Sum|Range Queries Without Updates|Basics"
]
},
{
"prob_id": "587e",
"tags": [
"Vector Space and XOR Basis|Linear Algebra|Math"
]
},
{
"prob_id": "338d",
"tags": [
"Chinese Remainder Theorem|Modular arithmetic|Algebra"
... | {
"prob_id": "76f",
"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": "576a",
"tags": [
"Prime Factorization|Number Theory|Basics"
]
},
{
"prob_id": "59e",
"tags": [
"Breadth First Search|Graph traversal|Graphs"
]
},
{
"prob_id": "653e",
"tags": [
"Breadth First Search|Graph traversal|Graphs"
]
}
] | {
"prob_id": "946g",
"tags": [
"O(n lg n) Longest Monotonic Subsequence|DP Optimization|Advanced Algorithms"
]
} | {
"prob_id": "650d",
"tags": [
"O(n lg n) Longest Monotonic Subsequence|DP Optimization|Advanced Algorithms"
]
} |
[
{
"prob_id": "722c",
"tags": [
"Disjoint Set Union||"
]
},
{
"prob_id": "446a",
"tags": [
"Classic Problems with Twists|DP|Intermediate"
]
},
{
"prob_id": "1476a",
"tags": [
"Basic Constructive Algorithms|Greedy and Constructive|Basics"
]
}
] | {
"prob_id": "76f",
"tags": [
"O(n lg n) Longest Monotonic Subsequence|DP Optimization|Advanced Algorithms"
]
} | {
"prob_id": "946g",
"tags": [
"O(n lg n) Longest Monotonic Subsequence|DP Optimization|Advanced Algorithms"
]
} |
[
{
"prob_id": "340c",
"tags": [
"Binomial Coefficients|Fundamentals|Combinatorics"
]
},
{
"prob_id": "1209h",
"tags": [
"Slope Trick|More Tricks|Dynamic Programming (DP)"
]
},
{
"prob_id": "704e",
"tags": [
"Heavy Light Decomposition (HLD) ft Subtrees and Pat... | {
"prob_id": "946g",
"tags": [
"O(n lg n) Longest Monotonic Subsequence|DP Optimization|Advanced Algorithms"
]
} | {
"prob_id": "76f",
"tags": [
"O(n lg n) Longest Monotonic Subsequence|DP Optimization|Advanced Algorithms"
]
} |
[
{
"prob_id": "833e",
"tags": [
"Sweep Line||"
]
},
{
"prob_id": "707b",
"tags": [
"Single Source|Shortest Paths|Intermediate"
]
},
{
"prob_id": "793a",
"tags": [
"Divisibility, Modular Arithmetic|Number Theory|Basics"
]
}
] | {
"prob_id": "487b",
"tags": [
"Knapsack DP||"
]
} | {
"prob_id": "833b",
"tags": [
"Divide and Conquer DP|DP optimizations|Dynamic Programming",
"Knapsack DP||"
]
} |
[
{
"prob_id": "1391e",
"tags": [
"DFS Tree|Graph Traversal|Graph Theory"
]
},
{
"prob_id": "1175b",
"tags": [
"Lists, Stacks, Queues|Basic Data Structures|Basics"
]
},
{
"prob_id": "1454e",
"tags": [
"Cycle Detection|Cycles|Graph Theory"
]
}
] | {
"prob_id": "18e",
"tags": [
"Knapsack DP||"
]
} | {
"prob_id": "909c",
"tags": [
"Knapsack DP||"
]
} |
[
{
"prob_id": "704e",
"tags": [
"Heavy Light Decomposition (HLD) ft Subtrees and Path Query|Heavy Light Decomposition (HLD)|Data Structures (DS)"
]
},
{
"prob_id": "150e",
"tags": [
"Centroid Decomposition|Centroid Decomposition|Data Structures (DS)"
]
},
{
"prob_id": ... | {
"prob_id": "900e",
"tags": [
"Knapsack DP||"
]
} | {
"prob_id": "372c",
"tags": [
"Knapsack DP||"
]
} |
[
{
"prob_id": "506d",
"tags": [
"Splitting Objects into Light and Heavy / Case Processing|Square Root Decomposition|Data Structures (DS)"
]
},
{
"prob_id": "468b",
"tags": [
"Disjoint Set Union||"
]
},
{
"prob_id": "243a",
"tags": [
"Bit Manipulation|Bit Mani... | {
"prob_id": "833b",
"tags": [
"Divide and Conquer DP|DP optimizations|Dynamic Programming",
"Knapsack DP||"
]
} | {
"prob_id": "487b",
"tags": [
"Knapsack DP||"
]
} |
[
{
"prob_id": "348c",
"tags": [
"Square-Root Discrimination||Intermediate"
]
},
{
"prob_id": "242e",
"tags": [
"Segment Tree with Lazy Propagation|Segment Tree|Data Structures (DS)"
]
},
{
"prob_id": "193b",
"tags": [
"Backtracking|Miscellaneous|Miscellaneous... | {
"prob_id": "909c",
"tags": [
"Knapsack DP||"
]
} | {
"prob_id": "264c",
"tags": [
"Knapsack DP||"
]
} |
[
{
"prob_id": "340c",
"tags": [
"Binomial Coefficients|Fundamentals|Combinatorics"
]
},
{
"prob_id": "362e",
"tags": [
"Bipartite Matching|Network Flows|Advanced Algorithms"
]
},
{
"prob_id": "567e",
"tags": [
"Dijkstra's Algorithm|Shortest Paths|Graph Theory... | {
"prob_id": "487b",
"tags": [
"Knapsack DP||"
]
} | {
"prob_id": "101b",
"tags": [
"Knapsack DP||",
"Sweep Line||"
]
} |
[
{
"prob_id": "843d",
"tags": [
"Dijkstra's Algorithm|Shortest Paths|Graph Theory"
]
},
{
"prob_id": "420d",
"tags": [
"Splay Trees and Treaps|Augmenting Data Structures|Advanced Data Structures"
]
},
{
"prob_id": "241c",
"tags": [
"Reflections on a Rectangle... | {
"prob_id": "909c",
"tags": [
"Knapsack DP||"
]
} | {
"prob_id": "38e",
"tags": [
"Knapsack DP||"
]
} |
[
{
"prob_id": "638c",
"tags": [
"Depth First Search|Graph traversal|Graphs"
]
},
{
"prob_id": "700c",
"tags": [
"Finding Bridges in O(N+M)|Connected components, bridges, articulations points|Graphs"
]
},
{
"prob_id": "427e",
"tags": [
"Ternary Search|Search T... | {
"prob_id": "900e",
"tags": [
"Knapsack DP||"
]
} | {
"prob_id": "115e",
"tags": [
"Knapsack DP||"
]
} |
[
{
"prob_id": "152c",
"tags": [
"Rule of Sum, Rule of Product|Counting|Basics"
]
},
{
"prob_id": "528d",
"tags": [
"Fast Fourier Transform (FFT)|Convolution|Math"
]
},
{
"prob_id": "305e",
"tags": [
"Nim, Sprague-Grundy Theorem|Combinatorial Games|Advanced Ma... | {
"prob_id": "115e",
"tags": [
"Knapsack DP||"
]
} | {
"prob_id": "900e",
"tags": [
"Knapsack DP||"
]
} |
[
{
"prob_id": "707b",
"tags": [
"Single Source|Shortest Paths|Intermediate"
]
},
{
"prob_id": "241c",
"tags": [
"Reflections on a Rectangle|Miscellaneous|Geometry"
]
},
{
"prob_id": "832d",
"tags": [
"Lowest Common Ancestor|Lowest common ancestor|Graphs"
... | {
"prob_id": "115e",
"tags": [
"Knapsack DP||"
]
} | {
"prob_id": "797f",
"tags": [
"Knapsack DP||"
]
} |
[
{
"prob_id": "732f",
"tags": [
"Biconnectivity|DFS Lowlink|Advanced Algorithms"
]
},
{
"prob_id": "786c",
"tags": [
"Sqrt Decomposition|Trees|Data Structures"
]
},
{
"prob_id": "25d",
"tags": [
"Disjoint Set Union||"
]
}
] | {
"prob_id": "909c",
"tags": [
"Knapsack DP||"
]
} | {
"prob_id": "18e",
"tags": [
"Knapsack DP||"
]
} |
[
{
"prob_id": "715c",
"tags": [
"Centroid Decomposition|Centroid Decomposition|Data Structures (DS)"
]
},
{
"prob_id": "621c",
"tags": [
"Basics|Probability and Expectation|Basics"
]
},
{
"prob_id": "269c",
"tags": [
"Network Flows||Advanced Algorithms"
]... | {
"prob_id": "852b",
"tags": [
"Matrix Exponentiation|Matrices|Math"
]
} | {
"prob_id": "621e",
"tags": [
"Matrix Exponentiation|Matrices|Math"
]
} |
[
{
"prob_id": "505d",
"tags": [
"Strongly Connected Components (SCC)|Graph Connectivity|Graph Theory"
]
},
{
"prob_id": "330b",
"tags": [
"Basic Graph Theory|Graphs|Basics"
]
},
{
"prob_id": "587c",
"tags": [
"Level Ancestors and Lowest Common Ancestors||Adva... | {
"prob_id": "621e",
"tags": [
"Matrix Exponentiation|Matrices|Math"
]
} | {
"prob_id": "852b",
"tags": [
"Matrix Exponentiation|Matrices|Math"
]
} |
[
{
"prob_id": "241e",
"tags": [
"Single Source with Negative Weights|Shortest Paths|Intermediate"
]
},
{
"prob_id": "330b",
"tags": [
"Basic Graph Theory|Graphs|Basics"
]
},
{
"prob_id": "505d",
"tags": [
"Strongly Connected Components (SCC)|Graph Connectivit... | {
"prob_id": "696d",
"tags": [
"Aho-Corasick|String Structures|Advanced Data Structures",
"Matrix Exponentiation|Matrices|Math"
]
} | {
"prob_id": "576d",
"tags": [
"Matrix Exponentiation|Matrices|Math"
]
} |
[
{
"prob_id": "706c",
"tags": [
"Common Patterns|DP|Intermediate"
]
},
{
"prob_id": "704d",
"tags": [
"Flow with Lower Bounds||"
]
},
{
"prob_id": "33b",
"tags": [
"Floyd Warshall|Shortest Paths|Graph Theory"
]
}
] | {
"prob_id": "576d",
"tags": [
"Matrix Exponentiation|Matrices|Math"
]
} | {
"prob_id": "696d",
"tags": [
"Aho-Corasick|String Structures|Advanced Data Structures",
"Matrix Exponentiation|Matrices|Math"
]
} |
[
{
"prob_id": "351d",
"tags": [
"Mo's Algorithm|Square Root Decomposition|Data Structures (DS)"
]
},
{
"prob_id": "414b",
"tags": [
"Counting with DP||Intermediate"
]
},
{
"prob_id": "177d2",
"tags": [
"Prefix Sums and Difference Arrays|Range Queries|Basics"
... | {
"prob_id": "576d",
"tags": [
"Matrix Exponentiation|Matrices|Math"
]
} | {
"prob_id": "351c",
"tags": [
"Matrix Exponentiation|Matrices|Math"
]
} |
[
{
"prob_id": "1110e",
"tags": [
"Invariants and Monovariants|Techniques|Miscellaneous"
]
},
{
"prob_id": "1446a",
"tags": [
"Knapsack DP||"
]
},
{
"prob_id": "689b",
"tags": [
"Breadth First Search|Graph traversal|Graphs"
]
}
] | {
"prob_id": "576d",
"tags": [
"Matrix Exponentiation|Matrices|Math"
]
} | {
"prob_id": "917c",
"tags": [
"Matrix Exponentiation|Matrices|Math"
]
} |
[
{
"prob_id": "348a",
"tags": [
"Binary Search|Leveraging Monotonicity|Basics"
]
},
{
"prob_id": "653d",
"tags": [
"Network Flows||Advanced Algorithms"
]
},
{
"prob_id": "243a",
"tags": [
"Bit Manipulation|Bit Manipulation|Basics"
]
}
] | {
"prob_id": "643c",
"tags": [
"Convex Hull Trick|DP Optimization|Advanced Algorithms",
"Divide and Conquer DP|DP optimizations|Dynamic Programming"
]
} | {
"prob_id": "319c",
"tags": [
"Convex Hull Trick|DP Optimization|Advanced Algorithms"
]
} |
[
{
"prob_id": "1084c",
"tags": [
"Rule of Sum, Rule of Product|Counting|Basics"
]
},
{
"prob_id": "1176e",
"tags": [
"Bipartite Graph||",
"Graph Traversal||"
]
},
{
"prob_id": "1242b",
"tags": [
"Inverse Graph|Graph Traversal|Graph Theory"
]
}
] | {
"prob_id": "319c",
"tags": [
"Convex Hull Trick|DP Optimization|Advanced Algorithms"
]
} | {
"prob_id": "1083e",
"tags": [
"Convex Hull Trick|DP Optimization|Advanced Algorithms"
]
} |
[
{
"prob_id": "506d",
"tags": [
"Splitting Objects into Light and Heavy / Case Processing|Square Root Decomposition|Data Structures (DS)"
]
},
{
"prob_id": "177d2",
"tags": [
"Prefix Sums and Difference Arrays|Range Queries|Basics"
]
},
{
"prob_id": "653e",
"tags":... | {
"prob_id": "631e",
"tags": [
"Convex Hull Trick|DP Optimization|Advanced Algorithms"
]
} | {
"prob_id": "932f",
"tags": [
"Convex Hull Trick|DP Optimization|Advanced Algorithms"
]
} |
[
{
"prob_id": "776f",
"tags": [
"Centroid Decomposition|Centroid Decomposition|Data Structures (DS)"
]
},
{
"prob_id": "623d",
"tags": [
"Probabilities and Expected Values|Probabilities and Expected Values|Math"
]
},
{
"prob_id": "839e",
"tags": [
"Meet in th... | {
"prob_id": "319c",
"tags": [
"Convex Hull Trick|DP Optimization|Advanced Algorithms"
]
} | {
"prob_id": "643c",
"tags": [
"Convex Hull Trick|DP Optimization|Advanced Algorithms",
"Divide and Conquer DP|DP optimizations|Dynamic Programming"
]
} |
[
{
"prob_id": "1016c",
"tags": [
"Prefix Sums and Difference Arrays|Range Queries|Basics"
]
},
{
"prob_id": "417d",
"tags": [
"DP on Subsets||Intermediate"
]
},
{
"prob_id": "1500b",
"tags": [
"Chinese Remainder Theorem|Modular arithmetic|Algebra"
]
}
] | {
"prob_id": "631e",
"tags": [
"Convex Hull Trick|DP Optimization|Advanced Algorithms"
]
} | {
"prob_id": "377e",
"tags": [
"Convex Hull Trick|DP Optimization|Advanced Algorithms"
]
} |
[
{
"prob_id": "715b",
"tags": [
"Dijkstra's Algorithm|Shortest Paths|Graph Theory"
]
},
{
"prob_id": "431c",
"tags": [
"Counting with DP||Intermediate"
]
},
{
"prob_id": "1242b",
"tags": [
"Inverse Graph|Graph Traversal|Graph Theory"
]
}
] | {
"prob_id": "848e",
"tags": [
"Fast Fourier Transform (FFT)|Convolution|Math"
]
} | {
"prob_id": "438e",
"tags": [
"Fast Fourier Transform (FFT)|Convolution|Math",
"Generating Functions|Polynomial|Math"
]
} |
[
{
"prob_id": "821e",
"tags": [
"Matrix Exponentiation|Matrices|Math"
]
},
{
"prob_id": "567e",
"tags": [
"Dijkstra's Algorithm|Shortest Paths|Graph Theory"
]
},
{
"prob_id": "832d",
"tags": [
"Lowest Common Ancestor|Lowest common ancestor|Graphs"
]
}
] | {
"prob_id": "623e",
"tags": [
"Fast Fourier Transform (FFT)|Convolution|Math"
]
} | {
"prob_id": "553e",
"tags": [
"Fast Fourier Transform (FFT)|Convolution|Math"
]
} |
[
{
"prob_id": "414b",
"tags": [
"Counting with DP||Intermediate"
]
},
{
"prob_id": "500b",
"tags": [
"Depth-First Traversal, Connectivity, Cycle Detection|Graphs|Basics"
]
},
{
"prob_id": "272d",
"tags": [
"Permutations with Repetition, Stars and Bars|Countin... | {
"prob_id": "848e",
"tags": [
"Fast Fourier Transform (FFT)|Convolution|Math"
]
} | {
"prob_id": "623e",
"tags": [
"Fast Fourier Transform (FFT)|Convolution|Math"
]
} |
[
{
"prob_id": "844b",
"tags": [
"Rule of Sum, Rule of Product|Counting|Basics"
]
},
{
"prob_id": "1063b",
"tags": [
"0/1 BFS|Shortest Paths|Graph Theory"
]
},
{
"prob_id": "243e",
"tags": [
"PQ Tree|More Tree Data Structures|Data Structures (DS)"
]
}
] | {
"prob_id": "850e",
"tags": [
"Fast Walsh Hadamard Transform (FWHT) and its Variations|Convolution|Math"
]
} | {
"prob_id": "662c",
"tags": [
"DP on Subsets||Intermediate",
"Fast Walsh Hadamard Transform (FWHT) and its Variations|Convolution|Math"
]
} |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.