Have you studied computer science academically yet? If you haven't and you're starting to feel like you've plateaued with the mechanical aspects of writing algorithms, it might be time to delve into the theoretical aspects of algorithms. The hardcore math beyond algorithms, like discrete mathmatics, theory of computation, regular, context-free, and Turing-recognizable languages, etc. Algorithms study that involves proofs rather than code.
You can go a long in the software field with self-study, but it's hard to substitute self-study for a rigorous CS curriculum. You don't know what you don't know, so it's harder to discover what to learn. A CS curriculum, however, will have compiled that list for you and included exercises and tests.
Code is only one way to express an algorithm. But when you understand the fundamental ideas behind the algorithms, you'll be much more capable with capturing those ideas in code.
Here's a list of some of the textbooks that I learned from:
Discrete mathematics and its applications, Rosen