### pranav232323's blog

By pranav232323, history, 3 years ago,

So, I've been using LeetCode to do some topic-wise practice on DP.

In particular, I've been doing the questions tagged medium and hard.

However, while I can usually solve the mediums in a reasonable time frame, I struggle to make any progress at all on the hards. As a result, I've been wondering whether or not I should attempt them at all at this stage. My official rating is $896$, but I think I'm around $1200$ since I haven't completed $6$ contests yet. In terms of goals, I'm trying to get comfortable with DP questions at the range of Div 2C.

Thus, my question is two-fold

1) How would you estimate the CF rating of LeetCode hard problems?

2) Should I continue solving LeetCode hards or just look for DP problems in the range of rating $\pm\ 200$.

• +5

| Write comment?
 » 3 years ago, # | ← Rev. 2 →   0 Some hard problems are easy and some hard are too hard. On an average I'd say all hard problems are an easy 1200+ in terms of CF but no more than 1900/2000 ig.
•  » » 3 years ago, # ^ |   +1 I've never solved a LeetCode hard problem in my 8 contests. Since I'm ~1500 rated, I'd say LeetCode hards can be reasonably bounded by >1500.
•  » » » 3 years ago, # ^ |   0 Nah most people on Leetcode don't do contests, this hard https://leetcode.com/problems/jump-game-ii/ is a simpler version of 1472C
•  » » » » 3 years ago, # ^ |   0 That's an old problem, I assume the OP is asking about newer problems.
•  » » » » » 19 months ago, # ^ |   0 Has your opinion changed after all these years? What do you think about it as of now?
•  » » » » » » 19 months ago, # ^ |   +16 My opinion has changed to <1700. But that is just my opinion.
•  » » » » » » » 5 weeks ago, # ^ |   0 and > ?
•  » » » » » » » » 5 weeks ago, # ^ |   0 wdym?
•  » » » » » » » » » 5 weeks ago, # ^ |   0 You said that leetcode hard problems < 1700 , and I asking is leetcode hards problems > ? ( e.g leetcode hard > 1500 )
•  » » » » 5 weeks ago, # ^ |   0 did leetcode update tags or what coz now this is rated just a medium
 » 3 years ago, # |   0 I guess doing all the classic dp problems is enough for Div2C. Some times, It's just a variation of a classic Dp. Some times, you have to observe the recurrence relation. But anyways, if you haven't tried cses problemset yet, here you can get to solve a curated list of problems from each topic.
•  » » 3 years ago, # ^ |   +3 That's an amazing resource — thanks for the link!