Speakers: Soham Mehta
It is no secret that the bar to crack technical interviews is only getting higher with each passing year. That's especially true of good companies, viz. think Big4 and pre-IPO startups. Recursion is pervasive in many of these interviews. Whether it is dealing with basic algorithms on Sorting, or whether it's simple data-structures like Linked Lists, Arrays & Strings, or whether it's about traversing complex data-structures like Trees and Graphs, you're bound to come across Recursion-based solutions. Recursion can be a difficult concept to grasp for many of us, but it doesn't have to be. It's one of those things that can be reigned with practice, and once reigned, it gives dividends all through your practice. Once you're comfortable with recursion, Dynamic Programming also becomes easier, because Recursion is the first logical step to solving many DP problems. In this session, we'll patiently walk through some Recursion and DP problems, until the time permits.
- Not Interested