9 April || Special Digits || POTD || GFG - Problem Of The Day || C++ || JAVA || Python
Hey Guys !! In this video, I've explained GFG POTD "Special Digits". This is really interesting problem based on mathematics. Pre-requisite is the understanding of Permutations and combinations.
So do watch the full video and hit like if you like the video.
Recommended watch speed is: 1.25x - 1.5x
[Note:- at 12:36 the formula will be : N! / (cA! * cB!); where cA and cB is the count of A and B respectively. ]
POTD LINK: https://practice.geeksforgeeks.org/pr...
CODE LINK: https://github.com/BugsInCodeYT/Probl...
Here are the Timestamps:
0:00 Understanding the Problem Statement
02:20 Solution: Intuition and Approach
07:36 Pseudo Code
11:18 Numbers with given sum and number of digits.
14:30 Preprocessing Factorials
18:56 Modulo Inverse
24:30 Code Explanation( C++, Java and Python)
Happy Coding !!
Hashtags:
#geeksforgeeks #gfgpractice #problemoftheday #potd #problemoftheday #gfgpotd #gfg #coding #leetcode #dsa