| # | User | Rating |
|---|---|---|
| 1 | Benq | 3792 |
| 2 | VivaciousAubergine | 3647 |
| 3 | Kevin114514 | 3603 |
| 4 | jiangly | 3583 |
| 5 | turmax | 3559 |
| 6 | tourist | 3541 |
| 7 | strapple | 3515 |
| 8 | ksun48 | 3461 |
| 9 | dXqwq | 3436 |
| 10 | Otomachi_Una | 3413 |
| # | User | Contrib. |
|---|---|---|
| 1 | Qingyu | 157 |
| 2 | adamant | 153 |
| 3 | Um_nik | 147 |
| 4 | Proof_by_QED | 146 |
| 5 | Dominater069 | 145 |
| 6 | errorgorn | 141 |
| 7 | cry | 139 |
| 8 | YuukiS | 135 |
| 9 | TheScrasse | 134 |
| 10 | chromate00 | 133 |
Given $$$n$$$ and $$$k$$$, Maximize $$$(a_1 + a_2 + \dots + a_k)$$$ such that $$$a_1 \oplus a_2 \oplus \dots \oplus a_k = n$$$ and $$$0 \leq a_i \leq n$$$.
I created a video discussing the concept of Tight in Bit manipulation and how to apply it to this problem
Partition an array into $$$\geq K$$$ blocks, where each each block has $$$\geq L$$$ elements. Across all such partitions, find the maximum value of the $$$K^{th}$$$ smallest block sum.
I created a video discussing the ideas used to solve this problem. Practice Problem
Given an array, you are allowed to select a subarray of size at least $$$k$$$ and delete the $$$k^{th}$$$ smallest element. Can you make the array a palindrome after doing the operation any number of times? Practice Problem
I created a video talking about the ideas used in this problem.
I created a video on an interesting problem involving maps, 2 pointer and combinatorics, based on E. Monotonic Renumeration
How many subarrays can be rearranged to form a permutation? I created a video on this classic Codeforces problem F. The Number of Subpermutations
Video Link https://youtu.be/FI__C9WjtvE
I created a video on how to optimize Dynamic Programming problems by using 2 pointers, set, stack, binary search and segment tree. This is based on problem D. Blocking Elements
Video Link: https://youtu.be/f-_1lJo3H_M
Given an array, split it into $$$k$$$ disjoint consecutive blocks such that the value of $$$\sum a[i] \cdot blockIndex[i]$$$ is maximized.
I created a video discussing why the greedy strategy for this problem is not obvious. Here is the practice problem
I created a video on Greedy algorithms, Combinatorics and Euclid's Divison Lemma. It discusses problem D. Christmas Tree Decoration
Video Link https://youtu.be/b43Bf1syIe4
Given a permutation, compute the unique MEX across all subarrays. Then, reverse the problem, given a binary string where a $$$1$$$ at index $$$i$$$ means that a subarray with MEX $$$i$$$ exists (and $$$0$$$ means it doesn't), compute the number of permutations that satisfy these constraints.
I created a video discussing the ideas to solve both the problem in $$$O(N)$$$. Practice Problem
I created a video discussing DP on Trees, Expected Value and Greedy strategies to solve E. Coloring a Red Black Tree from last Codeforces Div2 round.
Video Link: https://youtu.be/EAODhN-zthA
Given an array, compute the prefix maxima array and remove all the duplicates. How many subsequences of the original array can you create such that the prefix maxima of the subsequence is equal to the prefix maxima of the original array (after removing the duplicates from both)?
I created a video to solve this problem in $$$O(N \cdot Log(N))$$$.
I created a video brainstorming problem C. Interval Mod from today's Codeforces Div2 round. It discusses some ideas that you can apply on problems that involve operations on a subarray.
Video Link: https://youtu.be/nZ5U43GGlyc
I created a video that talks about some bit manipulation tricks, and how to apply horner's trick to binary search the starting element that produces a geometric series sum. This is also the editorial for D. RReeppeettiittiioonn from today's Codeforces round.
Everyone knows the classical Dynamic Programming problem of finding the max profit path in a grid. But can you quickly find out the maximum profit when I change an arbitrary cell's value? I discuss an anti diagonal trick that can be used to solve such problems. This idea appeared in a recent Div 2 contest, E. The Turtle Strikes Back
I created a video talking about Dynamic Programming on Trees in context of problem H. Closer from last Div2 round. It also talks about why iterating over all the grandchildren is actually $$$O(N^2)$$$ instead of $$$O(N^3)$$$.
Video Link: https://youtu.be/9opfwMW0wWw
Problem G. Down the Pivot had an interesting subproblem, given a tree where nodes contain 0 or 1, in one operation, you are allowed to select one downward path and flip it. What is the minimum number of operations required to set all nodes to 0?
So I created a video discussing 3 techniques:
In continuation of my last video, where we talked about a problem that transitioned from Game theory to Bitmask DP, I uploaded a video that talks about the transition from bitmask to Combinatorics (which is essentially the hard version of the previous problem).
Video https://youtu.be/O-zszo57B54
Practice Problem: E2. Prime Gaming (Hard Version)
I created a video on a game theory problem that can be solved via Bitmask DP and Minimax DP.
Video Link : https://youtu.be/tSJgBJkfT94
Practice Problem: Easy Version and Hard Version
Given a grid with $$$R \leq 10^5$$$ rows and $$$C \leq 10^5$$$ columns, there are $$$Q \leq 10^3$$$ obstacles on the grid. You need to find the number of path from $$$(1, 1)$$$ to $$$(R, C)$$$ that do not go through any obstacle.
I created a video on this classical problem https://youtu.be/i74DlMrPuQk
Problem F. Interval Game from today's Codeforces Div2 round required the simplication of a complex game down to a Nim game, so I created a video talking about how to identify hidden Nim heaps in this problem.
I created a video on a famous Leetcode problem that reappeared in a recent Codeforces round. The Discuss section of the Leetcode problem has only DP based approach, but the Codeforces comment section has other interpretations as well, so I decided to create a video around it).
Practice Problem : Non-Descending Arrays
I created a video on 3 different techniques to count distinct subsequences of a string.
Video https://youtu.be/DZ8sVn4W6IQ
Practice Problem H. Subsequences (hard version)
I created a video on Cartesian trees in the context of the problem D. Simons and Beating Peaks from a recent Codeforces round.
Alice and Bob are playing a game with a fixed array and a dynamic array. In one round, Alice can remove an element $$$y$$$ from the dynamic array if $$$y \% fixed[i] = 0$$$ for some $$$i$$$. And Bob can remove this element if $$$y \% fixed[i] \neq 0$$$. The first player to run out of moves loses. Find out who the winner is.
I created a video on this interesting problem that intersects with game theory and number theory.
Find how many string pairs are there in array such that at least one permutation of their concatentation is a palindrome.
I created a video discussing the technique to solve this in $$$O(N \cdot Log(N))$$$.
