Skip to content

Latest commit

 

History

History
56 lines (49 loc) · 2.83 KB

README.md

File metadata and controls

56 lines (49 loc) · 2.83 KB

Exercises for Intro to Algorithms and Data Structures in JavaScript

Welcome to the exercises. This is where the magic happens!

Monday - June 13th

  1. Implement a stack data structure:
  1. Create a queue data structure:
  1. Start off with some intro to recursion problems
  1. If you want a challenge, attempt some popular recursion interview questions:

Tuesday - June 14th

  1. Implement the elementary sorting algorithms (bubble, insertion, selection):
  1. Implement Mergesort
  1. Implement Quicksort
  1. [Bonus] Try out Heapsort

###Wednesday - June 15th

  1. Implement a Linked List:
  1. Create a tree data structure:
  1. This is a catch up day so use the rest of the afternoon to finish up exercises from previous days and review anything that was confusing.

Thursday - June 16th

  1. Binary Search Tree
  1. Binary Search Array

Friday - June 17th

  1. Binary Search Tree (delete nodes)
  1. Implement a graph
  1. DFS for graph
  1. BFS for graph
  1. [Bonus] BFS/DFS for tree

Saturday - June 18th

  1. Create your own Hash Tables! Watch out for those collisions!