Some Key Takeaways!
By coding along with us in the Workshop, you’ll:
Algorithms and Big O Analysis
Sorting: Bubble, Insertion, Merge & Quick
Data Structures: Stacks, Queues and Priority Queues, Maps and Sets, Hash Tables, Array Lists, Linked Lists, Binary Search Trees & AVL Trees
Functional Programming 101: Map, Reduce & Filter
Bloom filters, Tree traversals, Path finding, Maze generation, and Graphs
NP (nondeterministic polynomial time), NP-Hard, NP-Complete problems (like traveling salesman)