Dashboard Library Review2134 Progress Certificates

Computer Science Foundations

Programming Languages

JavaScript Fundamentals0/24

Core CS Theory

Data structures & algorithms0/23

OOP & design patterns0/23

Functional Programming Concepts0/20

Operating Systems Fundamentals0/20

Engineering Practice

Software Engineering Fundamentals0/20

Networking Fundamentals0/20

Linux & the Command Line0/20

Frontend Engineering

React & Next.js0/18

CSS & Modern Styling0/18

UI/UX for Developers0/12

Mobile Development0/12

Backend Engineering

Core Backend

Node.js & Backend JavaScript0/18

Databases & SQL0/16

Engineering Practice

Git & Version Control0/14

Testing & QA0/18

Security

Cryptography Fundamentals0/12

Auth, Authorization & Multi-Tenancy0/17

Web Security Fundamentals0/18

Application Security & Secure Coding0/12

Cloud, Infrastructure & DevOps

Cloud Platforms

Cloud Computing & Infrastructure0/19

Containers & Orchestration

Docker & Containers0/12

Delivery & Operations

CI/CD & Deployment Pipelines0/12

Observability & Monitoring0/12

Deployment Platforms

Domain Names, DNS & Subdomains0/12

Systems & Architecture

System design & architecture0/18

Distributed Systems Fundamentals0/12

Message Queues & Event-Driven Architecture0/12

Caching Strategies0/12

AI & Machine Learning

AI & ML Fundamentals0/12

AI Agents & LLM Integration0/17

Platform & Product Integrations

WhatsApp & Meta Platform Integrations0/19

Payments & Financial Systems0/12

Process, Career & Delivery

Agile & Project Management0/14

Interviewing & Career Growth0/12

Built by Mohamed Salem

Loading domain…

Dashboard Library Review2134 Progress Certs

Data structures & algorithms

The patterns that show up over and over — arrays, hash maps, trees, and how to recognize which one fits.

23 lessons

Study 86 cards for this domain

Beginner

Big-O intuition — what the notation is actually telling youBeginner3 min read·Not started Arrays and strings — the basicsBeginner4 min read·Not started Linked lists — the basicsBeginner3 min read·Not started Basic sorting — how sorting actually worksBeginner4 min read·Not started Stacks and queues — the basicsBeginner4 min read·Not started Hash maps — the basicsBeginner4 min read·Not started Trees — the basicsBeginner4 min read·Not started

Intermediate

The hash map pattern — turning O(n^2) into O(n)Intermediate3 min read·Not started Two pointers and sliding window, worked through a real problemIntermediate3 min read·Not started Recursion and the call stackIntermediate4 min read·Not started Graphs, BFS, and DFSIntermediate5 min read·Not started Heaps and priority queuesIntermediate5 min read·Not started Greedy algorithms — and when the locally best choice isn't enoughIntermediate5 min read·Not started Backtracking — trying, and un-tryingIntermediate4 min read·Not started Tries — trees built for prefixesIntermediate4 min read·Not started Bit manipulation — the tricks that show up repeatedlyIntermediate4 min read·Not started Union-Find (Disjoint Set) — answering 'are these connected' fastIntermediate4 min read·Not started Topological sort — ordering nodes so every dependency comes firstIntermediate5 min read·Not started The intervals pattern — merging, scheduling, and overlap problemsIntermediate4 min read·Not started The monotonic stack pattern — next greater/smaller element, in one passIntermediate4 min read·Not started

Advanced

Binary search, beyond sorted arraysAdvanced3 min read·Not started Dynamic programming — from recursion to tabulationAdvanced4 min read·Not started Dijkstra's algorithm — shortest paths when edges have different costsAdvanced4 min read·Not started