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.

• Video link -> https://youtu.be/Z3RfT93-vlI

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)

• Video Link

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.

• video link

Practice problems :

• Easy : https://www.codechef.com/problems/PALIN3
• Hard : https://mirror.codeforces.com/contest/1080/problem/E

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.

• Problem Statement
• Video Solution
• Code
• Video for TRIE (the solution uses trie and in case you are new to it)

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.

• Part 1 : Prefix Function
• Part 2 : KMP Algorithm

If you found the videos helpful please do leave a LIKE on it!