Computer Science: Core Concepts
by FlashQuest
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.
♦ More Technology
More Technology on the Table
Tech Acronyms Decoded
FlashQuestDecode the alphabet soup of tech: API, CPU, DNS, JSON, VPN, and a dozen more acronyms you see every day.
Python Basics: Syntax & Core Concepts
FlashQuestThe Python fundamentals every beginner needs: data types, control flow, functions, and the built-ins you reach for daily. Written from the official python.org documentation.
Git Commands Every Dev Knows
FlashQuestThe everyday Git commands you'll actually type: staging, committing, branching, stashing, and syncing with remotes.
Study it properly.
Free on iPhone and iPad, with scheduling that remembers exactly which cards you struggle with.
