Data Structures Decode

Build and Implement Foundation-Level Data Structures

Lessons 23
Duration ~ 11 hours
Study Hours 22 - 43

This course is available via:

Plan Courses Price Action
Coding Only ⓘ 4
$160 $120 / 12 months 24 months
EGP 8,000 EGP 6,000 / 12 months 24 months
Subscribe
Algo & DS ⓘ 2
$70 / year
EGP 3,500 / year
Subscribe

Or subscribe to it individually:

This course only
$30 / year
EGP 1,500 / year
Subscribe

What Will You Learn

Memory & Data Foundations

Understand how data types interact with physical memory.

Linear Structures

Implement Singly and Doubly Linked Lists and compare performance vs Arrays.

Stacks & Queues

Master LIFO and FIFO patterns using both Array and Linked-List implementations.

Advanced Hashing

Learn FNV-1a hashing mechanics and build efficient Hash Tables and Dictionaries.

Trees & Search Trees

Design hierarchical structures, including BST insertion, deletion, and balancing.

Heaps & Priority Queues

Implement binary heaps to manage prioritized data processing efficiently.

Prerequisites

In order to start this course you must have these skills:

Core Logic

Proficiency in loops, variables, and conditional statements.

Complete Algorithms Course

Consider this course as the second part of ‘Algorithms Analysis and Design from Scratch’ course in our platform.

Basic OOP

Understanding of classes and objects.

Recommended Courses:

Instructor

Instructor Avatar

Ahmed Metwally

Software Industry Expert

24+ Years of Experience

I am on a mission to elevate the efficiency of the software industry in the Arab world by developing highly skilled and knowledgeable software engineers. My courses are carefully designed to equip them with the essential expertise needed to excel in the market.

Course Content

Data Structures Decode
23 lessons 10.8 hour
1 - Data & Memory
23 min
2 - DataTypes & Memory
27 min
3 - Array – Introduction
34 min
4 - Array – Operations Implementation
36 min
5 - Linked List – Introduction – Singly list implementation
35 min
6 - Linked List – Singly list implementation 2
31 min
7 - Linked List – Doubly list implementation
29 min
8 - Linked List VS Array Time Complexity
13 min
9 - Linked List implementation – JavaScript
33 min
10 - Stack – Linked List based – implementation
22 min
11 - Stack – Array based – Implementation
30 min
12 - Queue – Linked List Based – Implementation
24 min
13 - KeyValuePair – Dictionary – Implementation
43 min
14 - Hashing – Introduction – FNV-1a Implementation
30 min
15 - Hash Table – Introduction
18 min
16 - Hash Table – Implementation
38 min
17 - Introduction to Trees – Binary Tree – Implementation 01
24 min
18 - Binary Tree – Implementation 02
23 min
19 - Binary Search Tree – Introduction – Insert – Find
32 min
20 - Binary Search Tree – Delete
34 min
21 - Binary Search Tree – Balance
20 min
22 - Heap – Implementation
36 min
23 - PriorityQueue
11 min