Count digit groupings of a number | Recursion | Memoization | GFG POTD
68Whatsapp Community Link : https://www.whatsapp.com/channel/0029Va6kVSjICVfiVdsHgi1A
This is the 84th Video of our Playlist "Dynamic Programming : Popular Interview Problems".
In this video we will try to solve two very good DP problem on string : Count digit groupings of a number | GFG POTD
I will explain the intuition so easily that you will never forget and start seeing this as cakewalk EASYYY.
We will do live coding after explanation and see if we are able to pass all the test cases.
Also, please note that my Github solution link below contains both C++ as well as JAVA code.
Problem Name : Count digit groupings of a number | GFG POTD
Company Tags : will update soon
My solutions on Github(C++ & JAVA) : https://github.com/MAZHARMIK/Interview_DS_Algo/blob/master/DP/Count%20digit%20groupings%20of%20a%20number.cpp
GFG Link : https://www.geeksforgeeks.org/problems/count-digit-groupings-of-a-number1520/1
My DP Concepts Playlist : https://youtu.be/7eLMOE1jnls
My Graph Concepts Playlist : https://youtu.be/5JGiZnr6B5w
My GitHub Repo for interview preparation : https://github.com/MAZHARMIK/Interview_DS_Algo
Subscribe to my channel : https://www.youtube.com/@codestorywithMIK
Instagram : https://www.instagram.com/codestorywithmik/
Facebook : https://www.facebook.com/people/codestorywithmik/100090524295846/
Twitter : https://twitter.com/CSwithMIK
Approach Summary : The approach uses dynamic programming with memoization. The class has a private integer n to store the length of the input string and a 2D array t to memoize the results of subproblems. The solve function is a recursive helper function that calculates the total count based on the specified conditions. It iterates through the string, updating the current sum and checking if it satisfies the condition for inclusion in the subarray. The result is accumulated recursively for each valid subarray. The TotalCount function initializes the length n and the memoization array t, and then calls the solve function with initial parameters. The result is the total count of subarrays meeting the specified criteria.
╔═╦╗╔╦╗╔═╦═╦╦╦╦╗╔═╗
║╚╣║║║╚╣╚╣╔╣╔╣║╚╣═╣
╠╗║╚╝║║╠╗║╚╣║║║║║═╣
╚═╩══╩═╩═╩═╩╝╚╩═╩═╝
✨ Timelines✨
00:00 - Introduction
00:29 - Problem explanation
3:30 - Tree Diagram Intuition
14:10 - Tree Diagram to Code
23:27 - Live Coding
#coding #helpajobseeker #easyrecipes #leetcode #leetcodequestionandanswers #leetcodesolution #leetcodedailychallenge #leetcodequestions #leetcodechallenge #hindi #india #coding #helpajobseeker #easyrecipes #leetcode #leetcodequestionandanswers #leetcodesolution #leetcodedailychallenge#leetcodequestions #leetcodechallenge #hindi #india #hindiexplanation #hindiexplained #easyexplaination #interview#interviewtips #interviewpreparation #interview_ds_algo #hinglish #github #design #data #google #video #instagram #facebook #leetcode #computerscience #leetcodesolutions #leetcodequestionandanswers #code #learning #dsalgo #dsa #2024 #newyear