Algorithms are tough to master. It’s logical thinking with mathematics and computer science. These are mostly common when you are appIying at a larger company when you are doing a tech interview. Was looking at the Flatiron website and they had mentioned something about “Big-O notation”. “Big-O” is used to classify algorithms according to how their run time or space requirements grow as the input size grows as shown below (The higher the operations, the elements gets slow (worst case)):
In this graph, most of these functions has a different meaning:
O(1) Constant — has no loops
O(log N) Logarithmic
O(n) Linear-For loops, while loops through n times
O(n²) Quadratic-every element in a collection needs to be compared to ever other element. Two nested loops.
Their were other function names that I don't remember.
The whole purpose for us as programmers is to help us understand the problems in our code. Therefore, it can help us with our day to day code with the problems that we solve.
To get improve your Algorithm skills: The best thing you can do is to study online questions, I mostly used Hacker rank and Udemy to look at tutorials and watch other videos of people building algorithm. In my opinion, I wold not recommend using CodeWars because it doesn't give you explanation or any videos explaining why its correct. It’s mostly for challenging your skills.