No idea how to get ready for coding interviews? The answer lies in understanding practical benefits of an age-old computer science 101 topic: data structures.

This class covers a must-know topic for every programmer: data structures. We’ll cover several concepts and takeaways:

How to analyze and understand algorithm “efficiency” using orders of growth analysis
Commonly-used data structures: stacks, queues, linked lists, trees, hash maps
Analysis of data structure algorithms: insertion, deletion, search, and access
Practical implications of data structures strengths and weaknesses
28 in-depth interview-style practice questions
20 interview tips

The class is highly interactive, as we’ll be coding together. By the end of this class, you’ll gain data structures know-how, learning the fundamentals and understanding practical implications. Most importantly, you’ll have interview-style practice under your belt.

Interested in creative coding? Check out my VR101 (AFrame) class.

Interested in data science or machine learning? Check out my Coding 101 (Python), OOP 101 (Python), SQL 101 (Database Design), Data 101 (Analytics), or Computer Vision 101 (Applied ML) classes.

ARPITA DAS

--

2