Beautiful Ideas to learn! LIVE Leetcode Weekly 404 | All Problems solved
Вставка
- Опубліковано 29 чер 2024
- 🔴 I am teaching in new cohort of AlgoZenith is starting from 8th June: bit.ly/3SKoM7S
Contest link :
leetcode.com/contest/weekly-c...
-------------------------------------------------------------------------------------------------------------
If you are a beginner, here are some resources to start with :
✅ Free Language course with certificate that i taught - bit.ly/3I52EAb
✅ More free courses - bit.ly/3SKoCNO
If you are looking to train in a commado like regime for acing DSA (with DEV and System Design covered for placement too), do checkout :
🔴 bit.ly/3SKoM7S
If you want to connect over social media or want more resources : linktr.ee/vivek_gupta
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
please made video available in atleast hd
Nice Stream Man
Keep it Up
bhaiya codeforces ka bhi kiya kijiye
Where can we find your codes for this contest?
1080p pls
1:23:00
kisi ko pta hai kya ki ye topics striver ne A2Z sheet mein kyon nhi karae?
Bhaiya segment tree kyu hata diya 😢
Support ++
Bhaiya codeforces please