I enjoy working with algorithms and want to understand the subject more deeply. I do not have a computer science degree, so I'm wondering whether it's realistic to become highly proficient through self-study. Should I mainly solve coding-practice problems, or would I be better off focusing on algorithm theory and data structures first?
3 Answers
Try thinking about algorithms beyond software too. An algorithm is simply a precise sequence of steps for solving a problem, so you can practice by describing how any machine or everyday process works. Once you can express the steps clearly, translating them into code becomes easier. LeetCode is helpful for targeted practice, but it works best alongside fundamentals rather than as your only source of learning.
Algorithms and programming are related, but they’re not the same thing. You can study algorithmic ideas on paper, then use programming to test and apply them. Start by becoming comfortable with one language and its basic building blocks—conditions, loops, functions, arrays, and recursion. Then learn data structures such as linked lists, stacks, queues, trees, graphs, and hash tables. C or Rust can be useful choices because they make memory and data representation more visible, but any language you enjoy is fine.
A degree isn’t a prerequisite. Students typically learn algorithms before earning one, so you can study the same material independently. A good approach is to choose a solid algorithms textbook or course and work through it systematically, implementing the ideas as you go. Practice problems become much more useful when you understand the theory behind the patterns instead of memorizing solutions.
That makes sense—I'll try working through a structured theory resource and use coding problems to reinforce each topic.