| # | User | Rating |
|---|---|---|
| 1 | tourist | 4009 |
| 2 | jiangly | 3823 |
| 3 | Benq | 3738 |
| 4 | Radewoosh | 3633 |
| 5 | jqdai0815 | 3620 |
| 6 | orzdevinwang | 3529 |
| 7 | ecnerwala | 3446 |
| 8 | Um_nik | 3396 |
| 9 | ksun48 | 3390 |
| 10 | gamegame | 3386 |
| # | User | Contrib. |
|---|---|---|
| 1 | cry | 166 |
| 2 | maomao90 | 163 |
| 2 | Um_nik | 163 |
| 4 | atcoder_official | 161 |
| 5 | adamant | 160 |
| 6 | -is-this-fft- | 158 |
| 7 | awoo | 157 |
| 8 | TheScrasse | 154 |
| 9 | nor | 153 |
| 9 | Dominater069 | 153 |
Hi Codeforces Community,
I have created a video where I will be covering over the basics of bitmasking and how to generate all subsets of a given set using bitmasking. In addition, I also cover a clever trick to iterate over all subsets of a given subset, also known as submask enumeration.
If you are not familiar with bitmasking and/or submask enumeration, I hope this video will help you understand them.
Happy coding!
Hi, I have made a video in which I will be discussing on how to find the lowest common ancestor (lca) of 2 nodes in O(logn) time using a technique known as binary lifting. It is very useful in competitive programming and one must definitely know this technique. (eg : it becomes very easy to calculate the distance between two nodes in a tree)
Happy coding!
Hi, Manacher's algorithm is used to find the longest palindromic substring in linear time. Its a fairly complex algorithm and understanding its time complexity is the hardest part. So, I have made a video on Manacher's algorithm to help you understand it to the fullest.
Practice problems :
Happy coding!
Hi, I have made a Video Solution to the problem BUNDLING of Google kickstart 2020 round A contest. If you do not know the solution, hopefully my video will help you out.
All the best for the next round!
Hi codeforces community,
I have made a video on Trie Data Structure on my Youtube Channel. If you are new to this data structure, I hope this video helps you out. — Trie Data Stucture
If you found the videos helpful please do leave a LIKE on it!
Hi codeforces community,
Personally, I have found it difficult to understand the intuition/logic behind KMP string algorithm. So, I have made a 2 part video on my new Youtube Channel (dedicated towards competitive programming) where I explain Prefix Function and KMP algorithm. Prefix function is the concept behind KMP algorithm and for those who are having a tough time understanding it (or if you are new to this algo), I hope my video will help you out.
If you found the videos helpful please do leave a LIKE on it!
