Leetcode biweekly contest 112 | Count K-Subsequences of a String With Maximum Beauty | Hindi Explain

Leetcode biweekly contest 112 | Count K-Subsequences of a String With Maximum Beauty | Hindi Explain Problem :- leetcode.com/problems/count-k-subsequences-of-a-st… Code :- leetcode.com/problems/count-k-subsequences-of-a-st… nCr % mod using fermat theorem :- www.geeksforgeeks.org/compute-ncrp-using-fermat-li… #leetcode #leetcodecontest #leetcodedailychallenge #leetcodesolution #leetcodehard #lcbiweekly112 #biweekly112 #codeforces #codechef #leetcodequestionandanswers #coding codi