Data structures and algorithms are important, whether it’s an interview or a job, no matter what aspect of technology you’re working on. However, although algorithms are important, they are not suitable for everyone to spend all their energy in college.
I believe that many schools have clubs or organizations related to ACM competitions. Unfortunately, our school doesn’t have it, and I spent a lot of energy brushing up on questions in my freshman year, but the hardware conditions didn’t allow it, and the atmosphere was too lacking. If you feel like you can handle ACM competitions, then congratulations, you can focus on algorithms. If you feel that you are struggling and frustrated in this process, then don’t be discouraged, there may be another path that belongs to you. It is great to choose development, have a deep foundation in algorithms, but it is not enough to have algorithms alone, there are still many unknowns waiting for you to explore in the computer ocean.
Algorithm positions include data mining, machine learning, etc. (how about it, tall, I don’t understand anyway). It should be noted that students who want to do algorithms should choose to continue their studies in graduate school, because large enterprises are very unfriendly to undergraduates in the recruitment of algorithm positions. I still have to affirm that you can’t ignore algorithms and data structures when doing development, at least interviews are still often tested! Remember a sentence:
People with good algorithm skills will not have bad luck.
For undergraduates, it is still a relatively easy path to development, but there are also countless technical routes for development: front-end, backend (PHP backend, Java backend, etc.), mobile (Android and IOS), game development, database (such as DBA), ……. I will definitely not recommend you to learn any one here, I have no ability and am not suitable. Only you can discover your interests and curiosities.
All I can do is help undergraduates solve their doubts in the vast sea of technical perspectives.