BioPlayground

WetBench DryBench DevBench

Learning navigator

DryBench

Platform

Bio-Lounge Lab Oracle Bio News Bio Industry Bio-Toolkit AI Tools Tools Hub Bio-Sandbox Failure Museum Healing Lab Trouble Lab 💬Lounge Talk 🔧Lab Maintenance Language Hub

Three benches

WetBench DryBench DevBench

Tracks and articles

Biostatistics with Python33

Fullstack Development55

01What is a Data Structure — and Why is it Important?02Array vs Linked List 03Stack and Queue — LIFO vs FIFO 04Hash Table — The Principle of Dictionaries 05Big-O Notation — Talking About Performance with Numbers 06Sorting Algorithms — Bubble, Selection, Merge 07Recursive Function — A Function That Calls Itself 08Binary and Computational Thinking 09Compilation Process — From Source Code to Executable 10Integer Overflow and Floating-Point Limitations 11Contiguous Memory and Array Indexing O(1)12Binary Search — A Fast Way to Search Sorted Data 13Pointers and Memory Addresses 14Dynamic Memory Allocation — malloc and free 15Binary Search Tree (BST)16Trie — A String-Specific Data Structure 17Heap — The Principle of Priority Queues 18Exhaustive Search — Brute Force 19Greedy Algorithm 20Dynamic Programming — DP and Memoization 21DFS/BFS — Depth-First vs. Breadth-First 22Graph — Adjacency Matrix vs. Adjacency List 23Space Complexity — How Much Memory Does It Use?

BioPlayground home