0
Problem statement's
When you look at a problem statement and read the description and see the inputs and outputs. When you use disgnose the question. How do you decide which algorithm to use to solve the given problem ??? Algorithm examples: - Sorting - Dynamic programming - Linked lists - Recursion - Brute force to name a few.
2 Respostas
+ 1
I Mcqueen
I think this kind of question is where a formal education /training in Computer science really helps. Its not that you cant learn this stuff your self, but "you dont know what you don't know".
For instance Mathematics helps you with understanding how to express problems and apply rigour to their solutions, and why its quiet a big part of CS.
Sounds like you already have some understanding of data structures and algorithms, and coding lots of problems and understanding the Big O discussion will help you choose the best fit for the job at hand, as there is no right or wrong in many cases.
https://en.wikipedia.org/wiki/Algorithmic_efficiency
0
Hi, I am a college student and alter my experience on coding , When you see the problem statement just read clearly and try to read the question multiple times and just think about the solution.
The second step would be to take a pen and paper and just try to write the logic and first go to the brute force solution and try to write the code.