Algorithms in Python : Design Techniques And Approach

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

Created by: Arbi Elezi
Software Developer | Computer Engineer | Instructor

What Will I 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.

Requirements

• A computer or any device for attending the course
• Knowledge of at least a programming language

Target audience

• Anyone who wants to improve his/her skills in Recursion and Backtracking.
• Coders who want to do good in coding interviews.
• Struggling students in the topic of Recursion and Backtracking.
• Students who want to understand better Dynamic Programming and other Paradigms.
• Coders who have just learned a Programming Language.