Velikost videa: 1280 X 720853 X 480640 X 360
Zobrazit ovladače přehrávání
Automatické přehrávání
Přehrát
can be solved using 2d DP ... long dp[][] = new long[n+1][11]; and if(dp[n][key[i][j]] != 0) return dp[n][key[i][j]];
key is a matrix ?
@@aizad786iqbal yes, I stored keypad structure in matrix... like from number 0 to 9 and and use that... int key[][] = { {1,2,3}, {4,5,6}, {7,8,9}, {-1,0,-1} };
not working
bhai initial thought process kaise develop kre like approach ka logic
Practice kroge or alag alag type ke question solve kroge to ho jayega
hello sir aap alag se potd ke sath sath binary search hashmap stack tree in sab ka bhi video bna do
Hn thinking same will try to upload in some time
bhai araam se clear bola kroo
Sure
can be solved using 2d DP ... long dp[][] = new long[n+1][11]; and if(dp[n][key[i][j]] != 0) return dp[n][key[i][j]];
key is a matrix ?
@@aizad786iqbal yes, I stored keypad structure in matrix... like from number 0 to 9 and and use that...
int key[][] = {
{1,2,3},
{4,5,6},
{7,8,9},
{-1,0,-1}
};
not working
bhai initial thought process kaise develop kre like approach ka logic
Practice kroge or alag alag type ke question solve kroge to ho jayega
hello sir aap alag se potd ke sath sath binary search hashmap stack tree in sab ka bhi video bna do
Hn thinking same will try to upload in some time
bhai araam se clear bola kroo
Sure