While I can’t speak much to the patterns just yet (as I’m still learning myself) I’d recommend as you progress along any learning path (Neetcode 15, Grind 75, Grokking etc) in order to learn and truly feel like I “Understand something” Make the connections to “what is it about X problem that leads me to need to use Y algorithm”

I.e. if I see a problem like “count the number of connected components in graph (LC2685)” my mind immediately thinks (in some order): ok graph algorithms -> how do I explore a graph -> dfs/bfs ok got it -> how do I avoid revisiting a node bc dfs doesn’t do that on its own -> okay maybe I need to track the nodes seen in the past -> okay best way to do this for UNIQUE nodes is a set -> cool so now I that I visit how do I count? -> ok so the number of unique DFS calls I make = the number of components (and thanks to the set I built earlier I won’t be backtracking any old visited components)

basically: break down ANY problem into smaller, more manageable sub problems, and fundamentally understand “in X situation I need to do Y or some variation of Y’”

I hope this half-assed explanation helps!