Hello There, Hope you’re keeping well ? Today let’s talk about how to be good at Solving Data structures and Algorithm problems. If you’re like me then you will also find DSA problems as intimidating at first glance, that may even lead you to ask yourself a lot of questions as to if you’re ever going to get this concepts at all at some point in your life. No worries you will get even up to the last word of it if you stay not distracted and focus. set your eyes on the ball at all time, take some breaks and come again. I used to think like that until i decided to make my worse enemy my best friend and look at it everyday even if am busy then the missing dots began to connect themselves and the more i look at it the more i understood why some things seem like a rocket science earlier. that said before you can begin to understand these concepts you need to master the Patterns around solving these problems. no doubts to every solution in DSA there must be a particular pattern or approach used in demystifying the problem.
These Patterns are to be mastered and understood very well before jumping on to of these Questions. Let’s have them listed below.
- Multiple Pointers
- Dive & Conquer
- Greedy Algorithm
- Dynamic Programming
- Backtracking
With these few listed patterns above i am pretty sure you may not find it threatening when you come across any Data structures problem. We will be diving into more examples that will be relating to each of these patterns soon and as we move along but in the meantime, take some time and read more around these patterns until the next post.
Thanks for reading… 🙂