Hello, following my previous blog, I'm adding the new problems I found interesting/teaching, so let's get into the problems
Note: these problems are mostly for the range of [pupil, expert] level, an average specialist with a bit of sweat will be able to solve them all
Problems
The problems aren't in any specific order but higher problems may be a bit easier
These problems' requirements are intermediate dp, binary search, pure logic, algorithmic thinking, and math.
and I've solved all of them so feel free to check my submissions if u wanted
are they in increasing order of difficulty? What is the range of ratings of these questions?
tbh no, their order is the order I solved them in reverse, the higher in the list, the older my submission.
range of rating is around 1200-2100, but non of them require any advanced knowledge in my opinion, I'll add these infos in the blog
a little request. can you please mention difficulties alongside?
Bro, I have to open every single question and add the difficulty next to it... I kinda don't got the energy for that, hope it's understandable.
most of these are pupil + spec level
no problem. it would have been nice but its ok.
Auto comment: topic has been updated by bgopc (previous revision, new revision, compare).
Hey bro, I wanted to ask whether these problems include graphs, trees etc?
no these problems in particular don't, maybe I'll create it a
graph problems worth solving
similar to mybinary search problems worth solving
blog, but not now, when I solved more of them, currently I haven't solved more than 40-50 of them so...But there are some requiring dfs/bfs but not focused on it
Can I practice these considering my current rating ?
These may be a bit advanced, refer to my part one blog those maybe easier to solve
Thanks a lot.
will these be helpful for me?
these problems are pupil to expert level, but there are some hard problems in them, so watch out but generally yes(the previous blog may suit u better tho)
are these problem suitable for an eight grader?
5 weeks and no answer :(