Divide-and-Conquer Courses and Certifications

The Design and Analysis of Algorithm Masterclass

659 ratings at Udemy

Algorithm & Data Structures will help you to Crack Coding Interviews (C/C++Java/Python) Learn Algorithm Data Structures

• Udemy
• 12 hours 33 minutes
• On-Demand
• Paid Course

Divide & Conquer: Creative Quilting for Any Space

Learn the techniques to conquer any space, and create beautiful motifs to enhance all of your future projects! \" craftsy-mix-match-inspired-scrappy-quilting,craftsy-mix-match-inspired-scrappy-quilting,Mix & Match: Inspired Scrappy Quilting"

• Craftsy
• 2 hours 32 minutes
• On-Demand
• $39.00

Mastering critical SKILLS in Algorithms using C++: Part 2

281 ratings at Udemy

70 Challenges to master recursive based techniques, shortest-path and MST algorithms.

• Udemy
• 15 hours 4 minutes
• On-Demand
• Paid Course

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
• On-Demand
• Paid Course

NPTEL;  IIT Bombay

Design & Analysis of Algorithms

2 reviews

Comprehensive exploration of algorithm design techniques, analysis frameworks, and problem-solving strategies, covering divide-and-conquer, greedy algorithms, dynamic programming, and NP-completeness.

• YouTube
• 1 day 6 hours
• On-Demand
• Free Video

Algorithms in Java :Live problem solving & Design Techniques

168 ratings at Udemy

Recursion,BackTracking,Divide & Conquer,Dynamic Programming,Greedy Algorithms via Data Structures and Algorithms in Java

• Udemy
• 19 hours 40 minutes
• On-Demand
• Paid Course

计算几何 | Computational Geometry

In this introductory computer science course, explore geometry, develop geometric thinking, and learn geometric algorithms.

• edX
• 16 weeks, 6-8 hours a week
• On-Demand
• Free Online Course (Audit)

Divide and Conquer - Concept-based Models for Efficient Transfer Learning

Exploring concept-based interpretable AI models for efficient transfer learning in healthcare, focusing on generalizability and minimal data requirements for domain adaptation in medical imaging.

• YouTube
• 1 hour
• On-Demand
• Free Video

Algorithms in JavaScript : Design techniques

69 ratings at Udemy

Data Structures, Complexity Analysis,Recursion, backtracking, Dynamic Programming,Greedy algorithm, Divide and Conquer

• Udemy
• 17 hours 21 minutes
• On-Demand
• Paid Course

Python Programming: A Comprehensive Introduction

38 ratings at Udemy

Master Python Programming from Fundamentals to Real-World Applications

• Udemy
• 4 hours 13 minutes
• On-Demand
• Paid Course

Birla Institute Of Technology And Science–Pilani (BITS–Pilani)

Algorithm Design: Mastering Computational Problem Solving

Master algorithmic design paradigms including divide-and-conquer, dynamic programming, graph algorithms, and complexity theory to solve computational challenges efficiently.

• Coursera
• 1 day 8 hours 54 minutes
• On-Demand
• Paid Course

NPTEL;  IIT Bombay

Design and Analysis of Algorithms

Comprehensive exploration of algorithm design techniques, analysis frameworks, and problem-solving strategies, covering divide-and-conquer, greedy algorithms, dynamic programming, and NP-completeness.

• YouTube
• 1 day 6 hours
• On-Demand
• Free Video

React Conferences by GitNation

Complexity - Divide and Conquer

Simplify complex UI problems by viewing them as actions changing facts leading to reactions. Learn to make code more declarative and concise using reactive programming principles.

• YouTube
• 27 minutes
• On-Demand
• Conference Talk

Great Learning

Learn Divide & Conquer Algorithms - Great Learning

Explore divide and conquer algorithms: Binary Search, Quick Sort, and Merge Sort. Learn concepts, implementations, and complexities in this comprehensive session on efficient problem-solving techniques.

• YouTube
• 1 hour
• On-Demand
• Free Video

Yannic Kilcher

Divide-and-Conquer Monte Carlo Tree Search for Goal-Directed Planning - Paper Explained

Explores a novel AI planning approach using divide-and-conquer Monte Carlo Tree Search, proposing intermediate goals to break complex problems into manageable sub-tasks for more efficient problem-solving.

• YouTube
• 26 minutes
• On-Demand
• Free Video