To see more videos like this, you can buy me a coffee: [ Ссылка ]

The dictionary meaning of backtracking is to retrace your own steps. But how is this useful in computer programming. There are certain problems where only only way could lead you to the correct answer, and to reach that solution you need to revert back to your previous state. Hence backtracking. Watch this video to understand what kind of problems require a backtracking algorithmic approach along with an example of your favorite game.

Chapters:
00:00 - Intro
01:38 - Problem statement and description
02:39 - Method 1: Using randomization
05:10 - Method 2: Be smart and backtrack
09:32 - Sample problem
13:46 - Final Thoughts

📚 Links to topics I talk about in the video:
Brute Force Method: [ Ссылка ]
Recursion Algorithmic Paradigm: [ Ссылка ]
Trees: [ Ссылка ]
Playlist on Algorithmic Paradigms: [ Ссылка ]

📘 A text based explanation is available at: [ Ссылка ]

📖 Reference Books:
Starting Learn to Code: [ Ссылка ]
Favorite book to understand algorithms: [ Ссылка ]
Favorite book for data structures: [ Ссылка ]
Get started for interview preparation: [ Ссылка ]

🎥 My Recording Gear:
Recording Light: [ Ссылка ]
Microphone: [ Ссылка ]
Recording Camera: [ Ссылка ]
Tablet to sketch and draw: [ Ссылка ]
Surface Pen: [ Ссылка ]
Laptop to edit videos: [ Ссылка ]


💻 Get Social 💻
Follow on Facebook at: [ Ссылка ]
Follow on Twitter at: [ Ссылка ]
Follow on Tumblr at: [ Ссылка ]
Subscribe to RSS feeds: [ Ссылка ]
Join fan mail: [ Ссылка ]

#backtracking #programming #algorithms

свернуть