Mastering Algorithms & Data Structures for Problem Solving

تطور مهاراتك في حل المشكلات والتفكير الخوارزمي، واختيار الحلول وهياكل البيانات الأكثر كفاءة [17 HRS]

$39

one-time purchase

Buy now

Mastering Algorithms & Data Structures for Problem Solving

Course content

22 sections | 126 lessons

Module 01 | Introduction

Module 02 | Problem Solving Foundations

Module 03 | Performance Foundations

Module 04 | Arrays

Module 05 | Strings as real-world data processing

Module 06 | Hashing (Dictionary / Set)

Module 07 | Linked List

Module 08 | Stack

Module 09 | Queue

Module 10 | Trees

Module 11 | Binary Search Tree

Module 12 | Graph

Module 13 | Heap & Priority Queue

Module 14 | Recursion

Module 15 | Divide and Conquer

Module 16 | Two Pointers

Module 17 | Sliding Window

Module 18 | Backtracking

Module 19 | Greedy Thinking

Module 20 | Shortest Path Algorithms — Dijkstra in Practice

Module 21 | Dynamic Programming (Introduction)

Course Completion & Next Steps

Mastering Algorithms & Data Structures for Problem Solving

Module 01 | Introduction3 Lessons

Module 01 | Introduction

Module 02 | Problem Solving Foundations5 Lessons

Module 02 | Problem Solving Foundations

Module 03 | Performance Foundations7 Lessons

Module 03 | Performance Foundations

Module 04 | Arrays5 Lessons

Module 04 | Arrays

Module 05 | Strings as real-world data processing5 Lessons

Module 05 | Strings as real-world data processing

Module 06 | Hashing (Dictionary / Set)6 Lessons

Module 06 | Hashing (Dictionary / Set)

Module 07 | Linked List5 Lessons

Module 07 | Linked List

Module 08 | Stack5 Lessons

Module 08 | Stack

Module 09 | Queue5 Lessons

Module 09 | Queue

Module 10 | Trees7 Lessons

Module 10 | Trees

Module 11 | Binary Search Tree12 Lessons

Module 11 | Binary Search Tree

Module 12 | Graph10 Lessons

Module 12 | Graph

Module 13 | Heap & Priority Queue7 Lessons

Module 13 | Heap & Priority Queue

Module 14 | Recursion5 Lessons

Module 14 | Recursion

Module 15 | Divide and Conquer6 Lessons

Module 15 | Divide and Conquer

Module 16 | Two Pointers5 Lessons

Module 16 | Two Pointers

Module 17 | Sliding Window5 Lessons

Module 17 | Sliding Window

Module 18 | Backtracking5 Lessons

Module 18 | Backtracking

Module 19 | Greedy Thinking8 Lessons

Module 19 | Greedy Thinking

Module 20 | Shortest Path Algorithms — Dijkstra in Practice4 Lessons

Module 20 | Shortest Path Algorithms — Dijkstra in Practice

Module 21 | Dynamic Programming (Introduction)5 Lessons

Module 21 | Dynamic Programming (Introduction)

Course Completion & Next Steps1 Lessons

Course Completion & Next Steps