Header Ads

Recursion and Backtracking (Memoization, D&C, Combinations)

Recursion and Backtracking (Memoization, D&C, Combinations)

Algorithm Design Techniques, Backtracking, Divide and Conquer, Memoization, N-queen Problem

Recursion and Backtracking (Memoization, D&C, Combinations)


What you'll learn
  • You will be able to solve almost any problem involving recursion or at least easily understand the logic behind it.
  • You will learn Backtracking and be able to solve famous Backtracking problems that may be asked in the coding interviews.

  • You will have the sufficient knowledge and skill to easily understand and learn Data Structures and Algorithms.

  • You will learn how to create and solve problems having to do with Recurrence Relations.
  • You will learn the Basics of Programming Paradigms such as Dynamic Programming, Divide and Conquer and Backtracking. 
  •  

No comments

Powered by Blogger.