The same way you study anything else: spaced repetition, active recall, memory palace, etc.

I'm doing this https://sp21.datastructur.es/ + leetcode.

Implement them

kunal kushwaha (not sure if i spelled the last name right) really helped me fill in some gaps.

that being said, i had to do a little bit of leetcode instructions + books + algoexperts + youtube to really grasp all the gaps I had in my knowledge.

everyone has their own preferred way, i just wanted to share that it took various resources for me.

Thanks for the suggestion will definitely check it.

Check out the Learning How to Learn course on Coursera.

In any algorithm, you see temporary data structures, ranging from string variables to abstract data types(say, arrays, queues, stacks, priority queues, etc). So you have to remember which to use in what kind of problem solving: in depth first search, the temp one is a stack; in breadth first search, the temp one is a queue.

Similarly, in some set of problems, you need to remember tricks wrt swapping members in a structure and start solving the problem again.

Wherever you have troubles, jot down and refocus on those problems after a month. It’s like spaced repetition. Spaced repetition is not necessary if you are involved with such projects all the time, like the way library writers do.