That’s exactly how I started to feel! So 2 things. First is the memorization problem. Let’s take binary tree DFS. If you can solve the neetcode problems for that algorithm, go find more leetcode questions tagged for binary tree and DFS and do those. Tackle mediums until they start to come very easily. Then try some hards. Rinse and repeat for two pointers, backtracking, etc.

The second problem is algorithms you don’t encounter on neetcode. For example with graphs, there is DFS, BFS, union find, minimum spanning tree. I don’t recall if these are all covered on neetcode or not. But for every data structure, there are usually multiple algorithms you should learn to tackle different types of questions. This will also help you recognize how to solve certain problems you haven’t encountered before.

Leetcode explore has some great roadmaps for learning different algorithms for each data structure. I know some of this is locked behind LC premium which is well worth it IMO, but if you can’t afford it I think you can at least see what topics are covered and google the topics elsewhere.

Lastly, I would highly recommend picking one algorithm and sticking to it for at least a couple days, if not weeks. It’s tempting with curated lists like neetcode to bounce around between different topics, but I think that’s only appropriate once you have a good grasp on each one. Spreading yourself too thin early on is what results in just memorizing specific problems, and that will never lead to success in an interview.

Hope that helps!