New Course: Basic Programming Techniques
We just launched our Basic Programming Techniques course. Don’t let the name fool you; what we consider the basic is already pretty challenging to most programmers.
Learning these techniques will help you improve your programming logic, making it easier to solve complex problems. The course is divided into problem-solving strategies, important techniques and well-know problems.
Some important strategies include:
- Greedy Strategy
- Divider and Conquer
- Dynamic Programming
In addition to learning how to write the code, you will learn how to identify when and how to use each strategy.
In the second part of this course, we will present some of the most famous problems that are solved using these techniques. Examples include:
- Maximum Subarray Sum
- Longest Common Subsequence
- Longest Increasing Subsequence
- Knapsack Problem
Learn these problems will help you to further understand how the techniques work, and it is also an opportunity to learn some tricks 😉.
I will not extend myself here since I know you can’t wait to start this new course.
Good luck, and have fun!