This repository contains my solutions for exercises from the JavaScript Algorithms and Data Structures Masterclass course by Colt Steele.
The course is divided into several sections, each focusing on specific topics:
- Introduction: Overview of the curriculum and how to approach the course.
- Big O Notation: Understanding time and space complexity.
- Analyzing Performance of Arrays and Objects: Examining the efficiency of common data structures.
- Problem Solving Approach: Step-by-step problem-solving techniques.
- Problem Solving Patterns: Identifying and utilizing common coding patterns.
- Problem Solving Challenges: Additional practice exercises.
- Recursion: Understanding and implementing recursion.
- Searching Algorithms: Implementing various searching techniques.
- Sorting Algorithms: Implementation and analysis of sorting algorithms.
- Data Structures Introduction: Overview and implementation of fundamental data structures.
- Singly Linked Lists: Implementation and manipulation of linked lists.
- Doubly Linked Lists: Implementation of doubly linked lists.
- Stacks & Queues: Implementation and applications of stacks and queues.
- Binary Search Trees: Understanding and working with binary search trees.
- Tree Traversal: Techniques for traversing trees.
- Binary Heaps: Implementation and applications of binary heaps.
- Hash Tables: Understanding and utilizing hash tables.
- Graphs: Introduction to graphs and their representations.
- Graph Traversal: Techniques for traversing graphs.
- Dijkstra's Algorithm: Understanding and implementing Dijkstra's shortest path algorithm.
- Dynamic Programming: Introduction to dynamic programming concepts.
- Basic knowledge of JavaScript syntax.
- No prior experience with data structures or computer science is required.
You can navigate through the repository to find solutions to specific exercises. Each directory is named according to the course section, and each file contains my solution for a particular exercise or challenge.