So I recently switched up my approach on leetcode.com to optimize for this naturally. What I was doing initially was: I sorted their entire problems database

So I recently switched up my approach on leetcode.com to optimize for this naturally. What I was doing initially was: I sorted their entire problems database for the most frequently asked questions. Started at the top, and worked my way down. The problem with this method is that each question can be quite different from the last. Your first question might be an arrays / sliding-window question. The next is a dynamic programming problem. The next stacks. After that, union-find / connected components. The point is each problem would end up sufficiently different from the previous one that in a given day, or over the course of a few days, you weren't practicing the same (or roughly the same) type of problem. So as of literally TODAY I've changed my approach to sort the list by TYPE of problem. I will then focus on a specific type (per their categorization) for ~X number of problems (to be determined). The hope is that by sticking to a specific category of problems, I'll be able to actually learn the commonalities within those problem sets.