- Challenge 2: Array Shift
- Challenge 3: Array Binary Search
- Challenge 5: Linked List - Implementation
- Challenge 6: Linked List - Append & insert before/after
- Challenge 7: Linked List - Kth from the End
- Challenge 8: Linked List - Zip List
- Challenge 10: Stacks and Queues - Implementation
- Challenge 11: Queue with Stacks
- Challenge 12: Queue with Queues - FIFO Animal Shelter
- Challenge 13: Mulit Bracket Validation
- Challenge 15: Binary Tree and BST Implementation
- Challenge 16: Find the Maximum Value in a Binary Tree
- Challenge 17: Breadth Search First
- Challenge 18: FizzBuzz Tree
- Challenge 26: Insertion Sort
- Challenge 27: Merge Sort
- Challenge 28: Quick Sort
- Challenge 34: Hash Table Implementation
- Challenge 36: Repeated Word
- Challenge 37: Left Join
- Challenge 1 - forEach
- Challenge 2 - Pass by value, pass by reference
- Challenge 3 - Sort
- Challenge 4 - Regular Expressions, Part 1
- Challenge 5 - Split, join, slice, splice
- Challenge 6 - Object.key, Object.values, Object.entries
- Challenge 7 - Map
- Challenge 8 - Filter
- Challenge 9 - Reduce
- Challenge 10 - Chaining Methods
- Challenge 11 - Regular Expressions, Part 2
- Challenge 12 - Two-dimensional arrays
- Challenge 13 - Includes, every, substring, charAt
- Challenge 14 - Everything
See setup instructions, in the Code 301 Setup Guide.