Learn fundamental logic (algorithms & data structures) for solving coding questions for tech jobs in software industry.

What you'll learn:

Recursion, memoization, Dynamic Programming - top down recursive approach and bottom up iterative approach

Knapsack 0/1 and unbounded, Rod Cutting problem, Minimum number of coins for making change problem, Maximum number of ways for making change coin problem

Longest Common Subsequence, Longest Common Substring

Minimum number of insertion and deletions required to convert string A to string B

Requirements

Some programming knowledge in any language such as C#, Java, C++, Python etc.

Description

The questions included in part 2 of this series are based on topics such as - Recursion, memoization, Dynamic Programming - top down approach and bottom up approach, Knapsack - top down recursive solution both without and with memoization, Knapsack -bottom up Dynamic Programming iterative solution, Rod Cutting problem, Minimum number of coins for making change problem, Maximum number of ways for making change coin problem, Longest Common Subsequence - top down recursive solution both without and with memoization, Longest Common Subsequence - bottom up Dynamic Programming iterative solution, Longest Common Substring, Minimum number of insertion and deletions required to convert string A to string B.

Who this course is for