DISCIPLINE

ACTIVE_TRACKS [2/2]

RUNNING...
PROGRESS: 25%
[X] Welcome [DELETE]
[X] Who is this course for? [DELETE]
[X] Course Outline [DELETE]
[X] Course Notes [DELETE]
[X] Download all slides [DELETE]
[X] source code and references [DELETE]
[X] Backend Communication Design Patterns Intro [DELETE]
[X] Request Response [DELETE]
[X] Synchronous vs Asynchronous workloads [DELETE]
[X] Push [DELETE]
[X] Polling [DELETE]
[ ] Long Polling [DELETE]
[ ] Server Sent Events [DELETE]
[ ] Publish Subscribe (Pub/Sub) [DELETE]
[X] Multiplexing vs Demultiplexing (h2 proxying vs Connection Pooling) [DELETE]
[X] Stateful vs Stateless [DELETE]
[X] Sidecar Pattern [DELETE]
[X] Protocols Intro [DELETE]
[X] Protocol Properties [DELETE]
[X] OSI Model [DELETE]
[X] Internet Protocol [DELETE]
[X] UDP [DELETE]
[ ] TCP [DELETE]
[ ] TLS [DELETE]
[ ] HTTP/1.1 [DELETE]
[ ] HTTPS [DELETE]
[ ] TLS [DELETE]
[ ] Keys and Certificates [DELETE]
[ ] WebSockets [DELETE]
[ ] HTTP/2 [DELETE]
[ ] HTTP/3 [DELETE]
[ ] gRPC [DELETE]
[ ] WebRTC [DELETE]
[ ] HTTPS Communication Basics Intro [DELETE]
[ ] HTTPS over TCP with TLS 1.2 [DELETE]
[ ] HTTPS over TCP with TLS 1.3 [DELETE]
[ ] HTTPS over QUIC (HTTP/3) [DELETE]
[ ] HTTPS over TFO with TLS 1.3 [DELETE]
[ ] HTTPS over TCP with TLS 1.3 and 0RTT [DELETE]
[ ] HTTPS over QUIC with 0RTT [DELETE]
[ ] Backend Execution Patterns Intro [DELETE]
[ ] The Process and The Thread and how they compete for CPU time [DELETE]
[ ] How The Backend Accepts Connections [DELETE]
[ ] Reading and Sending Socket Data [DELETE]
[ ] The Listener [DELETE]
[ ] The Acceptor and the Reader [DELETE]
[ ] Single Listener [DELETE]
[ ] Acceptor and Reader Thread Execution Pattern [DELETE]
[ ] Single Listener [DELETE]
[ ] Acceptor and Multiple Readers Thread Execution Pattern [DELETE]
[ ] Single Listener [DELETE]
[ ] Acceptor [DELETE]
[ ] Reader with Message Load Balancing Execution Pattern [DELETE]
[ ] Multiple Accepter Threads on a Single Socket Execution Pattern [DELETE]
[ ] Multiple Listeners [DELETE]
[ ] Acceptors and Readers with Socket Sharding Execution Pattern [DELETE]
[ ] Backend Idempotency [DELETE]
[ ] Nagle's Algorithm [DELETE]
[ ] When do you use threads? [DELETE]
[ ] Proxy vs Reverse Proxy [DELETE]
[ ] Layer 4 vs Layer 7 Load Balancers [DELETE]
[ ] WebSocket Proxying [DELETE]
[ ] How ChatGPT uses Server Sent Events [DELETE]
[ ] How I design software [DELETE]
[ ] The Journey of a Request to the Backend [DELETE]
[ ] The Journey of a Request to the Backend (Video) [DELETE]
[ ] JSON Web Token (JWT) [DELETE]
[ ] its Pros and Cons [DELETE]
[ ] SELECT COUNT (*) can impact your Backend Application performance [DELETE]
[ ] here is why [DELETE]
[ ] How does the Kernel manage backend connections? [DELETE]
[ ] Running out of TCP Ports [DELETE]
[ ] Postgres failure caused by a Cisco router (TCP issue) [DELETE]
[ ] Building Secure Backend Applications (OWASP recommendations) [DELETE]
↳ SELECTED:
RUNNING...
PROGRESS: 18%
[X] Before Starting [DELETE]
[X] 0.1 About This Book [DELETE]
[X] 0.2 How to Use This Book [DELETE]
[X] 0.3 Summary [DELETE]
[X] 1.1 Algorithms Are Everywhere [DELETE]
[X] 1.2 What Is an Algorithm [DELETE]
[X] 1.3 Summary [DELETE]
[X] 2.1 Algorithm Efficiency Evaluation [DELETE]
[X] 2.2 Iteration and Recursion [DELETE]
[X] 2.3 Time Complexity [DELETE]
[X] 2.4 Space Complexity [DELETE]
[X] 2.5 Summary [DELETE]
[X] 3.1 Classification of Data Structures [DELETE]
[X] 3.2 Basic Data Types [DELETE]
[X] 3.3 Number Encoding * [DELETE]
[X] 3.4 Character Encoding * [DELETE]
[ ] 3.5 Summary [DELETE]
[ ] 4.1 Array [DELETE]
[ ] 4.2 Linked List [DELETE]
[ ] 4.3 List [DELETE]
[ ] 4.4 Memory and Cache * [DELETE]
[ ] 4.5 Summary [DELETE]
[ ] 5.1 Stack [DELETE]
[ ] 5.2 Queue [DELETE]
[ ] 5.3 Double-Ended Queue [DELETE]
[ ] 5.4 Summary [DELETE]
[ ] 6.1 Hash Table [DELETE]
[ ] 6.2 Hash Collision [DELETE]
[ ] 6.3 Hash Algorithm [DELETE]
[ ] 6.4 Summary [DELETE]
[ ] 7.1 Binary Tree [DELETE]
[ ] 7.2 Binary Tree Traversal [DELETE]
[ ] 7.3 Array Representation of Tree [DELETE]
[ ] 7.4 Binary Search Tree [DELETE]
[ ] 7.5 AVL Tree * [DELETE]
[ ] 7.6 Summary [DELETE]
[ ] 8.1 Heap [DELETE]
[ ] 8.2 Building a Heap [DELETE]
[ ] 8.3 Top-K Problem [DELETE]
[ ] 8.4 Summary [DELETE]
[ ] 9.1 Graph [DELETE]
[ ] 9.2 Basic Operations on Graphs [DELETE]
[ ] 9.3 Graph Traversal [DELETE]
[ ] 9.4 Summary [DELETE]
[ ] 10.1 Binary Search [DELETE]
[ ] 10.2 Binary Search Insertion [DELETE]
[ ] 10.3 Binary Search Edge Cases [DELETE]
[ ] 10.4 Hash Optimization Strategy [DELETE]
[ ] 10.5 Search Algorithms Revisited [DELETE]
[ ] 10.6 Summary [DELETE]
[ ] 11.1 Sorting Algorithms [DELETE]
[ ] 11.2 Selection Sort [DELETE]
[ ] 11.3 Bubble Sort [DELETE]
[ ] 11.4 Insertion Sort [DELETE]
[ ] 11.5 Quick Sort [DELETE]
[ ] 11.6 Merge Sort [DELETE]
[ ] 11.7 Heap Sort [DELETE]
[ ] 11.8 Bucket Sort [DELETE]
[ ] 11.9 Counting Sort [DELETE]
[ ] 11.10 Radix Sort [DELETE]
[ ] 11.11 Summary [DELETE]
[ ] 12.1 Divide and Conquer Algorithms [DELETE]
[ ] 12.2 Divide and Conquer Search Strategy [DELETE]
[ ] 12.3 Building a Binary Tree Problem [DELETE]
[ ] 12.4 Hanoi Tower Problem [DELETE]
[ ] 12.5 Summary [DELETE]
[ ] 13.1 Backtracking Algorithm [DELETE]
[ ] 13.2 Permutations Problem [DELETE]
[ ] 13.3 Subset-Sum Problem [DELETE]
[ ] 13.4 N-Queens Problem [DELETE]
[ ] 13.5 Summary [DELETE]
[ ] 14.1 Introduction to Dynamic Programming [DELETE]
[ ] 14.2 Characteristics of Dynamic Programming Problems [DELETE]
[ ] 14.3 Dynamic Programming Problem-Solving Approach [DELETE]
[ ] 14.4 0-1 Knapsack Problem [DELETE]
[ ] 14.5 Unbounded Knapsack Problem [DELETE]
[ ] 14.6 Edit Distance Problem [DELETE]
[ ] 14.7 Summary [DELETE]
[ ] 15.1 Greedy Algorithm [DELETE]
[ ] 15.2 Fractional Knapsack Problem [DELETE]
[ ] 15.3 Maximum Capacity Problem [DELETE]
[ ] 15.4 Maximum Product Cutting Problem [DELETE]
[ ] 15.5 Summary [DELETE]
[ ] 16.1 Programming Environment Installation [DELETE]
[ ] 16.2 Contributing Together [DELETE]
[ ] 16.3 Terminology Table [DELETE]
↳ SELECTED:

QUEUED_BACKLOG

> PHP - back to the basics
> GOLANG — build web application with golang book
> C++ — the cherno
> Godot — 2d farming game crash course
> DATA COMMUNICATION — forouzan
> MATH — for developers / graphics development
> COMPUTER NETWORKS
> SOFTWARE GRAPHICS
> SOCKET PROGRAMMING
> RAW BACKEND — c++ backend projects from scratch
> OPENGL
> GIT — boot.dev
> HIGH PERFORMANCE SQLITE — https://databaseschool.com
> NGINX — Udemy
> NETWORKS — Udemy
> OS — Udemy
> DB — Udemy
> NODEJS — Docs
> ENCORE.GO
> DOCKER — boot.dev
> KUBERNETES — boot.dev
> HTMX

HOBBIES_&_SIDE_QUESTS

* CREATIVE CODING
* LEETCODE
[RESTORE_BACKUP] [EXPORT_DATA]