Core Computer Science & Data Structures

Big-O complexity, memory layouts, arrays, linked lists, hash tables, trees, graphs, and algorithmic problem-solving.

2 weeks · wk 1–2Core / deep pace8 topics24 Interview Questions

Why this pace:In an era dominated by AI coding assistants, foundational computer science is more critical than ever. Master Big-O, data structures, and algorithmic complexity to evaluate and audit AI-generated code.

SEC FOCUS

Guard against algorithmic complexity attacks (ReDoS, quadratic nested loops, hash collisions) that cause denial-of-service in production.

Topics & Action Items (8)

Big O Notation & Complexity Analysis

3 hrs

Stacks and Queues

2.5 hrs

Linked Lists

2.5 hrs

Sets and Hash Tables

3 hrs

Trees and Graphs

3.5 hrs

Searching and Sorting

3 hrs

Two Pointers and Sliding Window

2.5 hrs

Dynamic Programming Basics

3 hrs

Next Stage

Writing Better Code & Software Design