DS16 Code-Along Sessions

Code-Alongs are live experiences taught by our expert instructors designed to prepare you for concepts found in the sprint challenges. Code-Alongs are your opportunity to work on complex job-ready problems in a live and engaging environment.

Code-Alongs are live classes 50 minutes in length designed to offer deeper insights into learning your core competencies and are offered seven days a week in the morning, afternoon, and evening.

Because Code-Alongs delve deeper into a core competency, you will need to come to class prepared to have the best experience.

You are almost finished with your track-specific studies, congratulations on getting this far!

This sprint is dedicated to practicing the skills you have already explored. Please repeat as many live Code-Alongs sessions as needed to help you prepare for the coding assessment this sprint.

The best Code-Along experiences happen when you are ready before coming to class. Your instructors created a starting point and a solution for each of your Code-Alongs to ensure you have what you need to succeed.

Ideal Code-Along Preparation Checklist:

• Did you review the core competencies before coming to class?
• Did you watch the guided projects before coming to class?
• Did you take the checks for understanding before coming to class?
• Did you finish your module projects before coming to class?

Overview

This Code-Along focuses on array manipulation and the sliding window technique, which are common patterns in technical interview questions. You'll learn how to approach problems requiring efficient traversal and processing of arrays.

What You'll Learn

• Efficient array manipulation techniques
• Implementing the sliding window algorithm
• Optimizing solutions for time and space complexity
• Common array-based interview problem patterns

Code-Along Resources

Preparation

Before the Code-Along, please:

1. Fork and clone the starter repository
2. Review array operations and their time complexities
3. Practice basic array manipulation problems on LeetCode

Overview

In this Code-Along, we'll dive deep into algorithm efficiency analysis using Big O notation and explore caching techniques to optimize solutions. These concepts are crucial for performing well in technical interviews and coding assessments.

What You'll Learn

• How to analyze time and space complexity using Big O notation
• Implementing effective caching strategies
• Optimizing algorithms for performance
• Trade-offs between different algorithmic approaches

Code-Along Resources

Preparation

Before the Code-Along, please:

1. Complete Code-Along 1 first
2. Fork and clone the starter repository
3. Review common time complexity classes (O(1), O(n), O(n²), etc.)
4. Familiarize yourself with basic memoization concepts

Algorithm Practice

Learning Resources