Computer Science: Core Concepts

by Dev Decks

16 cards intermediate

Big-O notation and the classic data structures: stacks, queues, heaps, hash tables, and trees, plus the algorithms built on them.

♠ Try 3 cards right here

What’s inside

What is the worst-case time complexity of binary search on a sorted array?: O(log n)
Which data structure serves elements in Last-In, First-Out (LIFO) order?: Stack
Which data structure serves elements in First-In, First-Out (FIFO) order?: Queue

16 cards in the full deck, free in the app with spaced repetition doing the scheduling.

Decode the alphabet soup of tech: API, CPU, DNS, JSON, VPN, and a dozen more acronyms you see every day.

Python's bread-and-butter syntax and built-ins: print, len, range, lists, dicts, strings, and the keywords that glue them together.

The everyday Git commands you'll actually type: staging, committing, branching, stashing, and syncing with remotes.

Free on iOS, with scheduling that remembers exactly which cards you struggle with.

Free on iOS · Android waitlist open