Introduction
Debugging Grimoire - The Tome Of Cursed Knowledge
1.
DevOps ☁️
1.1.
Set Up SSH for GitHub
1.2.
Minimal Docker Image for Ruby
1.3.
Deploying mdBook to Github Pages with GitHub Actions
1.4.
Cloud Run & GitHub Actions CI/CD Setup
1.5.
How to Use Google Cloud Domain Mapping to setup a Custom Domain to your container
1.6.
How to Host Images (or other files) on Google Cloud Storage
2.
Virtualization
2.1.
Set Up PostgreSQL in a Google Cloud VM using Docker Compose
2.2.
Create an HMAC Server API for the VM
2.3.
Set up a LAMP server
2.4.
Virt Manager Install on Arch Linux
2.5.
Using Virt Manager and Samba to retrieve old songs
3.
Linux 🐧
3.1.
Debian Firewall Configuration With nftables
3.2.
Arch Linux Ufw Configuration
3.3.
Linux Process Management
3.4.
Build Something From Source
4.
Database 🐘
4.1.
PostgreSQL Local Setup Guide
4.2.
How to Setup Rate Limiting in PostgreSQL
4.3.
How to Boot Up Redis on Debian
5.
General Cheat Sheet 💡
5.1.
NeoVim Cheat Sheet
5.2.
GitHub Cheat Sheet
5.3.
YAML Cheat Sheet
6.
Programming Languages 🖥️
6.1.
Bash 🐚
6.1.1.
Bash Completion Tool
6.1.2.
Grep Guide
6.1.3.
Curl Guide
6.1.4.
Example scripts
6.1.4.1.
Fizzbuzz but cursed
6.1.4.2.
DNA Hamming
6.1.4.3.
Bob
6.1.4.4.
Scrabble Score Counter
6.1.4.5.
Armstrong Numbers
6.2.
C 🏗️
6.2.1.
Debugging and Build Tools
6.2.1.1.
Usage of Makefiles
6.2.1.2.
Usage of GDB
6.2.1.3.
Usage of Valgrind
6.2.1.4.
Usage of GCC/Clang Sanitizer Flags
6.2.2.
Fundamentals
6.2.2.1.
Usage of enums
6.2.2.2.
Usage of cases (switch-case)
6.2.2.3.
Employee Salary and SSN Generator
6.2.2.4.
Sea Elephants Weight Generator
6.2.2.5.
Poker Monte Carlo Simulation
6.2.2.6.
Bubble Sort
6.2.2.7.
C as a CLI Tool
6.2.2.8.
File I/O and Rational Numbers
6.2.3.
Bitwise Operators
6.2.3.1.
Bitwise Pt. 1
6.2.3.2.
Bitwise Pt. 2
6.2.3.3.
Bitwise Pt. 3
6.2.4.
Data Structures
6.2.4.1.
Simple Linked List
6.2.4.2.
Working With Linked Lists
6.2.4.3.
Doubly Linked List and Merge Sort
6.2.4.4.
Binary Tree
6.2.5.
ncurses
6.2.5.1.
Getting Started
6.2.5.2.
User Input in Menu and Arrow Keys
6.2.5.3.
A Rogue Like Game Engine
6.2.5.4.
Input Modes, Color Witchcraft, Ctrl+char
6.2.5.5.
MenuBar with Submenus
6.2.5.6.
Utilities
6.2.5.7.
Color palettes, Chars and Lines
6.3.
C++ 🤖
6.3.1.
Fundamentals
6.3.1.1.
Structures
6.3.1.2.
Functions
6.3.1.3.
Parameter Passing Methods
6.3.1.4.
Array As Parameter
6.3.1.5.
Struct As Parameter
6.3.1.6.
Operator Overloading
6.3.2.
Pointers
6.3.2.1.
Pointers Intro
6.3.2.2.
Referencing
6.3.2.3.
Pointer to Struct
6.3.2.4.
Smart Pointers
6.3.3.
Templates
6.3.3.1.
Function Templates & Class Templates
6.3.3.2.
Template Type Deduction
6.3.3.3.
Template Type Parameters by Reference
6.3.3.4.
Template Specialization
6.3.3.5.
Variadic Templates
6.3.4.
Concepts
6.3.4.1.
Concepts Intro
6.3.4.2.
Build Your Own Concepts
6.3.4.3.
The Requires Clause
6.3.4.4.
Logical Combination of Concepts
6.3.4.5.
Concepts and Auto
6.3.5.
OOP
6.3.5.1.
Converting a C program to C++ OOP
6.3.5.2.
Monolithic Program to Modular C++ Class
6.3.5.3.
OOP with Scope Resolution Operators
6.3.5.4.
Deep Copy Constructor
6.3.5.5.
Inheritance and derived classes
6.3.5.6.
Inheritance and Polymorphism
6.3.5.7.
Virtual Function Behavior
6.3.5.8.
Shapes with OOP
6.3.6.
Lambdas
6.3.6.1.
Lambdas Intro
6.3.6.2.
Lambdas Capture Lists
6.3.6.3.
Lambdas Capture All In Context
6.3.6.4.
Functional Objects
6.3.7.
Move Semantics
6.3.7.1.
Move Semantics
6.3.7.2.
Move Semantics pt.2
6.3.8.
Algorithms & Data Structures
6.3.8.1.
Ordered Map & Unordered Map
6.3.8.2.
Tuples
6.3.8.3.
Recursion
6.3.8.3.1.
How Recursion works (tracing)
6.3.8.3.2.
How Recursion uses stack
6.3.8.3.3.
Time Complexity of Recursion
6.3.8.3.4.
Static and Global in Recursion
6.3.8.3.5.
Tail Recursion
6.3.8.3.6.
Head Recursion
6.3.8.3.7.
Tree Recursion
6.3.8.3.8.
Indirect Recursion
6.3.8.3.9.
Nested Recursion
6.3.8.3.10.
Sum of Natural Numbers
6.3.8.3.11.
Factorial
6.3.8.3.12.
Power
6.3.8.3.13.
Taylor Series
6.3.8.3.14.
Taylor Series (Horner)
6.3.8.3.15.
Fibonacci Series
6.3.8.3.16.
Combination Formula
6.3.8.3.17.
Tower of Hanoi
6.3.8.4.
Arrays
6.3.8.4.1.
Intro to Arrays
6.3.8.4.2.
Static vs Dynamic Arrays
6.3.8.4.3.
Increase Array Size
6.3.8.4.4.
2D Arrays
6.3.8.4.5.
Arrays in Compilers
6.3.8.4.6.
2D Arrays in Compilers
6.3.8.4.7.
3D / nD Arrays in Compilers
6.3.8.5.
Arrays ADT
6.3.8.5.1.
Display Array
6.3.8.5.2.
Inserting in Array
6.3.8.5.3.
Deleting from Array
6.3.8.5.4.
Linear & Binary Search
6.3.8.5.5.
Get, Set, Avg, Max
6.3.8.5.6.
Reverse & Shift
6.3.8.5.7.
Check sorted Arrays
6.3.8.5.8.
Merge Arrays
6.3.8.5.9.
Set Operations
6.3.8.5.10.
Menu Driver Program
6.3.8.5.11.
Menu Driver Program
6.3.8.5.12.
Convert C array Program to C++
6.3.9.
Multi-Threading
6.3.9.1.
Concurrency Intro
6.3.9.1.1.
Introduction
6.3.9.1.2.
Motivation
6.3.9.1.3.
Overview
6.3.9.1.4.
Threaded Program Structure
6.3.9.1.5.
History
6.3.9.1.6.
Launching a Thread
6.3.9.1.7.
Thread Function with Arguments
6.3.9.1.8.
Computer with Single Processor
6.3.9.1.9.
Computer with Single Processor and Cache
6.3.9.1.10.
Computer with Multiple Processors
6.3.9.1.11.
Synchronization Issues
6.3.9.2.
Getting Started with Threads
6.3.9.2.1.
System Thread Interface
6.3.9.2.2.
std::thread Class
6.3.9.2.3.
Managing a Thread
6.3.9.2.4.
Multiple Threads
6.3.9.2.5.
Data Races
6.3.9.2.6.
Data Race Consequences
6.3.9.3.
Working with Shared Data
6.3.9.3.1.
Critical Sections
6.3.9.3.2.
Mutex Introduction
6.3.9.3.3.
Mutex Class
6.3.9.3.4.
Internally Synchronized Class
6.3.9.3.5.
std::lock_guard
6.3.9.3.6.
std::unique_lock
6.3.9.3.7.
Timeouts and Mutexes
6.3.9.3.8.
Multiple Reader, Single Writer
6.3.9.3.9.
Shared Mutex
6.3.9.3.10.
Shared Data Initialization
6.3.9.3.11.
Thread Local Data
6.3.9.3.12.
Lazy Initialization
6.3.9.3.13.
Double-checked Locking
6.3.9.3.14.
Deadlock
6.3.9.3.15.
Deadlock Practical
6.3.9.3.16.
Deadlock Avoidance
6.3.9.3.17.
Deadlock Avoidance Practical
6.3.9.3.18.
Livelock
6.3.9.3.19.
Livelock Practical
6.3.9.4.
Thread Synchronization
6.3.9.4.1.
Thread Coordination
6.3.9.4.2.
Thread Coordination Practical
6.3.9.4.3.
Condition Variables
6.3.9.4.4.
Condition Variables w Predicate
6.3.9.4.5.
Condition Variables Practical
6.3.9.4.6.
Future & Promises
6.3.9.4.7.
Future & Promises Class
6.3.9.4.8.
Future & Promises Examples
6.3.9.4.9.
Promises and Multiple Waiting Threads
6.3.9.5.
Atomic
6.3.9.5.1.
Integer Operations and Threads
6.3.9.5.2.
Atomic Types
6.3.9.5.3.
Atomic Operations
6.3.9.5.4.
Lock-free Programming
6.3.9.5.5.
Lock-free Programming Practical
6.3.9.6.
Asychronous
6.3.9.6.1.
Asychronous Programming
6.3.9.6.2.
Packaged Task
6.3.9.6.3.
Async Function
6.3.9.6.4.
Async and Launch Options
6.3.9.6.5.
Choosing Thread Object
6.3.9.7.
Parallelism
6.3.9.7.1.
Overview
6.3.9.7.2.
Data Parallelism
6.3.9.7.3.
Standard Algorithms
6.3.9.7.4.
Execution Policies
6.3.9.7.5.
Algo & Exec Policies
6.3.9.7.6.
New Parallel Algorithms
6.3.9.7.7.
Parallel Algorithms Practical
6.3.9.8.
Data Structures for Concurrency
6.3.9.8.1.
Data Structures & Concurrency
6.3.9.8.2.
Shared Pointer
6.3.9.8.3.
Monitor Class
6.3.9.8.4.
Semaphore
6.3.9.8.5.
Concurrent Queue
6.3.9.8.6.
Concurrent Queue w Condition Variable
6.3.9.8.7.
Thread Pools
6.3.9.8.8.
Thread Pools Implementation
6.3.9.8.9.
Thread Pools Multiple Queues
6.3.9.8.10.
Thread Pools Work Stealing
6.3.10.
Example Algorithms
6.3.10.1.
Non Mutating Algorithm: find()
6.3.10.2.
Bidirectional iterator: is_palindrome
6.3.10.3.
Dijkstra's algorithm
6.3.10.4.
Output a Random Graph
6.3.10.5.
Poker Monte Carlo Simulation
6.3.10.6.
Kruskal's MST
6.3.10.7.
Depth First vs. Breadth First Search
6.3.10.8.
Alpha Beta Pruning
6.3.10.9.
Reverse Polish Notation
6.3.10.10.
Referential Garbage Collection
6.3.11.
Libraries
6.3.11.1.
The Boost Library
6.3.11.1.1.
Boost.filesystem: Printing Stats About Files and Directories
6.3.11.1.2.
Boost.Asio: TCP Daytime Client
6.3.11.1.3.
Boost.Asio: TCP Daytime Server
6.3.11.1.4.
Boost.Asio: UDP Daytime Client
6.3.11.1.5.
Boost.Asio: UDP Daytime Server
6.4.
Common Lisp 👽
6.4.1.
Run Code From the Terminal
6.4.2.
Portacle / Emacs
6.4.3.
Lisp Basics
6.4.3.1.
Lisp Syntax & Eval Model
6.4.3.2.
Variables
6.4.3.3.
Conditionals
6.4.4.
Data Structures
6.4.4.1.
Create Lists, plists, alists
6.4.4.2.
List Manipulation
6.4.4.3.
Working with Strings
6.4.4.4.
Arrays & Vectors
6.4.4.5.
The Cons cell
6.4.4.6.
Compound Data Structures, test and key
6.4.4.7.
Hash Tables
6.4.5.
Iteration
6.4.5.1.
List & Vector Iteration
6.4.5.2.
Hash Table Iteration
6.4.5.3.
Fixed / Infinite Iteration
6.4.6.
All About Functions
6.4.6.1.
Named Functions
6.4.6.2.
Funcall and Apply
6.5.
Go 🐹
6.5.1.
The Birthday Paradox
6.5.2.
Rock Paper Scissors
6.5.3.
Employee Salary Parser
6.5.4.
Mergesort Algorithm
6.5.5.
Straight Flush Calculation
6.5.6.
Doubly Linked List and Palindrome Checker
6.5.7.
3D Shape Calculator Using Interfaces
6.5.8.
Philosopher's Problem
6.5.9.
Genstack and Testing in Go
6.5.10.
Dijkstra's Algorithm in Go
6.6.
Haskell 🧙
6.6.1.
Fundamentals
6.6.1.1.
Fundamentals
6.6.1.2.
Basic Types
6.6.1.3.
Basic Types 2
6.6.2.
Functions
6.6.2.1.
Introduction to Functions
6.6.2.2.
Function Definition with Patterns
6.6.2.3.
Function Definition with Guards
6.6.2.4.
Local Definitions
6.6.2.5.
Function Currying
6.6.2.6.
Solved Functions
6.6.3.
Tuples
6.6.3.1.
Introduction to Tuples
6.6.3.2.
Access to Tuples
6.6.3.3.
Decomposition of Tuples into Patterns
6.6.3.4.
Empty Tuples
6.6.4.
Lists
6.6.4.1.
Introduction to Lists
6.6.4.2.
Construction and Implementation
6.6.4.3.
Lists and Patterns
6.6.4.4.
Syntax in Patterns
6.6.4.5.
Texts
6.6.4.6.
Common List Functions
6.6.4.7.
Solved List Functions
6.6.5.
Higher Order Functions
6.6.5.1.
Introduction to HOF
6.6.5.2.
Anonymous Functions
6.6.5.3.
Sections
6.6.5.4.
Solved Higher Order Functions - Pt.1
6.6.5.5.
Solved Higher Order Functions - Pt.2
6.6.6.
Infinite Lists
6.6.6.1.
Solved Infinite Lists Functions
6.6.7.
Types and Typeclasses
6.6.7.1.
Introduction to Types and Typeclasses
6.6.7.2.
Custom Data Types
6.6.8.
Binary Trees
6.6.8.1.
Fundamentals of Binary Trees
6.6.8.2.
Solved Binary Trees Problems
6.7.
Python 🐍
6.7.1.
Fundamentals
6.7.1.1.
User Input
6.7.1.2.
Lists
6.7.1.3.
List Operations
6.7.1.4.
Loops
6.7.1.5.
Tuples
6.7.1.6.
Dicts
6.7.1.7.
Dict Operations
6.7.1.8.
Sets
6.7.1.9.
Unpacking
6.7.1.10.
Generators
6.7.1.11.
OOP
6.7.1.12.
Imports
6.7.1.13.
Error Handling
6.7.1.14.
Function Decorators
6.7.1.15.
Lambdas
6.7.2.
Working with Python Projects
6.7.2.1.
Using pip and venv
6.7.2.2.
Setting up Poetry
6.7.2.3.
Setting up UV
6.7.2.4.
Python Repository Setup
6.7.3.
Standard Library
6.7.3.1.
Typing Library: Type Hints
6.7.3.2.
Itertools
6.7.3.3.
Itertools pt.2
6.7.3.4.
Itertools pt.3
6.7.3.5.
Functools: Caching
6.7.3.6.
Functools: Partial & Reduce
6.7.3.7.
Functools: Wrappers
6.7.3.8.
Functools: Dispatches and Ordering
6.8.
Ruby 💎
6.8.1.
Ruby Fundamentals
6.8.2.
OOP
6.8.3.
:params vs @instance_variables
6.8.4.
Ruby's Functional Paradigms
6.8.5.
Setup a Redis Rate Limiter Middleware in Ruby
6.8.6.
Use SQLite as Your Rate Limiter in Ruby
6.8.7.
Quick Sinatra Setup
6.8.8.
ERB with HTMX
6.8.9.
Clean Pagination in Sinatra
6.9.
SQL 📊
6.9.1.
Part 1 - Fundamentals
6.9.2.
Part 2 - GROUP BY
6.9.3.
Part 3 - JOIN
6.9.4.
Part 4 - CASE
6.9.5.
Part 5 - Subqueries
Light
Rust
Coal
Navy
Ayu
Debugging Grimoire
All About Functions
Named Functions
1.1. Return values
1.2. Default arguments
1.3. Optional arguments
1.4. Named arguments
Funcall and Apply
Multiple return values
Higher order functions
Closures
setf functions
Generic functions (CLOS)