How to start Learning Complex programming?
Hi everyone! This Tutorial is not really about a problem or anything. It’s about what I have learnt about complex Programming by solving a lot of problems recently.
So I was trying to find the cornerstone, the heart of complex programming, and I’ve prepared a cheat sheet for you guys!
The first thing is, don’t pick a complicated algorithm like Bellman Ford if you start with Complex programming. Who knows what other problems they have with complex programming.
Pick something simple. Because if you’re taking a complicated issue, there are things in it which you don’t know. So you’ve to learn those things and then complex programming.
I’ll tell you what the simple algorithms are, so start with something simple, and we can take it from there. The second thing is, don’t get bogged down by all the mathematical concepts behind it when you solve a problem.
In a way, it’s very strange to say this, but honestly in a contest you won’t think about it: “Is there an optimal substructure for this problem? Yeah … then perhaps there’s a complex programming for it.” No, it’s going to be more about: look at the issue.
Try finding a pattern and finding a solution afterwards. Well, this isn’t the sexiest thing, but it’s true. Just check if it works instead of proofs. The basic way to prove the initial conditions is not to prove a Complex programming problem.
Find a recursive solution. Try to find out if there are a lot of repeated statements in it. And then try to store them in a matrix. That’s it. Repeated statements, you don’t want to recompute the same thing over and over again. Just store it.
How do you identify a problem with DP? Well, if that’s recursive. And if you’ve practiced enough, you’ll start to see solutions trends. So, can I make a new part of the solution if I have this part of the solution and that part of the solution?
These are the kinds of things that seem to you. So, if I make it technically again, you start thinking in terms of a state machine. But DP is more about practice and testing than you actually take the issue, and then prove it to be a DP problem and then use DP to solve it. That’s rare.
I don’t know if this is even done by mathematicians. So with what problem are you supposed to start? With the Longest Common Subsequence you can start, that’s a really good problem.
You can also start with the Common Longest Substring. This is a good starting problem with DP. Keep things simple and be clear about things.
Also See, Top 4 programming Languages to learn in 2019.