Data Structures & Algorithms At-a-Glance
154+
Questions
45+
Hours of Content
8
Programming Languages
15
Essential Categories
Your Software Engineering Interview Toolkit
Handpicked Problems
We teach you the most important concepts in the fewest questions. We have taught this curriculum 3-times over and weave related concepts between topics effectively.
Full Coding Environment
We support the most popular programming languages so you can get hands-on experience implementing solutions to each problem. The best way to learn is by doing.
AI Teaching Assistant
Have a context-aware AI-assistant on standby to help you as you study. Your assistant will be aware of the problem, solutions, your workspace code, any active errors, and more. Ask it anything!
Optimal Solutions
We provide solutions to all problems we teach. We start with the brute force & incrementally reach an optimal solution. Solutions are translated into multiple languages.
154+ Exceptional Explanations
We offer a sizable amount of high-signal content. Our library took nearly a year to aggregate in-full.
Live Library
We are constantly editing, pruning, & expanding our content library. Each content item takes 4-8 hours to produce. We are constantly going to work to make the library better.
1-1 Problem Support
Join our Discord to receive peer & instructor support. When you get stuck there is always someone to help you continue forward.
Exceptional Video Explanations
Challenging topics need clear, methodical, explanations. You have to do the actual math, you have to go deep into the why behind approaches.
This is why we take a ground-up approach to any concept we teach so it just “clicks” in our students’ minds.
We see every lesson as a conversation. Taking a student from beginner to advanced understanding incrementally.
Watch Demo
Table of Contents
Problem Introduction
0:00
Initial Thoughts
3:14
Decision Tree
4:27
Some Observations
7:31
Simulating an Optimal Game
8:12
Implementation: Simulating All Decisions
10:52
Complexities (Simulating Decisions)
15:42
Simulating Optimal Play
16:28
Recurrence
18:52
The Global Subproblem
23:09
Concrete Walkthrough
23:28
The Top-Level Decision
27:37
The Core Idea
30:05
Implementation: Optimal Play
30:19
Complexities (Optimal Play)
32:50
Recap
34:18
Context-Aware AI Teaching Assistant
Stuck on a problem? Curious how a solution works, or just want a deeper understanding? Talk to your own personalized AI teaching assistant.
Have a 1-1 conversation with a context-aware AI briefed on your code, the problem statement, any errors you are facing, potential solutions, & more.
24/7, 365, you can ask your assistant questions as you learn.
Content Overview
Data Structures & Algorithms Library
Time & Space Complexities
10 videos
Primitives
6 videos
Arrays
7 videos
Strings
8 videos
Linked Lists
12 videos
Stacks & Queues
5 videos
Trees
18 videos
Heaps
6 videos
Searching
5 videos
Hashtables
7 videos
Sorting
8 videos
Recursion & Backtracking
11 videos
Dynamic Programming
18 videos
Greedy Algorithms
9 videos
Graphs
14 videos
Time & Space Complexities, Simplified.
Every solution we offer is annotated with time & space complexity bounds.
Every video we deep dive into the full derivation of upper (and lower bounds) when necessary.
You will walk away equipped & confident in your ability to reason about any problem’s time & space complexity bounds.
Watch Demo
Big O Complexities
Horrible
Bad
Fair
Good
Excellent
Interview Pen played a huge role in finalizing my understanding of many concepts I faced in my technical interview rotations.
