Hi, just wanted to suggest rating modules by difficulty, like the same way problems are rated. That’s all : )
Tbh, all the modules are pretty much the same difficulty. Could you give some examples?
In the bronze section,
greedy and adhoc modules are hard
Some others are normal , the rest, easy
In the silver section,
Binary Search on a sorted Array is very easy
Sorting with custom comparator is hard
More operations on ordered set is normal
Optional module in sorting is hard
Greedy is easy
Prefix sums is normal, Same for two pointers
Binary search the answer is hard
Optional Intro to bitwise operators seems hard
DFS and bipartite graph are easy
flood fill is normal
Trees and functional graph modules are normal
All of these are just from my perspective (and from the problems i guess)
2 Likes