thank you very much for these valuable tips.

thank you sir

I am starting from next month, I am in 3rd year I am using your roadmap The further journey is quite fascinating 😊

the approach in last que is not making much sense , why can't we take 3 scenarios dp[i][0] when last row had 2 growing blocks, 1 when last row had single growing block and 2 when both are not growing, for dp[i][0]: first possiblity mentioned was to close both blocks , then then we are saying the pos11 is bo th blocks are growing aren't these contradictory?

3:47 I think a good way to revise an algorithm would be to look for and solve the "Similar Questions" section in leetcode.

i don't what's the problem with me , i solve 2 problem , whether it's div4 , div3 , div2 , div1+div2

sir, what about c language?

hello bhaiya, could you also share the approach for nested ranges check, if there is one that runs in O(n)? and could you also please discuss josepheus problem 1/2

Very helpful analysis for begginers like me in codeforces.. Thank you very much Priyansh.

and im a kid so

i am stuck at 50

Is he speaking English the whole time of the video or is he switching languages? I'm not trying to be offensive here, I'm not a native English speaker myself.

Solving more problems ❌ Solving unnecessary problems✅

whatever you do is worth more then anything bro

A lot of people make guides to get to expert rating but i never see any roadmap for the progression of expert to candidate master. Would help if u made one specifically for expert to cm

Angrez angrez angrez.. Maleecha!

4th year student i know im late but will start doing it from today daily 2 question from it for next 5-6 months consistently will come back here and upload my progress! thnx for a structured learning path...

So I was thinking of taking your TLE course, what I noticed is the curriculum includes c++ I know java and not c++ so can i still take on your course in java

Who all wants CP- 31 sheet for rating 1700,1800,1900?

zomato doesn t deserve you

In Minimizing Coins problem, Recursive dp is giving tle, only iterative dp works there.

Literally me after solving 3rd one😅

this approach in coin combinations 2 is giving rte constraints are high

💛

Why don't you include your sources, i.e., TLE Eliminators for DP? That's the best place from where I have learnt DP.

2 Key takeaways: a. Get away from all distractions. b. Take it as a fun.

Main problem is to understand the question😢. Any tips on this?

Bhai sabke pass itna paisa nahi hota kuch garib bhi hote hai , 500 rupees ki majdoori karke Itna mahga course kaise le paunga mai .

Has anyone taken their TLE Eliminator Course, and how was their experience with it? Actually, I'm confused because I already made the payment, but I haven't received any updates yet, even though their course was supposed to start on the 7th. ? can anyone help me to get out of this ?

sad for throwing only one like

i am going to start cp

Thank you Priyansh Agarwal, i'm from Brazil and i'm very thankful for this video!

What is the theme used in sublime?

Can i start in cses as a beginner? Right now I am practising in beecrowd. Need some guidance Plz

how can i buy courses

Where to look editorials for competition

perfect explanation

My solution for 64. Minimum Path Sum class Solution { public: int solve(int i, int j, vector<vector<int>> &grid, int n, int m, vector<vector<int>> &dp){ if(i >=n || j >=m){ return INT_MAX; } if(i == n-1 && j == m-1){ return grid[n-1][m-1]; } return dp[i][j] = grid[i][j] + min( (dp[i][j+1] == -1 ? solve(i, j+1, grid, n, m, dp) : dp[i][j+1]), (dp[i+1][j] == -1 ? solve(i+1, j, grid, n, m, dp) : dp[i+1][j])); } int minPathSum(vector<vector<int>>& grid) { int n = grid.size(); int m = grid[0].size(); vector<vector<int>> dp(n+1, vector<int>(m+1,-1)); solve(0,0, grid, n,m, dp); return dp[0][0] == -1 ? grid[0][0] : dp[0][0]; } };

mera faculty ko toh leetcode, codeforces ke bare mai bhi nahi pata bhai. ye ICPC boldiya toh mereko pagal sochenge woh

A to hota nhi solve 😢

😂😂 March m DSA CP m enter Kiya alone koi mana nhi. Sari mistakes ki mene Jo mentioned h video m 😅. Soch rha tha LGM banuga 😂😂 8 month m Bad m break liya itna lmba ki 7.5 months nikal gya. N DSA aya n OA clear hua rating bhi 900 tk gyi thi 400 aa gyi finished 😅

can be get graph series ,I loved this one

Competitive programming with Python

problem b had so much yapping and talking between each other I lost track

I feel with general logical competitive programming problems you actually need intuitive logical reasoning as opposed to memorisation, as harder problems rely more on your ability to connect patterns and adapt/invent algorithms to certain problems as opposed to relying on memorised knowledge.

9:02