third question ko same LIS type se solve kr sakte hai just change checking condition, (arr[i]+arr[j])%k varies from 0 to k-1, so we can make any sequence with remainder 0 or 1 or 2 or upto k-1, and take max sequence among all, int dp[][] = new int[n][k]; // where dp[i][rem] is sequence that ends at i and satisfy (seq[i]+seq[i+1])%k==rem for(int row[]:dp){ Arrays.fill(row,1); } int maxi = 1; for(int i=1;i
3rd question same to same google ke ek prev OA me aaya hai aur mene kar rakha tha lekin contest nhi de paya aur discussion bhi attend nhi kar paya abhi dekha to yaad aaya
bhaiya the way you teach with so much of energy and your jokes during the session, resources that you share in between , the way to think about the approach is just awesome
![[#2024MAMA] G-DRAGON - 무제(Untitled, 2014)+POWER+HOME SWEET HOME+뱅뱅뱅+FANTASTIC BABY | Mnet 241123 방송](http://i.ytimg.com/vi/Ox29z5Nf1Uk/mqdefault.jpg)
pls make videos on codeforces contests..
third question ko same LIS type se solve kr sakte hai just change checking condition, (arr[i]+arr[j])%k varies from 0 to k-1, so we can make any sequence with remainder 0 or 1 or 2 or upto k-1, and take max sequence among all,
int dp[][] = new int[n][k]; // where dp[i][rem] is sequence that ends at i and satisfy (seq[i]+seq[i+1])%k==rem
for(int row[]:dp){
Arrays.fill(row,1);
}
int maxi = 1;
for(int i=1;i
3rd question same to same google ke ek prev OA me aaya hai aur mene kar rakha tha lekin contest nhi de paya aur discussion bhi attend nhi kar paya abhi dekha to yaad aaya
bhaiya the way you teach with so much of energy and your jokes during the session, resources that you share in between , the way to think about the approach is just awesome
Where can we find your codes for this contest?
please made video available in atleast hd
bhaiya codeforces ka bhi kiya kijiye
1:23:00
kisi ko pta hai kya ki ye topics striver ne A2Z sheet mein kyon nhi karae?
Nice Stream Man
Keep it Up
Bhaiya segment tree kyu hata diya 😢
1080p pls
Bhaiya codeforces please
Support ++