Backtracking : Generating all possible k-ary strings of length n.

Hi All!
Came up with an idea last week that Making Youtube videos will be a good way to keep myself motivated towards coding and other stuffs. Hence, I started learning , coding and uploading videos at the same time.
Enjoying the process and would need your help too.
Please do visit my channel and do the needful.
#Subscribe.
I will make videos on problem from all topics encountered in the way!

[gautamjangir]

Best explanation in the entire youtube....Thanks Bhaiya.

[ArnabJhaYT]

Thank you, sir. I understood it very clearly.

[aptu]

T(n)=
{
c; if(n<0)
kT(n-1) + d ; otherwise
}
Using Subtraction and Conquer Master theorem we get: T(n) = O(k^ n)

[Selim_Hasan_Raj]

Could you please make more videos on "Backtracking"?

[HustlerMohit]

Bro are you preparing for upsc ? Your programming skills are good.