danielcarlman / traversy-js-challenges

Challenges & docs from JS Algorithms & Data Structures course

Traversy JS Challenges: Data Structures & Algorithms

This is the sandbox for my 70+ JS Challenges: Data Structures & Algorithms Course. Just about all of the concepts that are included, also exist in other languages. So, if you are not a JavaScript developer, you can still follow along and learn from this course/repo.

This course/repo goes over everything from basic loop challenges, high order array methods, recursion, time & space complexity, data structures such as stacks, queues, linked lists, trees, graphs, and we touch on sorting algorithms like bubble sort, insertion and merge sort. You should already know the basics of JavaScript before doing any of the challenges or taking the course.

Please do not make any PRs to this repo as it goes along with a specific course. I may open another one for student solutions and new challenges.

File Structure

Each folder includes:

• readme.md - The challenge/code instructions. This also includes hints, tests and a dropdown with the solution code as well as the explanation of the solution code.
• [name].js - This is your working file. It has the name of the function and the function is exported. No parameters are passed to the function. That is up to you to add.
• [name]-run.js - File to run the code manually. The function is already imported and called with expected parameters.
• [name]-solution.js The solution code with heavy commenting. Some challenges have multiple solutions. If you want the solution without comments, look in the readme.md file.
• [name]-test.js - Jest tests for the solution code. You will need to rename this file to [name].test.js to run the tests.

Learning Modules/Lessons

Some lessons/modules are not challenges, they are more like mini-lessons. I don't just throw you a challenge using a new concept (Trees, Stacks, Bubble Sorts, etc) without explaining it first. I try to explain the concept and then give you a challenge to practice or implement it. So some folders will not have a challenge, just a readme file.

Running Tests

In order for the Jest tests to run, you need to rename the test file to [name].test.js. For example, if you are working on the hello-world challenge, you need to rename the hello-world-test.js file to hello-world.test.js. This is because Jest looks for files with the .test.js extension.

Run the command npm run test from the root directory and it will run all the tests.

These Don't Have to be "Challenges"

Some people, such as myself are not great at doing this stuff off the top of their head. Even though most of the code is setup as a challenge, you can certainly just follow along with the course and/or just study the solutions and learn from them.

You can use the tests to see if your code passes, but use the run files to run the code manually. This is so that you can experiment, console.log, etc.

Getting Started

1. Clone the repo
2. Run npm install
3. Run npm run test to run the tests. Again, you will need to rename the test files and replace the -test with .test to run the tests.

Index of Challenges/Lessons

01. Basic Challenges 1

These are mostly challenges that have to do with loops, conditionals, and string manipulation. I do not go over fundamentals like "what is a for loop". You should already know the basics of JavaScript.

1. Hello World Test Challenge
2. Get Sum Test Challenge
3. Calculator
4. Count Occurrences
5. Find Max Number
6. Title Case
7. Reverse String
8. Palindrome
9. Count Vowels
10. Remove Duplicates

02. Basic Challenges 2

These are more challenges that have to do with iteration. They are slightly harder than the first set of challenges.

1. FizzBuzz Array
2. Array Intersection
3. Display Likes
4. Find Missing Number
5. Find Missing Letter
6. Are All Characters Unique
7. First Non-Repeating Character
8. Dice Game Simulation
9. Format Phone Number
10. Validate Email

03. High Order Array Methods

The next set of challenges/lessons will have to do with high order array methods such as map, filter, reduce, sort, etc. Even though most of these can be done with a for loop, I want you to practice using these methods.

1. Simple Examples
2. Sum Of Even Squares
3. Calculate Total Sales
4. Highest Scoring Word
5. Valid Anagrams
6. HashTag Generator
7. Valid IPv4 Address
8. Analyze Car Milage
9. Password Validator
10. Find Missing Letter Refactor

04. Recursion

The next batch of challenges/lessons will have to do with recursion. We will first talk about what recursion is and then we can look at some challenges.

1. Recursion Intro (Count Down)
2. Unwinding (Sum Up To)
3. Reverse String Recursion
4. Fibonacci Sequence
5. Factorial
6. Power
7. Array Sum
8. Number Range
9. Flatten Array
10. Permutations

05. Complexity

This is more of a learning section than a challenge section. We will talk about Big O notation and how to calculate the time complexity of an algorithm. We will also talk about space complexity and how to calculate that as well. We will talk about the different types of complexity such as constant, linear, quadratic, etc.

1. What Is Time Complexity?
2. Big O Notation
3. Constant Time Complexity
4. Linear Time Complexity
5. Quadratic Time Complexity
6. Logarithmic Time Complexity
7. Space Complexity
8. Max Subarray Quadratic
9. Sliding Window Technique
10. Space Complexity

06. Hash Tables, Maps & Sets

In this section, we will start to look at data structures. We will start with a data structure called a hash table. This will include maps and sets, which are built-in JavaScript data structures that are similar to hash tables. We will also create a custom hash table class and use it in a couple challenges.

1. What Are Data Structures?
2. Hash Table Intro
3. Maps
4. Word Frequency Counter
5. Phone Number Directory
6. Anagram Grouping
7. Sets
8. Symmetric Difference
9. Two Sum
10. Longest Consecutive
11. Custom Hash Table
12. Word Instance Counter
13. Add getValues() Method
14. Add getValues() Method

07. Stacks, Queues & Linked Lists

In this section, we will look at working with data structures such as stacks, queues, and linked lists. We will also look at fast and slow pointers.

1. What Is A Stack?
2. Stack Implementation
3. Reverse String With Stack
4. Balanced Parentheses
5. What Is A Queue?
6. Queue Implementation
7. Reverse String With Queue
8. Palindrome With Queue & Stack
9. What Is A Linked List?
10. Linked List Implementation
11. Reverse String With Linked List
12. Fast & Slow Pointers
13. Find Middle
14. What Is A Doubly Linked List?
15. Doubly Linked List Implementation
16. Find Pair Sum

08. Binary Trees & Binary Search Trees & Graphs

In this section, we will look at trees and graphs. We will start with binary trees and binary search trees. We will also look at graphs and graph traversal.

1. What Is A Tree?
2. Tree Node Class
3. Depth First Traversal
4. Depth First Traversal Recursive
5. Breadth First Traversal
6. Maximum Depth
7. What Is A Binary Search Tree?
8. Binary Search Tree Implementation
9. Validate BST
10. What is a Graph?
11. Adjacency Matrix & Adjacency List
12. Graph Implementation
13. Graph Traversal
14. Graph Depth First Traversal
15. Graph Breadth First Traversal

09. Sorting Algorithms

In this section, we will get into sorting algorithms. We will start with bubble sort, which is very popular in interviews. We will also look at selection sort, insertion sort, merge sort, and quick sort.

1. What Are Sorting Algorithms?
2. Bubble Sort Algorithm
3. Bubble Sort Implementation
4. Insertion Sort Algorithm
5. Insertion Sort Implementation
6. Selection Sort Algorithm
7. Selection Sort Implementation
8. Merge Sort Algorithm
9. Merge Sort Implementation
10. Quick Sort Algorithm
11. Quick Sort Implementation