Backtracking Courses and Certifications

Recursion, Backtracking and Dynamic Programming in Java

1630 ratings at Udemy

Competitive Programming with Common Interview Questions (Recursion, Backtracking and Divide and Conquer Algorithms)

• Udemy
• 14 hours 58 minutes
• Self-Paced
• Paid Course

Packt

Intermediate Algorithms: Graphs, Trees, and Backtracking

Master advanced algorithms through hands-on practice with graphs, trees, and backtracking techniques to solve complex real-world problems and ace technical interviews.

• Coursera
• 14 hours 3 minutes
• Self-Paced
• Paid Course

Packt

Advanced Concepts in Recursion, Backtracking, and OOP

Master advanced recursion, backtracking, and OOP principles while solving complex algorithmic challenges including sorting, searching, and data structure manipulation.

• Coursera
• 1 day 56 minutes
• Self-Paced
• Paid Course

Recursion, Backtracking and Dynamic Programming in Python

929 ratings at Udemy

Learn Competitive Programming, Recursion, Backtracking, Divide and Conquer Methods and Dynamic Programming in Python

• Udemy
• 15 hours 46 minutes
• Self-Paced
• Paid Course

Back To Back SWE

Dynamic Programming, Recursion, and Backtracking

Master dynamic programming, recursion, and backtracking through 23 algorithmic challenges including classic problems like N Queens, Sudoku solving, and coin change optimization.

• YouTube
• 6 hours 32 minutes
• Self-Paced
• Free Video

Kunal Kushwaha

Recursion and Backtracking Course

Master recursion and backtracking from basics to advanced interview problems including sorting algorithms, permutations, and classic puzzles like N-Queens and Sudoku.

• YouTube
• 11 hours 50 minutes
• Self-Paced
• Free Video

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

213 ratings at Udemy

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

• Udemy
• 1 hour 40 minutes
• Self-Paced
• Paid Course

Solve Coding Interview Backtracking Problems - Crash Course

Master backtracking techniques to solve complex coding problems, including N-Queens and Sudoku puzzles. Learn a versatile template for tackling similar challenges in technical interviews.

• freeCodeCamp
• Self-Paced
• Free Video

Kunal Kushwaha

Backtracking Introduction + Maze Problems - Theory + Code + Tips

Comprehensive guide to backtracking and maze problems, covering theory, code implementation, and practical tips for solving complex algorithmic challenges in programming interviews.

• YouTube
• 1 hour 28 minutes
• Self-Paced
• Free Video

Trelis Research

Training LLMs to Self-Correct Using Verifiable Backtracking

Master advanced LLM training techniques with verifiable backtracking, budget forcing, and implementation strategies to enhance model self-correction capabilities and improve overall performance.

• YouTube
• 23 minutes
• Self-Paced
• Free Video

ACM SIGPLAN

Can Logic Programming Be Liberated from Predicates and Backtracking? - Lightning Talk

Explore how logic programming can evolve beyond predicates and backtracking, examining functional approaches that improve efficiency and completeness while maintaining core logical principles.

• YouTube
• 22 minutes
• Self-Paced
• Free Video

Sundeep Saradhi Kanthety

Design and Analysis of Algorithms Part 2 - Dynamic Programming and Backtracking

Master dynamic programming, backtracking, and graph algorithms through hands-on problem solving including knapsack, TSP, N-Queens, and optimal binary search trees.

• YouTube
• 11 hours 17 minutes
• Self-Paced
• Free Video

Sundeep Saradhi Kanthety

Learn Backtracking with Examples - Design and Analysis of Algorithms

Master backtracking algorithms through practical examples. Enhance problem-solving skills and optimize algorithmic design for efficient solutions in computer science and programming.

• YouTube
• 1 hour 43 minutes
• Self-Paced
• Free Video

Sundeep Saradhi Kanthety

Sum of Subset Problem Using Backtracking - Design and Analysis of Algorithms

Explore the Sum of Subset problem using backtracking, with practical examples. Learn efficient algorithm design and analysis techniques for solving complex computational challenges.

• YouTube
• 21 minutes
• Self-Paced
• Free Video

ACM SIGPLAN

Beyond Backtracking - Connections in Fine-Grained Concurrent Separation Logic

Explore a novel approach to automated verification of fine-grained concurrent programs using a multi-succedent calculus for separation logic with disjunctions, inspired by connection calculus.

• YouTube
• 19 minutes
• Self-Paced
• Free Video