From fcdb8b84e7fb13cc401412ddaddbe7c0a6559b04 Mon Sep 17 00:00:00 2001
From: Anri Lombard <anri.m.lombard@gmail.com>
Date: Mon, 11 Jul 2022 23:30:55 +0200
Subject: [PATCH 001/127] Starting Afrikaans translation

---
 translations/README-af.md | 4 ++++
 1 file changed, 4 insertions(+)
 create mode 100644 translations/README-af.md

diff --git a/translations/README-af.md b/translations/README-af.md
new file mode 100644
index 0000000..c24e857
--- /dev/null
+++ b/translations/README-af.md
@@ -0,0 +1,4 @@
+# Kodering Universiteit
+
+Ek het oorspronklik dié as 'n kort om-te-doen lys van studie onderwerpe om 'n sagteware ingenieur te word gemaak,
+maar did het gegroei tot die groot lys wat jy vandag sien. Nadat ek dié studieplan gevolg het, [het Amazon my aangestel](https://startupnextdoor.com/ive-been-acquired-by-amazon/?src=ciu)!
\ No newline at end of file

From 148006d74376e5447cfb0c7bfaa3815c1705a208 Mon Sep 17 00:00:00 2001
From: Anri Lombard <anri.m.lombard@gmail.com>
Date: Tue, 12 Jul 2022 21:40:18 +0200
Subject: [PATCH 002/127] Lines 10/1996

---
 translations/README-af.md | 11 +++++++++--
 1 file changed, 9 insertions(+), 2 deletions(-)

diff --git a/translations/README-af.md b/translations/README-af.md
index c24e857..6588f68 100644
--- a/translations/README-af.md
+++ b/translations/README-af.md
@@ -1,4 +1,11 @@
 # Kodering Universiteit
 
-Ek het oorspronklik dié as 'n kort om-te-doen lys van studie onderwerpe om 'n sagteware ingenieur te word gemaak,
-maar did het gegroei tot die groot lys wat jy vandag sien. Nadat ek dié studieplan gevolg het, [het Amazon my aangestel](https://startupnextdoor.com/ive-been-acquired-by-amazon/?src=ciu)!
\ No newline at end of file
+> Ek het oorspronklik dié as 'n kort om-te-doen lys van studie onderwerpe om 'n sagteware ingenieur te word gemaak,
+> maar did het gegroei tot die groot lys wat jy vandag sien. Nadat ek dié studieplan gevolg het, [het Amazon my
+> aangestel](https://startupnextdoor.com/ive-been-acquired-by-amazon/?src=ciu)!
+> Jy hoef heel waarskynlik nie soveel soos ek te studeer nie. Maar alles wat jy nodig het is hier.
+> 
+> Ek het ongeveer 8-12 gestudeer elke dag, vir maande. Hier is my storie: [Hoekom ek vol-tyd gestudeer het, vir 8 maande, vir 'n Google onderhoud](https://medium.freecodecamp.org/why-i-studied-full-time-for-8-months-for-a-google-interview-cc662ce9bb13)
+> 
+> **Let asseblief op: ** Jy sal nie soveel soos ek hoef te studeer nie. Ek het baie tyd gemors op goed wat ek nie benodig het nie. Meer inligting daaroor onder. Ek sal jou help leer sonder om jou kosbare tyd te mors.
+> 
\ No newline at end of file

From 7f90596ceaf4e10492a8524b9eaa81726e713000 Mon Sep 17 00:00:00 2001
From: Anri Lombard <anri.m.lombard@gmail.com>
Date: Tue, 12 Jul 2022 21:44:46 +0200
Subject: [PATCH 003/127] Lines 20/1996

---
 translations/README-af.md | 11 ++++++++++-
 1 file changed, 10 insertions(+), 1 deletion(-)

diff --git a/translations/README-af.md b/translations/README-af.md
index 6588f68..15427bc 100644
--- a/translations/README-af.md
+++ b/translations/README-af.md
@@ -8,4 +8,13 @@
 > Ek het ongeveer 8-12 gestudeer elke dag, vir maande. Hier is my storie: [Hoekom ek vol-tyd gestudeer het, vir 8 maande, vir 'n Google onderhoud](https://medium.freecodecamp.org/why-i-studied-full-time-for-8-months-for-a-google-interview-cc662ce9bb13)
 > 
 > **Let asseblief op: ** Jy sal nie soveel soos ek hoef te studeer nie. Ek het baie tyd gemors op goed wat ek nie benodig het nie. Meer inligting daaroor onder. Ek sal jou help leer sonder om jou kosbare tyd te mors.
-> 
\ No newline at end of file
+>
+> Die items wat hier gelys is sal jou goed voorberei vir tegniese onderhoude by omtrent enige sagteware maatskappy,
+> insluitend die reuse: Amazon, Facebook, Google, en Microsoft.
+> 
+> *Sterkte!*
+
+<details>
+<summary>Vertalings:</summary>
+
+</details>
\ No newline at end of file

From 8facc8ae3fd53f0ca9e99d975c3542180641c76b Mon Sep 17 00:00:00 2001
From: Anri Lombard <anri.m.lombard@gmail.com>
Date: Tue, 12 Jul 2022 21:45:25 +0200
Subject: [PATCH 004/127] Lines 30/1996

---
 translations/README-af.md | 10 ++++++++++
 1 file changed, 10 insertions(+)

diff --git a/translations/README-af.md b/translations/README-af.md
index 15427bc..0f3c667 100644
--- a/translations/README-af.md
+++ b/translations/README-af.md
@@ -17,4 +17,14 @@
 <details>
 <summary>Vertalings:</summary>
 
+- [中文版本](translations/README-cn.md)
+- [Tiếng Việt - Vietnamese](translations/README-vi.md)
+- [Español](translations/README-es.md)
+- [Português Brasileiro](translations/README-ptbr.md)
+- [Polish](translations/README-pl.md)
+- [繁體中文](translations/README-tw.md)
+- [Japanese (日本語)](translations/README-ja.md)
+- [Russian](translations/README-ru.md)
+- [German](translations/README-de.md)
+- 
 </details>
\ No newline at end of file

From f66ab3be972f225b6139986445ea2856d110b36a Mon Sep 17 00:00:00 2001
From: Anri Lombard <anri.m.lombard@gmail.com>
Date: Tue, 12 Jul 2022 21:46:30 +0200
Subject: [PATCH 005/127] Lines 40/1996

---
 translations/README-af.md | 12 +++++++++++-
 1 file changed, 11 insertions(+), 1 deletion(-)

diff --git a/translations/README-af.md b/translations/README-af.md
index 0f3c667..045ea9a 100644
--- a/translations/README-af.md
+++ b/translations/README-af.md
@@ -26,5 +26,15 @@
 - [Japanese (日本語)](translations/README-ja.md)
 - [Russian](translations/README-ru.md)
 - [German](translations/README-de.md)
-- 
+- [Bahasa Indonesia](translations/README-id.md)
+- [ខ្មែរ - Khmer](translations/README-kh.md)
+- [Uzbek](translations/README-uz.md)
+- [Bulgarian](translations/README-bg.md)
+- [বাংলা - Bangla](translations/README-bn.md)
+
+</details>
+
+<details>
+<summary>Vertalings aan die gang:</summary>
+
 </details>
\ No newline at end of file

From 057e9172b5cfa24b7ee4f7e08f6d10a57dbd96a7 Mon Sep 17 00:00:00 2001
From: Anri Lombard <anri.m.lombard@gmail.com>
Date: Tue, 12 Jul 2022 21:48:03 +0200
Subject: [PATCH 006/127] Lines 50/1996

---
 README.md | 201 ++++++++++++++++++++++++++++++------------------------
 1 file changed, 112 insertions(+), 89 deletions(-)

diff --git a/README.md b/README.md
index db5754c..747e4af 100644
--- a/README.md
+++ b/README.md
@@ -129,51 +129,62 @@ software development/engineering roles.
 
 ### Topics of Study
 
-- [Algorithmic complexity / Big-O / Asymptotic analysis](#algorithmic-complexity--big-o--asymptotic-analysis)
-- [Data Structures](#data-structures)
-    - [Arrays](#arrays)
-    - [Linked Lists](#linked-lists)
-    - [Stack](#stack)
-    - [Queue](#queue)
-    - [Hash table](#hash-table)
-- [More Knowledge](#more-knowledge)
-    - [Binary search](#binary-search)
-    - [Bitwise operations](#bitwise-operations)
-- [Trees](#trees)
-    - [Trees - Notes & Background](#trees---notes--background)
-    - [Binary search trees: BSTs](#binary-search-trees-bsts)
-    - [Heap / Priority Queue / Binary Heap](#heap--priority-queue--binary-heap)
-    - balanced search trees (general concept, not details)
-    - traversals: preorder, inorder, postorder, BFS, DFS
-- [Sorting](#sorting)
-    - selection
-    - insertion
-    - heapsort
-    - quicksort
-    - merge sort
-- [Graphs](#graphs)
-    - directed
-    - undirected
-    - adjacency matrix
-    - adjacency list
-    - traversals: BFS, DFS
-- [Even More Knowledge](#even-more-knowledge)
-    - [Recursion](#recursion)
-    - [Dynamic Programming](#dynamic-programming)
-    - [Design Patterns](#design-patterns)
-    - [Combinatorics (n choose k) & Probability](#combinatorics-n-choose-k--probability)
-    - [NP, NP-Complete and Approximation Algorithms](#np-np-complete-and-approximation-algorithms)
-    - [How computers process a program](#how-computers-process-a-program)
-    - [Caches](#caches)
-    - [Processes and Threads](#processes-and-threads)
-    - [Testing](#testing)
-    - [String searching & manipulations](#string-searching--manipulations)
-    - [Tries](#tries)
-    - [Floating Point Numbers](#floating-point-numbers)
-    - [Unicode](#unicode)
-    - [Endianness](#endianness)
-    - [Networking](#networking)
-- [Final Review](#final-review)
+- [Coding Interview University](#coding-interview-university)
+  - [What is it?](#what-is-it)
+  - [Table of Contents](#table-of-contents)
+    - [The Study Plan](#the-study-plan)
+    - [Topics of Study](#topics-of-study)
+    - [Getting the Job](#getting-the-job)
+    - [Optional Extra Topics & Resources](#optional-extra-topics--resources)
+  - [Why use it?](#why-use-it)
+  - [How to use it](#how-to-use-it)
+    - [If you don't want to use git](#if-you-dont-want-to-use-git)
+    - [If you're comfortable with git](#if-youre-comfortable-with-git)
+  - [Don't feel you aren't smart enough](#dont-feel-you-arent-smart-enough)
+  - [A Note About Video Resources](#a-note-about-video-resources)
+  - [Choose a Programming Language](#choose-a-programming-language)
+    - [For this Study Plan](#for-this-study-plan)
+    - [For your Coding Interview](#for-your-coding-interview)
+  - [Books for Data Structures and Algorithms](#books-for-data-structures-and-algorithms)
+    - [C](#c)
+    - [Python](#python)
+    - [Java](#java)
+    - [C++](#c-1)
+  - [Interview Prep Books](#interview-prep-books)
+    - [If you have tons of extra time:](#if-you-have-tons-of-extra-time)
+  - [Don't Make My Mistakes](#dont-make-my-mistakes)
+    - [1. You Won't Remember it All](#1-you-wont-remember-it-all)
+    - [2. Use Flashcards](#2-use-flashcards)
+    - [3. Do Coding Interview Questions While You're Learning](#3-do-coding-interview-questions-while-youre-learning)
+    - [4. Focus](#4-focus)
+  - [What you won't see covered](#what-you-wont-see-covered)
+  - [The Daily Plan](#the-daily-plan)
+  - [Coding Question Practice](#coding-question-practice)
+  - [Coding Problems](#coding-problems)
+  - [Let's Get Started](#lets-get-started)
+  - [Algorithmic complexity / Big-O / Asymptotic analysis](#algorithmic-complexity--big-o--asymptotic-analysis)
+  - [Data Structures](#data-structures)
+  - [More Knowledge](#more-knowledge)
+  - [Trees](#trees)
+  - [Sorting](#sorting)
+  - [Graphs](#graphs)
+  - [Even More Knowledge](#even-more-knowledge)
+  - [Final Review](#final-review)
+  - [Update Your Resume](#update-your-resume)
+  - [Find a Job](#find-a-job)
+  - [Interview Process & General Interview Prep](#interview-process--general-interview-prep)
+  - [Be thinking of for when the interview comes](#be-thinking-of-for-when-the-interview-comes)
+  - [Have questions for the interviewer](#have-questions-for-the-interviewer)
+  - [Once You've Got The Job](#once-youve-got-the-job)
+  - [Additional Books](#additional-books)
+  - [System Design, Scalability, Data Handling](#system-design-scalability-data-handling)
+  - [Additional Learning](#additional-learning)
+  - [Additional Detail on Some Subjects](#additional-detail-on-some-subjects)
+  - [Video Series](#video-series)
+  - [Computer Science Courses](#computer-science-courses)
+  - [Algorithms implementation](#algorithms-implementation)
+  - [Papers](#papers)
+  - [LICENSE](#license)
 
 ### Getting the Job
 
@@ -188,50 +199,62 @@ software development/engineering roles.
 
 ### Optional Extra Topics & Resources
 
-- [Additional Books](#additional-books)
-- [System Design, Scalability, Data Handling](#system-design-scalability-data-handling) (if you have 4+ years experience)
-- [Additional Learning](#additional-learning)
-    - [Compilers](#compilers)
-    - [Emacs and vi(m)](#emacs-and-vim)
-    - [Unix command line tools](#unix-command-line-tools)
-    - [Information theory](#information-theory-videos)
-    - [Parity & Hamming Code](#parity--hamming-code-videos)
-    - [Entropy](#entropy)
-    - [Cryptography](#cryptography)
-    - [Compression](#compression)
-    - [Computer Security](#computer-security)
-    - [Garbage collection](#garbage-collection)
-    - [Parallel Programming](#parallel-programming)
-    - [Messaging, Serialization, and Queueing Systems](#messaging-serialization-and-queueing-systems)
-    - [A*](#a)
-    - [Fast Fourier Transform](#fast-fourier-transform)
-    - [Bloom Filter](#bloom-filter)
-    - [HyperLogLog](#hyperloglog)
-    - [Locality-Sensitive Hashing](#locality-sensitive-hashing)
-    - [van Emde Boas Trees](#van-emde-boas-trees)
-    - [Augmented Data Structures](#augmented-data-structures)
-    - [Balanced search trees](#balanced-search-trees)
-        - AVL trees
-        - Splay trees
-        - Red/black trees
-        - 2-3 search trees
-        - 2-3-4 Trees (aka 2-4 trees)
-        - N-ary (K-ary, M-ary) trees
-        - B-Trees
-    - [k-D Trees](#k-d-trees)
-    - [Skip lists](#skip-lists)
-    - [Network Flows](#network-flows)
-    - [Disjoint Sets & Union Find](#disjoint-sets--union-find)
-    - [Math for Fast Processing](#math-for-fast-processing)
-    - [Treap](#treap)
-    - [Linear Programming](#linear-programming-videos)
-    - [Geometry, Convex hull](#geometry-convex-hull-videos)
-    - [Discrete math](#discrete-math)
-    - [Machine Learning](#machine-learning)
-- [Additional Detail on Some Subjects](#additional-detail-on-some-subjects)
-- [Video Series](#video-series)
-- [Computer Science Courses](#computer-science-courses)
-- [Papers](#papers)
+- [Coding Interview University](#coding-interview-university)
+  - [What is it?](#what-is-it)
+  - [Table of Contents](#table-of-contents)
+    - [The Study Plan](#the-study-plan)
+    - [Topics of Study](#topics-of-study)
+    - [Getting the Job](#getting-the-job)
+    - [Optional Extra Topics & Resources](#optional-extra-topics--resources)
+  - [Why use it?](#why-use-it)
+  - [How to use it](#how-to-use-it)
+    - [If you don't want to use git](#if-you-dont-want-to-use-git)
+    - [If you're comfortable with git](#if-youre-comfortable-with-git)
+  - [Don't feel you aren't smart enough](#dont-feel-you-arent-smart-enough)
+  - [A Note About Video Resources](#a-note-about-video-resources)
+  - [Choose a Programming Language](#choose-a-programming-language)
+    - [For this Study Plan](#for-this-study-plan)
+    - [For your Coding Interview](#for-your-coding-interview)
+  - [Books for Data Structures and Algorithms](#books-for-data-structures-and-algorithms)
+    - [C](#c)
+    - [Python](#python)
+    - [Java](#java)
+    - [C++](#c-1)
+  - [Interview Prep Books](#interview-prep-books)
+    - [If you have tons of extra time:](#if-you-have-tons-of-extra-time)
+  - [Don't Make My Mistakes](#dont-make-my-mistakes)
+    - [1. You Won't Remember it All](#1-you-wont-remember-it-all)
+    - [2. Use Flashcards](#2-use-flashcards)
+    - [3. Do Coding Interview Questions While You're Learning](#3-do-coding-interview-questions-while-youre-learning)
+    - [4. Focus](#4-focus)
+  - [What you won't see covered](#what-you-wont-see-covered)
+  - [The Daily Plan](#the-daily-plan)
+  - [Coding Question Practice](#coding-question-practice)
+  - [Coding Problems](#coding-problems)
+  - [Let's Get Started](#lets-get-started)
+  - [Algorithmic complexity / Big-O / Asymptotic analysis](#algorithmic-complexity--big-o--asymptotic-analysis)
+  - [Data Structures](#data-structures)
+  - [More Knowledge](#more-knowledge)
+  - [Trees](#trees)
+  - [Sorting](#sorting)
+  - [Graphs](#graphs)
+  - [Even More Knowledge](#even-more-knowledge)
+  - [Final Review](#final-review)
+  - [Update Your Resume](#update-your-resume)
+  - [Find a Job](#find-a-job)
+  - [Interview Process & General Interview Prep](#interview-process--general-interview-prep)
+  - [Be thinking of for when the interview comes](#be-thinking-of-for-when-the-interview-comes)
+  - [Have questions for the interviewer](#have-questions-for-the-interviewer)
+  - [Once You've Got The Job](#once-youve-got-the-job)
+  - [Additional Books](#additional-books)
+  - [System Design, Scalability, Data Handling](#system-design-scalability-data-handling)
+  - [Additional Learning](#additional-learning)
+  - [Additional Detail on Some Subjects](#additional-detail-on-some-subjects)
+  - [Video Series](#video-series)
+  - [Computer Science Courses](#computer-science-courses)
+  - [Algorithms implementation](#algorithms-implementation)
+  - [Papers](#papers)
+  - [LICENSE](#license)
 
 ---
 

From 42f35858aab41ef6bf04e6337e45d495bed8a17c Mon Sep 17 00:00:00 2001
From: Anri Lombard <anri.m.lombard@gmail.com>
Date: Tue, 12 Jul 2022 21:48:58 +0200
Subject: [PATCH 007/127] Lines 60/1996

---
 translations/README-af.md | 22 +++++++++++++++++++++-
 1 file changed, 21 insertions(+), 1 deletion(-)

diff --git a/translations/README-af.md b/translations/README-af.md
index 045ea9a..f2d939b 100644
--- a/translations/README-af.md
+++ b/translations/README-af.md
@@ -37,4 +37,24 @@
 <details>
 <summary>Vertalings aan die gang:</summary>
 
-</details>
\ No newline at end of file
+- [हिन्दी](https://github.com/jwasham/coding-interview-university/issues/81)
+- [עברית](https://github.com/jwasham/coding-interview-university/issues/82)
+- [Arabic](https://github.com/jwasham/coding-interview-university/issues/98)
+- [Turkish](https://github.com/jwasham/coding-interview-university/issues/90)
+- [French](https://github.com/jwasham/coding-interview-university/issues/89)
+- [Українська](https://github.com/jwasham/coding-interview-university/issues/106)
+- [Korean(한국어)](https://github.com/jwasham/coding-interview-university/issues/118)
+- [Telugu](https://github.com/jwasham/coding-interview-university/issues/117)
+- [Urdu](https://github.com/jwasham/coding-interview-university/issues/519)
+- [Thai](https://github.com/jwasham/coding-interview-university/issues/156)
+- [Greek](https://github.com/jwasham/coding-interview-university/issues/166)
+- [Malayalam](https://github.com/jwasham/coding-interview-university/issues/239)
+- [Persian - Farsi](https://github.com/jwasham/coding-interview-university/issues/186)
+
+</details>
+
+<div align="center">
+    <hr />
+    <p>
+    </p>
+</div>
\ No newline at end of file

From 118ece0f699849ebb082f90158071d50fe88eeca Mon Sep 17 00:00:00 2001
From: Anri Lombard <anri.m.lombard@gmail.com>
Date: Tue, 12 Jul 2022 21:52:40 +0200
Subject: [PATCH 008/127] Lines 60/1996

---
 translations/README-af.md | 1 +
 1 file changed, 1 insertion(+)

diff --git a/translations/README-af.md b/translations/README-af.md
index f2d939b..6fdc132 100644
--- a/translations/README-af.md
+++ b/translations/README-af.md
@@ -56,5 +56,6 @@
 <div align="center">
     <hr />
     <p>
+        <a href="https://github.com/sponsors/jwasham"><strong>Word 'n bydraer</strong> en borg Kodering Universiteit!</a>
     </p>
 </div>
\ No newline at end of file

From 661eeafe66350ec970d8f32a45e30f9bf9e91ef4 Mon Sep 17 00:00:00 2001
From: Anri Lombard <anri.m.lombard@gmail.com>
Date: Tue, 12 Jul 2022 21:54:10 +0200
Subject: [PATCH 009/127] Lines 70/1996

---
 translations/README-af.md | 9 +++++++++
 1 file changed, 9 insertions(+)

diff --git a/translations/README-af.md b/translations/README-af.md
index 6fdc132..0db8de3 100644
--- a/translations/README-af.md
+++ b/translations/README-af.md
@@ -58,4 +58,13 @@
     <p>
         <a href="https://github.com/sponsors/jwasham"><strong>Word 'n bydraer</strong> en borg Kodering Universiteit!</a>
     </p>
+    <p>
+        <strong>Spesiale dank aan:</strong>
+    </p>
+    <p>
+        <a href="https://oss.capital/">
+            <div>
+            
+            </div>
+    </p>
 </div>
\ No newline at end of file

From f253e48962c12060c7f2efdbdb2a205ba7b2f728 Mon Sep 17 00:00:00 2001
From: Anri Lombard <anri.m.lombard@gmail.com>
Date: Tue, 12 Jul 2022 22:00:57 +0200
Subject: [PATCH 010/127] Lines 80/1996

---
 translations/README-af.md | 15 +++++++++++++--
 1 file changed, 13 insertions(+), 2 deletions(-)

diff --git a/translations/README-af.md b/translations/README-af.md
index 0db8de3..0f16602 100644
--- a/translations/README-af.md
+++ b/translations/README-af.md
@@ -56,7 +56,7 @@
 <div align="center">
     <hr />
     <p>
-        <a href="https://github.com/sponsors/jwasham"><strong>Word 'n bydraer</strong> en borg Kodering Universiteit!</a>
+        <a href="https://github.com/sponsors/jwasham"><strong>Word 'n bydraër</strong> en borg Kodering Universiteit!</a>
     </p>
     <p>
         <strong>Spesiale dank aan:</strong>
@@ -64,7 +64,18 @@
     <p>
         <a href="https://oss.capital/">
             <div>
-            
+                <img src="https://d3j2pkmjtin6ou.cloudfront.net/sponsors/oss-capital.svg" width="350" alt="OSS Capital">
+            </div>
+            <div>
+                <sup><strong>Gestig in 2018, OSS Capital is die eerste en enigste waagkapitaal platform gefokus<br>uitsluitlik om vroeë stadium COSS (komersiële oop bron) opstart stigters te ondersteun.</strong></sup>
+            </div>
+        </a>
+    </p>
+    <br />
+    <p>
+        <a href="https://www.gitpod.io/?utm_campaign=jwasham&utm_medium=referral&utm_content=coding-interview-university&utm_source=github">
+            <div>
+                <img src="https://d3j2pkmjtin6ou.cloudfront.net/sponsors/gitpod-logo-light-theme.svg" width="300" alt="Gitpod">
             </div>
     </p>
 </div>
\ No newline at end of file

From 4c1c7a4cbb907e593c1580c7b271eca6870b291f Mon Sep 17 00:00:00 2001
From: Anri Lombard <anri.m.lombard@gmail.com>
Date: Tue, 12 Jul 2022 22:08:35 +0200
Subject: [PATCH 011/127] Lines 90/1996

---
 translations/README-af.md | 9 +++++++++
 1 file changed, 9 insertions(+)

diff --git a/translations/README-af.md b/translations/README-af.md
index 0f16602..9390675 100644
--- a/translations/README-af.md
+++ b/translations/README-af.md
@@ -77,5 +77,14 @@
             <div>
                 <img src="https://d3j2pkmjtin6ou.cloudfront.net/sponsors/gitpod-logo-light-theme.svg" width="300" alt="Gitpod">
             </div>
+            <div>
+                <p>
+                    <strong>Dev omgewings gebou vir die wolk</strong>
+                </p>
+            </div>
+            <div>
+                <sup>Inheems geïntegreer met GitLab, GitHub, en Bitbucket, bou Gitpod outomaties en aanhoudend dev omgewings vir al jou takke. As gevolg kan span lede onmiddellik begin kodeer met vars dev omgewings vir elke nuwe taak - maak nie saak of jy 'n nuwe kenmerk bou, 'n fout wil reg maak, of werk aan 'n kode resensie nie.</sup>
+            </div>
+        </a>
     </p>
 </div>
\ No newline at end of file

From 3f6e25714cc83f79bfa33cae074cac266876135a Mon Sep 17 00:00:00 2001
From: Anri Lombard <anri.m.lombard@gmail.com>
Date: Tue, 12 Jul 2022 22:11:59 +0200
Subject: [PATCH 012/127] Lines 100/1996

---
 translations/README-af.md | 11 ++++++++++-
 1 file changed, 10 insertions(+), 1 deletion(-)

diff --git a/translations/README-af.md b/translations/README-af.md
index 9390675..cc4cb3f 100644
--- a/translations/README-af.md
+++ b/translations/README-af.md
@@ -87,4 +87,13 @@
             </div>
         </a>
     </p>
-</div>
\ No newline at end of file
+    <hr />
+</div>
+
+## Wat is dit?
+
+![Kodeering op die witbord - van HBO se Silicon Valley](https://d3j2pkmjtin6ou.cloudfront.net/coding-at-the-whiteboard-silicon-valley.png)
+
+Dié is my multi-maand studie plan om 'n sagteware ingeneur te word vir 'n groot maatskappy.
+
+**Benodighede:**

From 32f5a770697718509c60227aa97dbd452555a74c Mon Sep 17 00:00:00 2001
From: Anri Lombard <anri.m.lombard@gmail.com>
Date: Tue, 12 Jul 2022 22:21:10 +0200
Subject: [PATCH 013/127] Lines 110/1996

---
 translations/README-af.md | 11 +++++++++++
 1 file changed, 11 insertions(+)

diff --git a/translations/README-af.md b/translations/README-af.md
index cc4cb3f..26900ec 100644
--- a/translations/README-af.md
+++ b/translations/README-af.md
@@ -97,3 +97,14 @@
 Dié is my multi-maand studie plan om 'n sagteware ingeneur te word vir 'n groot maatskappy.
 
 **Benodighede:**
+* 'n Bietjie ondervinding met kodeering (veranderlikes, lusse, metodes/funksies, ens)
+* Geduld
+* Tyd
+* 
+Let wel dat die 'n studieplan vir 'n **sagteware ingeneur** pos is, nie 'n webontwikkeling pos nie. Groot maatskappeie soos Google, Amazon,
+Facebook en Microsoft sien sagteware ingeneurs as verskilled van webontwikkeling ingeneurs. Byvoorbeeld, Amazon het
+Frontend Ingeneurs (FEE) en Sagteware Ontwikkeling Ingeneurs (SDE). Die is 2 verskeie rolle en die onderhoude verskil,
+omdat elkeen sy eie bevoegdhede het. Dié maatskappeie benodig rekenaar wetenskap kennis vir
+sagteware ontwikkeling/ingeneur rolle.
+
+---
\ No newline at end of file

From 62f341f0c85e29f4fb92cc3cc76c073f28aa7a28 Mon Sep 17 00:00:00 2001
From: Anri Lombard <anri.m.lombard@gmail.com>
Date: Tue, 12 Jul 2022 22:24:08 +0200
Subject: [PATCH 014/127] Lines 120/1996

---
 translations/README-af.md | 12 +++++++++++-
 1 file changed, 11 insertions(+), 1 deletion(-)

diff --git a/translations/README-af.md b/translations/README-af.md
index 26900ec..a91af08 100644
--- a/translations/README-af.md
+++ b/translations/README-af.md
@@ -107,4 +107,14 @@ Frontend Ingeneurs (FEE) en Sagteware Ontwikkeling Ingeneurs (SDE). Die is 2 ver
 omdat elkeen sy eie bevoegdhede het. Dié maatskappeie benodig rekenaar wetenskap kennis vir
 sagteware ontwikkeling/ingeneur rolle.
 
----
\ No newline at end of file
+---
+
+## Inhoudsopgawe
+
+### Die Studie Plan
+
+- [Wat is dit?](#what-is-it)
+- [Hoekom gebruik dit?](#why-use-it)
+- [Hoe om dit te gebruik](#how-to-use-it)
+- [Moenie voel dat jy nie slim genoeg is nie](#dont-feel-you-arent-smart-enough)
+- ['n Nota Oor Video Hulpbronne](#a-note-about-video-resources)
\ No newline at end of file

From 80a7cf22e8cf925f61e9af903f556e328fcdfb3b Mon Sep 17 00:00:00 2001
From: Anri Lombard <anri.m.lombard@gmail.com>
Date: Tue, 12 Jul 2022 22:28:55 +0200
Subject: [PATCH 015/127] Lines 130/1996

---
 translations/README-af.md | 12 +++++++++++-
 1 file changed, 11 insertions(+), 1 deletion(-)

diff --git a/translations/README-af.md b/translations/README-af.md
index a91af08..e6ef243 100644
--- a/translations/README-af.md
+++ b/translations/README-af.md
@@ -117,4 +117,14 @@ sagteware ontwikkeling/ingeneur rolle.
 - [Hoekom gebruik dit?](#why-use-it)
 - [Hoe om dit te gebruik](#how-to-use-it)
 - [Moenie voel dat jy nie slim genoeg is nie](#dont-feel-you-arent-smart-enough)
-- ['n Nota Oor Video Hulpbronne](#a-note-about-video-resources)
\ No newline at end of file
+- ['n Nota Oor Video Hulpbronne](#a-note-about-video-resources)
+- [Kies 'n Programmeeringstaal](#choose-a-programming-language)
+- [Boeke vir Datastrukture en Algoritmes](#books-for-data-structures-and-algorithms)
+- [Onderhoud Voorbereïngsboeke](#interview-prep-books)
+- [Moenie My Foute Maak Nie](#dont-make-my-mistakes)
+- [Wat Jy Nie Sal Sien Gedek Word Nie](#what-you-wont-see-covered)
+- [Die Daaglikse Plan](#the-daily-plan)
+- [Kodeering Vrae Beoefening](#coding-question-practice)
+- [Kodeering Probleme](#coding-problems)
+
+### Topics of Study
\ No newline at end of file

From dd9c61e6f1fcf4b962d0eb7062b68bcbf7cc152f Mon Sep 17 00:00:00 2001
From: Anri Lombard <anri.m.lombard@gmail.com>
Date: Tue, 12 Jul 2022 22:56:00 +0200
Subject: [PATCH 016/127] Lines 140/1996

---
 translations/README-af.md | 48 +++++++++++++++++++++++----------------
 1 file changed, 29 insertions(+), 19 deletions(-)

diff --git a/translations/README-af.md b/translations/README-af.md
index e6ef243..19e9bc4 100644
--- a/translations/README-af.md
+++ b/translations/README-af.md
@@ -1,4 +1,4 @@
-# Kodering Universiteit
+# Kodering Onderhoud Universiteit
 
 > Ek het oorspronklik dié as 'n kort om-te-doen lys van studie onderwerpe om 'n sagteware ingenieur te word gemaak,
 > maar did het gegroei tot die groot lys wat jy vandag sien. Nadat ek dié studieplan gevolg het, [het Amazon my
@@ -56,7 +56,7 @@
 <div align="center">
     <hr />
     <p>
-        <a href="https://github.com/sponsors/jwasham"><strong>Word 'n bydraër</strong> en borg Kodering Universiteit!</a>
+        <a href="https://github.com/sponsors/jwasham"><strong>Word 'n bydraër</strong> en borg Kodering Onderhoud Universiteit!</a>
     </p>
     <p>
         <strong>Spesiale dank aan:</strong>
@@ -92,15 +92,15 @@
 
 ## Wat is dit?
 
-![Kodeering op die witbord - van HBO se Silicon Valley](https://d3j2pkmjtin6ou.cloudfront.net/coding-at-the-whiteboard-silicon-valley.png)
+![Kodering op die witbord - van HBO se Silicon Valley](https://d3j2pkmjtin6ou.cloudfront.net/coding-at-the-whiteboard-silicon-valley.png)
 
 Dié is my multi-maand studie plan om 'n sagteware ingeneur te word vir 'n groot maatskappy.
 
 **Benodighede:**
-* 'n Bietjie ondervinding met kodeering (veranderlikes, lusse, metodes/funksies, ens)
+* 'n Bietjie ondervinding met kodrering (veranderlikes, lusse, metodes/funksies, ens)
 * Geduld
 * Tyd
-* 
+  
 Let wel dat die 'n studieplan vir 'n **sagteware ingeneur** pos is, nie 'n webontwikkeling pos nie. Groot maatskappeie soos Google, Amazon,
 Facebook en Microsoft sien sagteware ingeneurs as verskilled van webontwikkeling ingeneurs. Byvoorbeeld, Amazon het
 Frontend Ingeneurs (FEE) en Sagteware Ontwikkeling Ingeneurs (SDE). Die is 2 verskeie rolle en die onderhoude verskil,
@@ -113,18 +113,28 @@ sagteware ontwikkeling/ingeneur rolle.
 
 ### Die Studie Plan
 
-- [Wat is dit?](#what-is-it)
-- [Hoekom gebruik dit?](#why-use-it)
-- [Hoe om dit te gebruik](#how-to-use-it)
-- [Moenie voel dat jy nie slim genoeg is nie](#dont-feel-you-arent-smart-enough)
-- ['n Nota Oor Video Hulpbronne](#a-note-about-video-resources)
-- [Kies 'n Programmeeringstaal](#choose-a-programming-language)
-- [Boeke vir Datastrukture en Algoritmes](#books-for-data-structures-and-algorithms)
-- [Onderhoud Voorbereïngsboeke](#interview-prep-books)
-- [Moenie My Foute Maak Nie](#dont-make-my-mistakes)
-- [Wat Jy Nie Sal Sien Gedek Word Nie](#what-you-wont-see-covered)
-- [Die Daaglikse Plan](#the-daily-plan)
-- [Kodeering Vrae Beoefening](#coding-question-practice)
-- [Kodeering Probleme](#coding-problems)
+- [Wat is dit?](#wat-is-dit)
+- [Hoekom gebruik dit?](#hoekom-gebruik-dit)
+- [Hoe om dit te gebruik](#hoe-om-dit-te-gebruik)
+- [Moenie voel asof jy nie slim genoeg is nie](#moenie-voel-asof-jy-nie-slim-genoeg-is-nie)
+- ['n Nota Oor Video Hulpbronne](#n-nota-oor-video-hulpbronne)
+- [Kies 'n Programmeeringstaal](#kies-n-programmeeringstaal)
+- [Boeke vir Datastrukture en Algoritmes](#boeke-vir-datastrukture-en-algoritmes)
+- [Onderhoud Voorbereïngsboeke](#onderhoud-voorbereiding)
+- [Moenie My Foute Maak Nie](#moenie-my-foute-maak-nie)
+- [Wat Jy Nie Sal Sien Gedek Word Nie](#wat-jy-nie-sal-sien-gedek-word-nie)
+- [Die Daaglikse Plan](#die-daaglikse-plan)
+- [Kodering Vrae Beoefening](#kodering-vrae-beoefening)
+- [Kodering Probleme](#kodering-probleme)
 
-### Topics of Study
\ No newline at end of file
+## Onderwerpe om te Studeer
+
+- [Kodering Onderhoud Universiteit]()
+  - [Wat is dit?](#wat-is-dit)
+  - [Inhoudsopgawe](#inhoudsopgawe)
+    - [Die Studie Plan](#die-studie-plan)
+    - [Onderwerpe om te Studeer](#onderwerpe-om-te-studeer)
+    - [Kry die Werk](#kry-die-werk)
+    - [Opsionele Ekstra Onderwerpe & Hulpbronne](#opsionele-ekstra-onderwerpe--hulpbronne)
+  - [Hoekom gebruik dit?](#hoekom-gebruik-dit)
+  - [Hoe om dit te gebruik?](#hoe-om-dit-te-gebruik)
\ No newline at end of file

From 4034b2766cd1db68113309654e90b97314b9f02f Mon Sep 17 00:00:00 2001
From: Anri Lombard <anri.m.lombard@gmail.com>
Date: Tue, 12 Jul 2022 23:01:08 +0200
Subject: [PATCH 017/127] Lines 150/1996

---
 translations/README-af.md | 14 +++++++++++++-
 1 file changed, 13 insertions(+), 1 deletion(-)

diff --git a/translations/README-af.md b/translations/README-af.md
index 19e9bc4..fd661b1 100644
--- a/translations/README-af.md
+++ b/translations/README-af.md
@@ -137,4 +137,16 @@ sagteware ontwikkeling/ingeneur rolle.
     - [Kry die Werk](#kry-die-werk)
     - [Opsionele Ekstra Onderwerpe & Hulpbronne](#opsionele-ekstra-onderwerpe--hulpbronne)
   - [Hoekom gebruik dit?](#hoekom-gebruik-dit)
-  - [Hoe om dit te gebruik?](#hoe-om-dit-te-gebruik)
\ No newline at end of file
+  - [Hoe om dit te gebruik?](#hoe-om-dit-te-gebruik)
+    - [As jy nie git wil gebruik nie](#as-jy-nie-git-wil-gebruik-nie)
+    - [As jy gemaklik met git is](#as-jy-gemaklik-met-git-is)
+  - [Moenie voel asof jy nie slim genoeg is nie](#moenie-voel-asof-jy-nie-slim-genoeg-is-nie)
+  - ['n Nota Oor Video Hulpbronne](#n-nota-oor-video-hulpbronne)
+  - [Kies 'n Programmeeringstaal](#kies-n-programmeeringstaal)
+    - [Vir die Studie Plan](#vir-die-studie-plan)
+    - [Vir jou Kodering Onderhoud](#vir-jou-kodering-onderhoud)
+  - [Boeke vir Datastrukture en Algoritmes](#boeke-vir-datastrukture-en-algoritmes)
+    - [C](#c)
+    - [Python](#python)
+    - [Java](#java)
+    - [C++](#c-1)
\ No newline at end of file

From 3af07272161a3245efc19ed5c6269a0cddfdd1e5 Mon Sep 17 00:00:00 2001
From: Anri Lombard <anri.m.lombard@gmail.com>
Date: Tue, 12 Jul 2022 23:06:27 +0200
Subject: [PATCH 018/127] Lines 160/1996

---
 translations/README-af.md | 13 ++++++++++++-
 1 file changed, 12 insertions(+), 1 deletion(-)

diff --git a/translations/README-af.md b/translations/README-af.md
index fd661b1..fb9b9f6 100644
--- a/translations/README-af.md
+++ b/translations/README-af.md
@@ -149,4 +149,15 @@ sagteware ontwikkeling/ingeneur rolle.
     - [C](#c)
     - [Python](#python)
     - [Java](#java)
-    - [C++](#c-1)
\ No newline at end of file
+    - [C++](#c-1)
+  - [Onderhoud Voorbereïngsboeke](#onderhoud-voorbereiding)
+    - [As jy tonne ekstra tyd het](#as-jy-tonne-ekstra-tyd-het)
+  - [Moenie My Foute Maak Nie](#moenie-my-foute-maak-nie)
+    - [1. Jy Sal Nie Alles Onthou Nie](#1-jy-sal-nie-alles-onthou-nie)
+    - [2. Gebruik flitskaarte](#2-gebruik-flitskaarte)
+    - [3. Doen Kodering Onderhoud Vrae Terwyl Jy Leer](#3-doen-kodering-onderhoud-vrae-terwyl-jy-leer)
+    - [4. Fokus](#4-fokus)
+  - [Wat Jy Nie Sal Sien Gedek Word Nie](#wat-jy-nie-sal-sien-gedek-word-nie)
+  - [Die Daaglikse Plan](#die-daaglikse-plan)
+  - [Kodering Vrae Beoefening](#kodering-vrae-beoefening)
+  - [Kodering Probleme](#kodering-probleme)
\ No newline at end of file

From cf5080c6390e76d3db5fcd2fdfb1c8d883973ae4 Mon Sep 17 00:00:00 2001
From: Anri Lombard <anri.m.lombard@gmail.com>
Date: Tue, 12 Jul 2022 23:09:59 +0200
Subject: [PATCH 019/127] Lines 170/1996

---
 translations/README-af.md | 9 ++++++++-
 1 file changed, 8 insertions(+), 1 deletion(-)

diff --git a/translations/README-af.md b/translations/README-af.md
index fb9b9f6..14311b6 100644
--- a/translations/README-af.md
+++ b/translations/README-af.md
@@ -160,4 +160,11 @@ sagteware ontwikkeling/ingeneur rolle.
   - [Wat Jy Nie Sal Sien Gedek Word Nie](#wat-jy-nie-sal-sien-gedek-word-nie)
   - [Die Daaglikse Plan](#die-daaglikse-plan)
   - [Kodering Vrae Beoefening](#kodering-vrae-beoefening)
-  - [Kodering Probleme](#kodering-probleme)
\ No newline at end of file
+  - [Kodering Probleme](#kodering-probleme)
+  - [Begin Solank](#begin-solank)
+  - [Algoritmiese Kompleksiteit / Big-O / Asimptotiese analise](#algorithmic-complexity--big-o--asymptotic-analysis)
+  - [Datastrukture](#datastrukture)
+  - [Meer Kennis](#meer-kennis)
+  - [Bome](#bome)
+  - [Sorteer](#sorteer)
+  - [Grafieke](#grafieke)
\ No newline at end of file

From 2f36bf7b6f4af1f88770f995b49bb3a5697d02ce Mon Sep 17 00:00:00 2001
From: Anri Lombard <anri.m.lombard@gmail.com>
Date: Tue, 12 Jul 2022 23:19:33 +0200
Subject: [PATCH 020/127] Lines 180/1996

---
 translations/README-af.md | 12 +++++++++++-
 1 file changed, 11 insertions(+), 1 deletion(-)

diff --git a/translations/README-af.md b/translations/README-af.md
index 14311b6..e02b5b1 100644
--- a/translations/README-af.md
+++ b/translations/README-af.md
@@ -167,4 +167,14 @@ sagteware ontwikkeling/ingeneur rolle.
   - [Meer Kennis](#meer-kennis)
   - [Bome](#bome)
   - [Sorteer](#sorteer)
-  - [Grafieke](#grafieke)
\ No newline at end of file
+  - [Grafieke](#grafieke)
+  - [Nog Meer Kennis](#nog-meer-kennis)
+  - [Finale Resensie](#finale-resensie)
+  - [Werk Jou CV By](#werk-jou-cv-by)
+  - [Kry 'n Werk](#kry-n-werk)
+  - [Onderhoudproses & Algemene Voorbereiding](#onderhoudproses--algemene-voorbereiding)
+  - [Dink aan vir wanneer die onderhoud kom](#dink-aan-vir-wanneer-die-onderhoud-kom)
+  - [Hê vrae vir die onderhoudvoerder](#he-vrae-vir-die-onderhoudvoerder)
+  - [Sodra Jy Die Werk Het](#sodra-jy-die-werk-het)
+  - [Bykomende Boeke](#bykomende-boeke)
+  - [Stelsel Onderwerp, Skaalbaarheid, Data Hantering](#stelsel-onderwerp-skaalbaarheid-data-hantering)
\ No newline at end of file

From aea3907c16159dceeb5d9fce0e95bfb646646020 Mon Sep 17 00:00:00 2001
From: Anri Lombard <anri.m.lombard@gmail.com>
Date: Tue, 12 Jul 2022 23:24:19 +0200
Subject: [PATCH 021/127] Lines 190/1996

---
 translations/README-af.md | 11 ++++++++++-
 1 file changed, 10 insertions(+), 1 deletion(-)

diff --git a/translations/README-af.md b/translations/README-af.md
index e02b5b1..4118558 100644
--- a/translations/README-af.md
+++ b/translations/README-af.md
@@ -177,4 +177,13 @@ sagteware ontwikkeling/ingeneur rolle.
   - [Hê vrae vir die onderhoudvoerder](#he-vrae-vir-die-onderhoudvoerder)
   - [Sodra Jy Die Werk Het](#sodra-jy-die-werk-het)
   - [Bykomende Boeke](#bykomende-boeke)
-  - [Stelsel Onderwerp, Skaalbaarheid, Data Hantering](#stelsel-onderwerp-skaalbaarheid-data-hantering)
\ No newline at end of file
+  - [Stelsel Onderwerp, Skaalbaarheid, Data Hantering](#stelsel-onderwerp-skaalbaarheid-data-hantering)
+  - [Bykomende Leer](#bykomende-leer)
+  - [Bykomende Detail op Sommige Vakke](#bykomende-detail-op-sommige-vakke)
+  - [Video Reeks](#video-reeks)
+  - [Rekenaar Wetenshap Kursusse](#rekenaar-wetenshap-kursusse)
+  - [Algoritmes implementering](#algoritmes-implementering)
+  - [Papiere](#papiere)
+  - [LISENSIE](#lisensie)
+
+### Kry die Werk
\ No newline at end of file

From 4f3b18e8f4f7efabb3b6e221dc6992bb012c242e Mon Sep 17 00:00:00 2001
From: Anri Lombard <anri.m.lombard@gmail.com>
Date: Tue, 12 Jul 2022 23:29:02 +0200
Subject: [PATCH 022/127] Lines 200/1996

---
 translations/README-af.md | 13 ++++++++++++-
 1 file changed, 12 insertions(+), 1 deletion(-)

diff --git a/translations/README-af.md b/translations/README-af.md
index 4118558..1ab0d6f 100644
--- a/translations/README-af.md
+++ b/translations/README-af.md
@@ -186,4 +186,15 @@ sagteware ontwikkeling/ingeneur rolle.
   - [Papiere](#papiere)
   - [LISENSIE](#lisensie)
 
-### Kry die Werk
\ No newline at end of file
+### Kry die Werk
+
+- [Werk Jou CV By]()
+- [Kry 'n Werk](#kry-n-werk)
+- [Onderhoudproses & Algemene Voorbereiding](#onderhoudproses--algemene-voorbereiding)
+- [Dink aan vir wanneer die onderhoud kom](#dink-aan-vir-wanneer-die-onderhoud-kom)
+- [Hê vrae vir die onderhoudvoerder](#he-vrae-vir-die-onderhoudvoerder)
+- [Sodra Jy Die Werk Het](#sodra-jy-die-werk-het)
+
+**---------------- Alles hieronder is opsioneel ----------------**
+
+### Opsionele Ekstra Onderwerpe & Hulpbronne
\ No newline at end of file

From 4649d5e54e858ff7fb2f9aa2367b3682d7c52f0a Mon Sep 17 00:00:00 2001
From: Anri Lombard <anri.m.lombard@gmail.com>
Date: Wed, 13 Jul 2022 19:18:04 +0200
Subject: [PATCH 023/127] Lines 210/1996

---
 translations/README-af.md | 15 ++++++++++++++-
 1 file changed, 14 insertions(+), 1 deletion(-)

diff --git a/translations/README-af.md b/translations/README-af.md
index 1ab0d6f..d9a57bf 100644
--- a/translations/README-af.md
+++ b/translations/README-af.md
@@ -197,4 +197,17 @@ sagteware ontwikkeling/ingeneur rolle.
 
 **---------------- Alles hieronder is opsioneel ----------------**
 
-### Opsionele Ekstra Onderwerpe & Hulpbronne
\ No newline at end of file
+### Opsionele Ekstra Onderwerpe & Hulpbronne
+
+- [Kodering Onderhoud Universiteit]()
+  - [Wat is dit?](#wat-is-dit)
+  - [Inhoudsopgawe](#inhoudsopgawe)
+    - [Die Studie Plan](#die-studie-plan)
+    - [Onderwerpe om te Studeer](#onderwerpe-om-te-studeer)
+    - [Kry die Werk](#kry-die-werk)
+    - [Opsionele Ekstra Onderwerpe & Hulpbronne](#opsionele-ekstra-onderwerpe--hulpbronne)
+  - [Hoekom gebruik dit?](#hoekom-gebruik-dit)
+  - [Hoe om dit te gebruik?](#hoe-om-dit-te-gebruik)
+    - [As jy nie git wil gebruik nie](#as-jy-nie-git-wil-gebruik-nie)
+    - [As jy gemaklik met git is](#as-jy-gemaklik-met-git-is)
+  - [Moenie voel asof jy nie slim genoeg is nie](#moenie-voel-asof-jy-nie-slim-genoeg-is-nie)
\ No newline at end of file

From aff311dee3fcc8751c9948086cbfa30c5c0d3eea Mon Sep 17 00:00:00 2001
From: Anri Lombard <anri.m.lombard@gmail.com>
Date: Wed, 13 Jul 2022 19:19:23 +0200
Subject: [PATCH 024/127] Lines 260/1996

---
 translations/README-af.md | 49 ++++++++++++++++++++++++++++++++++++++-
 1 file changed, 48 insertions(+), 1 deletion(-)

diff --git a/translations/README-af.md b/translations/README-af.md
index d9a57bf..3475b29 100644
--- a/translations/README-af.md
+++ b/translations/README-af.md
@@ -210,4 +210,51 @@ sagteware ontwikkeling/ingeneur rolle.
   - [Hoe om dit te gebruik?](#hoe-om-dit-te-gebruik)
     - [As jy nie git wil gebruik nie](#as-jy-nie-git-wil-gebruik-nie)
     - [As jy gemaklik met git is](#as-jy-gemaklik-met-git-is)
-  - [Moenie voel asof jy nie slim genoeg is nie](#moenie-voel-asof-jy-nie-slim-genoeg-is-nie)
\ No newline at end of file
+  - [Moenie voel asof jy nie slim genoeg is nie](#moenie-voel-asof-jy-nie-slim-genoeg-is-nie)
+  - ['n Nota Oor Video Hulpbronne](#n-nota-oor-video-hulpbronne)
+  - [Kies 'n Programmeeringstaal](#kies-n-programmeeringstaal)
+    - [Vir die Studie Plan](#vir-die-studie-plan)
+    - [Vir jou Kodering Onderhoud](#vir-jou-kodering-onderhoud)
+  - [Boeke vir Datastrukture en Algoritmes](#boeke-vir-datastrukture-en-algoritmes)
+    - [C](#c)
+    - [Python](#python)
+    - [Java](#java)
+    - [C++](#c-1)
+  - [Onderhoud Voorbereïngsboeke](#onderhoud-voorbereiding)
+    - [As jy tonne ekstra tyd het](#as-jy-tonne-ekstra-tyd-het)
+  - [Moenie My Foute Maak Nie](#moenie-my-foute-maak-nie)
+    - [1. Jy Sal Nie Alles Onthou Nie](#1-jy-sal-nie-alles-onthou-nie)
+    - [2. Gebruik flitskaarte](#2-gebruik-flitskaarte)
+    - [3. Doen Kodering Onderhoud Vrae Terwyl Jy Leer](#3-doen-kodering-onderhoud-vrae-terwyl-jy-leer)
+    - [4. Fokus](#4-fokus)
+  - [Wat Jy Nie Sal Sien Gedek Word Nie](#wat-jy-nie-sal-sien-gedek-word-nie)
+  - [Die Daaglikse Plan](#die-daaglikse-plan)
+  - [Kodering Vrae Beoefening](#kodering-vrae-beoefening)
+  - [Kodering Probleme](#kodering-probleme)
+  - [Begin Solank](#begin-solank)
+  - [Algoritmiese Kompleksiteit / Big-O / Asimptotiese analise](#algorithmic-complexity--big-o--asymptotic-analysis)
+  - [Datastrukture](#datastrukture)
+  - [Meer Kennis](#meer-kennis)
+  - [Bome](#bome)
+  - [Sorteer](#sorteer)
+  - [Grafieke](#grafieke)
+  - [Nog Meer Kennis](#nog-meer-kennis)
+  - [Finale Resensie](#finale-resensie)
+  - [Werk Jou CV By](#werk-jou-cv-by)
+  - [Kry 'n Werk](#kry-n-werk)
+  - [Onderhoudproses & Algemene Voorbereiding](#onderhoudproses--algemene-voorbereiding)
+  - [Dink aan vir wanneer die onderhoud kom](#dink-aan-vir-wanneer-die-onderhoud-kom)
+  - [Hê vrae vir die onderhoudvoerder](#he-vrae-vir-die-onderhoudvoerder)
+  - [Sodra Jy Die Werk Het](#sodra-jy-die-werk-het)
+  - [Bykomende Boeke](#bykomende-boeke)
+  - [Stelsel Onderwerp, Skaalbaarheid, Data Hantering](#stelsel-onderwerp-skaalbaarheid-data-hantering)
+  - [Bykomende Leer](#bykomende-leer)
+  - [Bykomende Detail op Sommige Vakke](#bykomende-detail-op-sommige-vakke)
+  - [Video Reeks](#video-reeks)
+  - [Rekenaar Wetenshap Kursusse](#rekenaar-wetenshap-kursusse)
+  - [Algoritmes implementering](#algoritmes-implementering)
+  - [Papiere](#papiere)
+  - [LISENSIE](#lisensie)
+
+---
+

From aa18dcb31518153de361b2930738100424c738f2 Mon Sep 17 00:00:00 2001
From: Anri Lombard <anri.m.lombard@gmail.com>
Date: Wed, 13 Jul 2022 19:35:48 +0200
Subject: [PATCH 025/127] Lines 270/1996

---
 translations/README-af.md | 38 +++++++++++++++++++++++++-------------
 1 file changed, 25 insertions(+), 13 deletions(-)

diff --git a/translations/README-af.md b/translations/README-af.md
index 3475b29..e6650d6 100644
--- a/translations/README-af.md
+++ b/translations/README-af.md
@@ -113,19 +113,15 @@ sagteware ontwikkeling/ingeneur rolle.
 
 ### Die Studie Plan
 
-- [Wat is dit?](#wat-is-dit)
-- [Hoekom gebruik dit?](#hoekom-gebruik-dit)
-- [Hoe om dit te gebruik](#hoe-om-dit-te-gebruik)
-- [Moenie voel asof jy nie slim genoeg is nie](#moenie-voel-asof-jy-nie-slim-genoeg-is-nie)
-- ['n Nota Oor Video Hulpbronne](#n-nota-oor-video-hulpbronne)
-- [Kies 'n Programmeeringstaal](#kies-n-programmeeringstaal)
-- [Boeke vir Datastrukture en Algoritmes](#boeke-vir-datastrukture-en-algoritmes)
-- [Onderhoud Voorbereïngsboeke](#onderhoud-voorbereiding)
-- [Moenie My Foute Maak Nie](#moenie-my-foute-maak-nie)
-- [Wat Jy Nie Sal Sien Gedek Word Nie](#wat-jy-nie-sal-sien-gedek-word-nie)
-- [Die Daaglikse Plan](#die-daaglikse-plan)
-- [Kodering Vrae Beoefening](#kodering-vrae-beoefening)
-- [Kodering Probleme](#kodering-probleme)
+- [Kodering Onderhoud Universiteit](#kodering-onderhoud-universiteit)
+  - [Wat is dit?](#wat-is-dit)
+  - [Inhoudsopgawe](#inhoudsopgawe)
+    - [Die Studie Plan](#die-studie-plan)
+  - [Onderwerpe om te Studeer](#onderwerpe-om-te-studeer)
+    - [Kry die Werk](#kry-die-werk)
+    - [Opsionele Ekstra Onderwerpe & Hulpbronne](#opsionele-ekstra-onderwerpe--hulpbronne)
+  - [Hoekom gebruik dit?](#hoekom-gebruik-dit)
+  - [Hoe om dit te gebruik?](#hoe-om-dit-te-gebruik)
 
 ## Onderwerpe om te Studeer
 
@@ -258,3 +254,19 @@ sagteware ontwikkeling/ingeneur rolle.
 
 ---
 
+## Hoekom gebruik dit?
+
+As jy wil werk as 'n sagteware ingeneur vir 'n groot maatskappy, hierdie is die goed wat jy moet ken.
+
+As jy uitgemis het op 'n rekenaar wetenskap graad, soos ek het, sal hierdie jou laat opvang en vier jaar van jou lewe spaar.
+
+Toe ek hierdie projek begin het, kon ek nie verskil tussen 'n stapel en 'n hoop nie, het niks van Big-O geweet nie, of enige iets van bome nie, of hoe om
+'n grafiek te dwars nie. As ek 'n sorteer algoritme moes kode, kan ek jou verseker dit was verskriklik.
+Elke datastruktuur wat ek ooit moes gebruik was ingebou in die taal, end ek het nie geweet hoe hulle werk
+onder die kap nie. Ek het nooit nodig gehaad of geheue te bestuur nie, tensy 'n proses vir my 'n "te min
+beskikbare geheue" fout gegee het, en dan moes ek 'n ander oplossing kry. Ek het 'n paar multidimensionele skikkings
+in my lewe gebruik en duisende assosiatiewe skikkings, maar ek hoef nooit 'n datastruktuur van nuut af gebou het nie.
+
+Dis 'n lang plan. Dit gaan maande vat. As jy klaar gemaklik met baie van dié is gaan dit jou baie minder tyd vat.
+
+## Hoe om dit te gebruik?
\ No newline at end of file

From 86b8d65c0830427f40837a465472ba5c9b474e34 Mon Sep 17 00:00:00 2001
From: Anri Lombard <anri.m.lombard@gmail.com>
Date: Wed, 13 Jul 2022 19:46:12 +0200
Subject: [PATCH 026/127] Lines 280/1996

---
 translations/README-af.md | 31 +++++++++++++++++++++----------
 1 file changed, 21 insertions(+), 10 deletions(-)

diff --git a/translations/README-af.md b/translations/README-af.md
index e6650d6..f0f2b5e 100644
--- a/translations/README-af.md
+++ b/translations/README-af.md
@@ -113,15 +113,19 @@ sagteware ontwikkeling/ingeneur rolle.
 
 ### Die Studie Plan
 
-- [Kodering Onderhoud Universiteit](#kodering-onderhoud-universiteit)
-  - [Wat is dit?](#wat-is-dit)
-  - [Inhoudsopgawe](#inhoudsopgawe)
-    - [Die Studie Plan](#die-studie-plan)
-  - [Onderwerpe om te Studeer](#onderwerpe-om-te-studeer)
-    - [Kry die Werk](#kry-die-werk)
-    - [Opsionele Ekstra Onderwerpe & Hulpbronne](#opsionele-ekstra-onderwerpe--hulpbronne)
-  - [Hoekom gebruik dit?](#hoekom-gebruik-dit)
-  - [Hoe om dit te gebruik?](#hoe-om-dit-te-gebruik)
+- [Wat is dit?]()
+- [Hoekom gebruik dit?](#hoekom-gebruik-dit)
+- [Hoe om dit te gebruik](#hoe-om-dit-te-gebruik)
+- [Moenie voel asof jy nie slim genoeg is nie](#moenie-voel-asof-jy-nie-slim-genoeg-is-nie)
+- ['n Nota Oor Video Hulpbronne](#n-nota-oor-video-hulpbronne)
+- [Kies 'n Programmeeringstaal](#kies-n-programmeeringstaal)
+- [Boeke vir Datastrukture en Algoritmes](#boeke-vir-datastrukture-en-algoritmes)
+- [Onderhoud Voorbereïngsboeke](#onderhoud-voorbereiding)
+- [Moenie My Foute Maak Nie](#moenie-my-foute-maak-nie)
+- [Wat Jy Nie Sal Sien Gedek Word Nie](#wat-jy-nie-sal-sien-gedek-word-nie)
+- [Die Daaglikse Plan](#die-daaglikse-plan)
+- [Kodering Vrae Beoefening](#kodering-vrae-beoefening)
+- [Kodering Probleme](#kodering-probleme)
 
 ## Onderwerpe om te Studeer
 
@@ -269,4 +273,11 @@ in my lewe gebruik en duisende assosiatiewe skikkings, maar ek hoef nooit 'n dat
 
 Dis 'n lang plan. Dit gaan maande vat. As jy klaar gemaklik met baie van dié is gaan dit jou baie minder tyd vat.
 
-## Hoe om dit te gebruik?
\ No newline at end of file
+## Hoe om dit te gebruik?
+
+Alles hieronder is 'n uitlyn, en jy moet elke item aan pak in orde van bo tot onder.
+
+Ek gebruik Github se spisiale markdown flavor, insluitend taaklyste om vordering te volg.
+  - [More about GitHub-flavored markdown](https://guides.github.com/features/mastering-markdown/#GitHub-flavored-markdown)
+
+### As jy nie git wil gebruik nie
\ No newline at end of file

From cb2407f7ea37cf178dad6baaf6a534acf29f0ec6 Mon Sep 17 00:00:00 2001
From: Anri Lombard <anri.m.lombard@gmail.com>
Date: Wed, 13 Jul 2022 19:51:49 +0200
Subject: [PATCH 027/127] Lines 290/1996

---
 translations/README-af.md | 8 +++++++-
 1 file changed, 7 insertions(+), 1 deletion(-)

diff --git a/translations/README-af.md b/translations/README-af.md
index f0f2b5e..c635f67 100644
--- a/translations/README-af.md
+++ b/translations/README-af.md
@@ -280,4 +280,10 @@ Alles hieronder is 'n uitlyn, en jy moet elke item aan pak in orde van bo tot on
 Ek gebruik Github se spisiale markdown flavor, insluitend taaklyste om vordering te volg.
   - [More about GitHub-flavored markdown](https://guides.github.com/features/mastering-markdown/#GitHub-flavored-markdown)
 
-### As jy nie git wil gebruik nie
\ No newline at end of file
+### As jy nie git wil gebruik nie
+
+Op dié blad, kliek die Code knop naby die bookant, dan kliek "Download ZIP". Unzip die lêer en jy kan werk met die teks lêers.
+
+As jy in 'n kode redakteur is wat markdown verstaan, sal jy sien alles is mooi geformateer.
+
+![Hoe om die repo af te laai as 'n zip lêer](https://d3j2pkmjtin6ou.cloudfront.net/how-to-download-as-zip.png)

From 9aa150b2bf4321c81dbca8f435d93e0de38cb507 Mon Sep 17 00:00:00 2001
From: Anri Lombard <anri.m.lombard@gmail.com>
Date: Wed, 13 Jul 2022 19:55:18 +0200
Subject: [PATCH 028/127] Lines 300/1996

---
 translations/README-af.md | 10 ++++++++++
 1 file changed, 10 insertions(+)

diff --git a/translations/README-af.md b/translations/README-af.md
index c635f67..8260cb6 100644
--- a/translations/README-af.md
+++ b/translations/README-af.md
@@ -287,3 +287,13 @@ Op dié blad, kliek die Code knop naby die bookant, dan kliek "Download ZIP". Un
 As jy in 'n kode redakteur is wat markdown verstaan, sal jy sien alles is mooi geformateer.
 
 ![Hoe om die repo af te laai as 'n zip lêer](https://d3j2pkmjtin6ou.cloudfront.net/how-to-download-as-zip.png)
+
+### As jy gemaklik met git is
+
+Skep 'n nuwe tak sodat jy items soos dié kan merk, sit net 'n x in die hakies: [x]
+
+    Virk 'n tak en vold die bevele hieronder
+
+Virk die Github repo https://github.com/jwasham/coding-interview-university deur om die Fork knop to druk.
+
+Kloon na jou plaaslike repo:

From 4b96fa5c0aaf40c47e789ecb9c965b06a31d08a9 Mon Sep 17 00:00:00 2001
From: Anri Lombard <anri.m.lombard@gmail.com>
Date: Wed, 13 Jul 2022 19:56:47 +0200
Subject: [PATCH 029/127] Lines 310/1996

---
 translations/README-af.md | 15 +++++++++++++++
 1 file changed, 15 insertions(+)

diff --git a/translations/README-af.md b/translations/README-af.md
index 8260cb6..b9828a7 100644
--- a/translations/README-af.md
+++ b/translations/README-af.md
@@ -297,3 +297,18 @@ Skep 'n nuwe tak sodat jy items soos dié kan merk, sit net 'n x in die hakies:
 Virk die Github repo https://github.com/jwasham/coding-interview-university deur om die Fork knop to druk.
 
 Kloon na jou plaaslike repo:
+
+    git clone git@github.com:<your_github_username>/coding-interview-university.git
+    git checkout -b progress
+    git remote add jwasham https://github.com/jwasham/coding-interview-university
+    git fetch --all
+
+Merk al die bokse met X nadat jy jou veranderinge voltooi het:
+
+    git add .
+    git commit -m "Marked x"
+    git rebase jwasham/main
+    git push --set-upstream origin progress
+    git push --force
+
+## Moenie voel asof jy nie slim genoeg is nie
\ No newline at end of file

From bb9912035dc117719736b62d52a5d42c602eb568 Mon Sep 17 00:00:00 2001
From: Anri Lombard <anri.m.lombard@gmail.com>
Date: Wed, 13 Jul 2022 20:00:04 +0200
Subject: [PATCH 030/127] Lines 320/1996

---
 translations/README-af.md | 8 +++++++-
 1 file changed, 7 insertions(+), 1 deletion(-)

diff --git a/translations/README-af.md b/translations/README-af.md
index b9828a7..e0ec04f 100644
--- a/translations/README-af.md
+++ b/translations/README-af.md
@@ -311,4 +311,10 @@ Merk al die bokse met X nadat jy jou veranderinge voltooi het:
     git push --set-upstream origin progress
     git push --force
 
-## Moenie voel asof jy nie slim genoeg is nie
\ No newline at end of file
+## Moenie voel asof jy nie slim genoeg is nie
+
+- Suksesvolle sagteware ingeneurs is slim, maar baie het onsekerhede dat hulle nie slim genoeg is nie.
+- [Die mite van die Geniale Programeerder](https://www.youtube.com/watch?v=0SARbwvhupQ)
+- [Dit is Gevaarlik om Alleen te Gaan: Struikel teen die Onsigbare Monsters in Tegnologie](https://www.youtube.com/watch?v=1i8ylq4j_EY)
+
+## 'n Nota Oor Video Hulpbronne
\ No newline at end of file

From 0565e215693aef77b836fec1b65d805f79155a06 Mon Sep 17 00:00:00 2001
From: Anri Lombard <anri.m.lombard@gmail.com>
Date: Wed, 13 Jul 2022 20:23:55 +0200
Subject: [PATCH 031/127] Lines 330/1996

---
 translations/README-af.md | 16 +++++++++++++++-
 1 file changed, 15 insertions(+), 1 deletion(-)

diff --git a/translations/README-af.md b/translations/README-af.md
index e0ec04f..d9c0dd1 100644
--- a/translations/README-af.md
+++ b/translations/README-af.md
@@ -317,4 +317,18 @@ Merk al die bokse met X nadat jy jou veranderinge voltooi het:
 - [Die mite van die Geniale Programeerder](https://www.youtube.com/watch?v=0SARbwvhupQ)
 - [Dit is Gevaarlik om Alleen te Gaan: Struikel teen die Onsigbare Monsters in Tegnologie](https://www.youtube.com/watch?v=1i8ylq4j_EY)
 
-## 'n Nota Oor Video Hulpbronne
\ No newline at end of file
+## 'n Nota Oor Video Hulpbronne
+
+Sekere videos is net beskikbaar as jy skryf vir 'n kurses in 'n Coursera of EdX klas. Dié is genoem MOOCs.
+Soms is die klasse nie in sessie nie end jy sal moet wag vir 'n paar maande, so jy het nie toegang nie.
+
+Dit sal wonderlik wees om die aanlyn klasse te vervang met gratis en altyd-beskikbare openbare bronne,
+soos YouTube videos (verkieslik universiteitslesings), sodat julle daarvanaf enige tyd kan leer,
+nie net wanneer 'n spesifieke aanlyn kursus in sessie is nie.
+
+## Kies 'n Programmeeringstaal
+
+Jy sal 'n programmeringstaal moet kies vir die kodering onderhoude wat jy gaan doen,
+maar jy sal dan ook 'n taal moet kies waarmee jy rekenaar wetenskap konsepte kan leer.
+
+Verkieslik is die taal dieselfde, sodat jy net vaardigheid in een hoef te bou.
\ No newline at end of file

From 8615643553d04743815b828b62b60fcd605aa711 Mon Sep 17 00:00:00 2001
From: Anri Lombard <anri.m.lombard@gmail.com>
Date: Wed, 13 Jul 2022 20:25:30 +0200
Subject: [PATCH 032/127] Lines 340/1996

---
 translations/README-af.md | 7 ++++++-
 1 file changed, 6 insertions(+), 1 deletion(-)

diff --git a/translations/README-af.md b/translations/README-af.md
index d9c0dd1..3c71897 100644
--- a/translations/README-af.md
+++ b/translations/README-af.md
@@ -331,4 +331,9 @@ nie net wanneer 'n spesifieke aanlyn kursus in sessie is nie.
 Jy sal 'n programmeringstaal moet kies vir die kodering onderhoude wat jy gaan doen,
 maar jy sal dan ook 'n taal moet kies waarmee jy rekenaar wetenskap konsepte kan leer.
 
-Verkieslik is die taal dieselfde, sodat jy net vaardigheid in een hoef te bou.
\ No newline at end of file
+Verkieslik is die taal dieselfde, sodat jy net vaardigheid in een hoef te bou.
+
+### Vir die Studie Plan
+
+Toe ek die studie plan gedoen het, het ek 2 tale gebruik vir meeste van dit: C en Python
+

From 1668eca92562011b79ae899a3462486b55a565a4 Mon Sep 17 00:00:00 2001
From: Anri Lombard <anri.m.lombard@gmail.com>
Date: Wed, 13 Jul 2022 20:38:52 +0200
Subject: [PATCH 033/127] Lines 350/1996

---
 translations/README-af.md | 11 +++++++++++
 1 file changed, 11 insertions(+)

diff --git a/translations/README-af.md b/translations/README-af.md
index 3c71897..4d2c87c 100644
--- a/translations/README-af.md
+++ b/translations/README-af.md
@@ -337,3 +337,14 @@ Verkieslik is die taal dieselfde, sodat jy net vaardigheid in een hoef te bou.
 
 Toe ek die studie plan gedoen het, het ek 2 tale gebruik vir meeste van dit: C en Python
 
+* C: Baie lae vlak. Laat jou toe om met pointers en geheue allocation/deallocation te werk, sodat jy die datastrukture en
+    algoritmes voel in jou bene. In hoër vlak tale soos Python en Java word die weggesteek van jou af. In daaglikse werk is dit wonderlik,
+    maar wanneer jy leer hoe die lae-vlak datastrukture gebou is, voel dit lekker om naby die metaal te wees.
+    - C is orals. Jy sal voorbeelde in boeke, lesings, vidoes, en *oral* sien wanner jy studeer.
+    - [The C Programming Language, Vol 2](https://www.amazon.com/Programming-Language-Brian-W-Kernighan/dp/0131103628)
+        - Dié is 'n kort boek, maar dit sal jou 'n goeie vat gee oor die C taal en as jy dit 'n bikie oefen sal jy vinnig
+            vaardigheid bou. Deur om C te verstaan help dit jou om te verstaan hoe programme en geheue werk.
+        - Jy hoef nie super diep in die boek te gaan nie (of eens dit klaar te maak nie). Gaan net tot die punt waar jy C gemaklik kan lees en skryf.
+        - [Antwoorde vir vrae in die boek](https://github.com/lekkas/c-algorithms)
+* Python: Modern en baie duur, ek het dit geleer want dis super nuttig en laat my toe om minder kode te skruf in 'n onderhoud.
+

From d147234e3fa78fac58c65ad3fb798927f162b0ea Mon Sep 17 00:00:00 2001
From: Anri Lombard <anri.m.lombard@gmail.com>
Date: Wed, 13 Jul 2022 20:40:26 +0200
Subject: [PATCH 034/127] Lines 360/1996

---
 translations/README-af.md | 10 ++++++++++
 1 file changed, 10 insertions(+)

diff --git a/translations/README-af.md b/translations/README-af.md
index 4d2c87c..b38b55b 100644
--- a/translations/README-af.md
+++ b/translations/README-af.md
@@ -348,3 +348,13 @@ Toe ek die studie plan gedoen het, het ek 2 tale gebruik vir meeste van dit: C e
         - [Antwoorde vir vrae in die boek](https://github.com/lekkas/c-algorithms)
 * Python: Modern en baie duur, ek het dit geleer want dis super nuttig en laat my toe om minder kode te skruf in 'n onderhoud.
 
+Die is my voorkeur. Doen jy wat vir jou pas, natuurlik.
+
+Jy mag dit dalk nie nodig kry nie, maar hier is 'n paar webwerwe om jou nuwe taal te leer:
+- [Exercism](https://exercism.org/tracks)
+- [Codewars](http://www.codewars.com)
+- [Codility](https://codility.com/programmers/)
+- [HackerEarth](https://www.hackerearth.com/)
+- [Sphere Online Judge (spoj)](http://www.spoj.com/)
+- [Codechef](https://www.codechef.com/)
+- [Codeforces](https://codeforces.com/)
\ No newline at end of file

From 4a4a51243642940091b757599909b74771544242 Mon Sep 17 00:00:00 2001
From: Anri Lombard <anri.m.lombard@gmail.com>
Date: Wed, 13 Jul 2022 20:43:07 +0200
Subject: [PATCH 035/127] Lines 370/1996

---
 translations/README-af.md | 15 ++++++++++++++-
 1 file changed, 14 insertions(+), 1 deletion(-)

diff --git a/translations/README-af.md b/translations/README-af.md
index b38b55b..e44197e 100644
--- a/translations/README-af.md
+++ b/translations/README-af.md
@@ -357,4 +357,17 @@ Jy mag dit dalk nie nodig kry nie, maar hier is 'n paar webwerwe om jou nuwe taa
 - [HackerEarth](https://www.hackerearth.com/)
 - [Sphere Online Judge (spoj)](http://www.spoj.com/)
 - [Codechef](https://www.codechef.com/)
-- [Codeforces](https://codeforces.com/)
\ No newline at end of file
+- [Codeforces](https://codeforces.com/)
+
+### Vir jou Kodering Onderhoud
+
+Jy kan 'n taal gebruik waarmee jy gemaklik in is om die kodeering deel van die onderhoud te doen, maar vir groot maatskappye is die goeie besluite:
+
+- C++
+- Java
+- Python
+
+Jy kan ook dié gebruik, maar lees eers rond. Daar is baie caveats:
+
+- JavaScript
+- Ruby
\ No newline at end of file

From eb9f87f30ee996f5156de02e5452d64a43a05f16 Mon Sep 17 00:00:00 2001
From: Anri Lombard <anri.m.lombard@gmail.com>
Date: Wed, 13 Jul 2022 20:46:01 +0200
Subject: [PATCH 036/127] Lines 380/1996

---
 translations/README-af.md | 9 ++++++++-
 1 file changed, 8 insertions(+), 1 deletion(-)

diff --git a/translations/README-af.md b/translations/README-af.md
index e44197e..9da0088 100644
--- a/translations/README-af.md
+++ b/translations/README-af.md
@@ -370,4 +370,11 @@ Jy kan 'n taal gebruik waarmee jy gemaklik in is om die kodeering deel van die o
 Jy kan ook dié gebruik, maar lees eers rond. Daar is baie caveats:
 
 - JavaScript
-- Ruby
\ No newline at end of file
+- Ruby
+
+Hier is 'n artikel wat ek geskryf het oor hoe om 'n taal te kies vir die onderhoud: 
+[Pick One Language for the Coding Interview](https://startupnextdoor.com/important-pick-one-language-for-the-coding-interview/).
+Hierdie is die oorspronklike artikel wat my pos op basseer was: [Choosing a Programming Language for Interviews](https://web.archive.org/web/20210516054124/http://blog.codingforinterviews.com/best-programming-language-jobs/)
+
+Jy moet baie gemaklik in die taal wees en kundig.
+

From d06ffe37359bb2870de6d396814ec80c2d03397b Mon Sep 17 00:00:00 2001
From: Anri Lombard <anri.m.lombard@gmail.com>
Date: Wed, 13 Jul 2022 20:48:41 +0200
Subject: [PATCH 037/127] Lines 390/1996

---
 translations/README-af.md | 10 ++++++++++
 1 file changed, 10 insertions(+)

diff --git a/translations/README-af.md b/translations/README-af.md
index 9da0088..1bb3137 100644
--- a/translations/README-af.md
+++ b/translations/README-af.md
@@ -378,3 +378,13 @@ Hierdie is die oorspronklike artikel wat my pos op basseer was: [Choosing a Prog
 
 Jy moet baie gemaklik in die taal wees en kundig.
 
+Lees meer oor besluite:
+- [Choose the Right Language for Your Coding Interview](http://www.byte-by-byte.com/choose-the-right-language-for-your-coding-interview/)
+
+[Sien taal-spesifieke hulpbronne hier](programming-language-resources.md)
+
+## Boeke vir Datastrukture en Algoritmes
+
+Die boek sal jou fondasie vir rekenaar wetenskap vorm.
+
+Kies net een, in die taal waarin jy gemaklik sal wees. Jy sal baie lees en kodeering doen.
\ No newline at end of file

From 5f280782a4019337593e40b32f31198d9647adb3 Mon Sep 17 00:00:00 2001
From: Anri Lombard <anri.m.lombard@gmail.com>
Date: Wed, 13 Jul 2022 20:51:33 +0200
Subject: [PATCH 038/127] Lines 400/1996

---
 translations/README-af.md | 15 ++++++++++++++-
 1 file changed, 14 insertions(+), 1 deletion(-)

diff --git a/translations/README-af.md b/translations/README-af.md
index 1bb3137..bf0fc9f 100644
--- a/translations/README-af.md
+++ b/translations/README-af.md
@@ -387,4 +387,17 @@ Lees meer oor besluite:
 
 Die boek sal jou fondasie vir rekenaar wetenskap vorm.
 
-Kies net een, in die taal waarin jy gemaklik sal wees. Jy sal baie lees en kodeering doen.
\ No newline at end of file
+Kies net een, in die taal waarin jy gemaklik sal wees. Jy sal baie lees en kodeering doen.
+
+### C
+
+- [Algorithms in C, Parts 1-5 (Bundle), 3rd Edition](https://www.amazon.com/Algorithms-Parts-1-5-Bundle-Fundamentals/dp/0201756080)
+    - Fondasie, Datastrukture, Sorteer, Soek, en Grafiek Algoritmes
+
+### Python
+
+- [Data Structures and Algorithms in Python](https://www.amazon.com/Structures-Algorithms-Python-Michael-Goodrich/dp/1118290275/)
+    - deur Goodrich, Tamassia, Goldwasser
+    - Ek lief die boek. Dit dek alles en meer.
+    - Pythonic kode.
+    - my boekverslag: https://startupnextdoor.com/book-report-data-structures-and-algorithms-in-python/
\ No newline at end of file

From 1e57cf31e77339e882bd114417e0541b1e41d5de Mon Sep 17 00:00:00 2001
From: Anri Lombard <anri.m.lombard@gmail.com>
Date: Thu, 14 Jul 2022 19:51:52 +0200
Subject: [PATCH 039/127] Lines 410/1996

---
 translations/README-af.md | 9 ++++++++-
 1 file changed, 8 insertions(+), 1 deletion(-)

diff --git a/translations/README-af.md b/translations/README-af.md
index bf0fc9f..aa9f2f1 100644
--- a/translations/README-af.md
+++ b/translations/README-af.md
@@ -400,4 +400,11 @@ Kies net een, in die taal waarin jy gemaklik sal wees. Jy sal baie lees en kodee
     - deur Goodrich, Tamassia, Goldwasser
     - Ek lief die boek. Dit dek alles en meer.
     - Pythonic kode.
-    - my boekverslag: https://startupnextdoor.com/book-report-data-structures-and-algorithms-in-python/
\ No newline at end of file
+    - my gloeiende boekverslag: https://startupnextdoor.com/book-report-data-structures-and-algorithms-in-python/
+
+### Java
+
+Jou besluit:
+
+- Goodrich, Tamassia, Goldwasser
+    - [Data Structures and Algorithms in Java](https://www.amazon.com/Data-Structures-Algorithms-Michael-Goodrich/dp/1118771338/)
\ No newline at end of file

From 14c5bfcb6fcca315076daaddeefce5ca1b04a773 Mon Sep 17 00:00:00 2001
From: Anri Lombard <anri.m.lombard@gmail.com>
Date: Thu, 14 Jul 2022 19:52:42 +0200
Subject: [PATCH 040/127] Lines 420/1996

---
 translations/README-af.md | 11 ++++++++++-
 1 file changed, 10 insertions(+), 1 deletion(-)

diff --git a/translations/README-af.md b/translations/README-af.md
index aa9f2f1..3df6030 100644
--- a/translations/README-af.md
+++ b/translations/README-af.md
@@ -407,4 +407,13 @@ Kies net een, in die taal waarin jy gemaklik sal wees. Jy sal baie lees en kodee
 Jou besluit:
 
 - Goodrich, Tamassia, Goldwasser
-    - [Data Structures and Algorithms in Java](https://www.amazon.com/Data-Structures-Algorithms-Michael-Goodrich/dp/1118771338/)
\ No newline at end of file
+    - [Data Structures and Algorithms in Java](https://www.amazon.com/Data-Structures-Algorithms-Michael-Goodrich/dp/1118771338/)
+- Sedgewick and Wayne:
+    - [Algorithms](https://www.amazon.com/Algorithms-4th-Robert-Sedgewick/dp/032157351X/)
+    - Free Coursera course that covers the book (taught by the authors!):
+        - [Algorithms I](https://www.coursera.org/learn/algorithms-part1)
+        - [Algorithms II](https://www.coursera.org/learn/algorithms-part2)
+
+### C++
+
+Your choice:

From 8b6a1b7261a7a2d8e41551efd0fea579d65b7e86 Mon Sep 17 00:00:00 2001
From: Anri Lombard <anri.m.lombard@gmail.com>
Date: Thu, 14 Jul 2022 19:55:21 +0200
Subject: [PATCH 041/127] Lines 430/1996

---
 translations/README-af.md | 13 ++++++++++++-
 1 file changed, 12 insertions(+), 1 deletion(-)

diff --git a/translations/README-af.md b/translations/README-af.md
index 3df6030..dc8ffb9 100644
--- a/translations/README-af.md
+++ b/translations/README-af.md
@@ -416,4 +416,15 @@ Jou besluit:
 
 ### C++
 
-Your choice:
+Jou besluit:
+
+- Goodrich, Tamassia, and Mount
+    - [Data Structures and Algorithms in C++, 2nd Edition](https://www.amazon.com/Data-Structures-Algorithms-Michael-Goodrich/dp/0470383275)
+- Sedgewick and Wayne
+    - [Algorithms in C++, Parts 1-4: Fundamentals, Data Structure, Sorting, Searching](https://www.amazon.com/Algorithms-Parts-1-4-Fundamentals-Structure/dp/0201350882/)
+    - [Algorithms in C++ Part 5: Graph Algorithms](https://www.amazon.com/Algorithms-Part-Graph-3rd-Pt-5/dp/0201361183/)
+
+## Onderhoud Voorbereïngsboeke
+
+Jy hoef nie 'n klomp van die te koop nie. Eerlikwaar is "Craking the Coding Interview" heelwaarskynlik genoeg,
+maar ek het meer gekoop om myself meer oefening te gee. Maar ek doen altyd te veel.
\ No newline at end of file

From ffdc08a39729cc6e558f67ab70808099af22de03 Mon Sep 17 00:00:00 2001
From: Anri Lombard <anri.m.lombard@gmail.com>
Date: Thu, 14 Jul 2022 19:59:17 +0200
Subject: [PATCH 042/127] Lines 450/1996

---
 translations/README-af.md | 21 ++++++++++++++++++++-
 1 file changed, 20 insertions(+), 1 deletion(-)

diff --git a/translations/README-af.md b/translations/README-af.md
index dc8ffb9..9fe123d 100644
--- a/translations/README-af.md
+++ b/translations/README-af.md
@@ -427,4 +427,23 @@ Jou besluit:
 ## Onderhoud Voorbereïngsboeke
 
 Jy hoef nie 'n klomp van die te koop nie. Eerlikwaar is "Craking the Coding Interview" heelwaarskynlik genoeg,
-maar ek het meer gekoop om myself meer oefening te gee. Maar ek doen altyd te veel.
\ No newline at end of file
+maar ek het meer gekoop om myself meer oefening te gee. Maar ek doen altyd te veel.
+
+Ek het beide van die gekoop. Hulle het vir my genoeg oefening gegee.
+
+- [Programming Interviews Exposed: Coding Your Way Through the Interview, 4th Edition](https://www.amazon.com/Programming-Interviews-Exposed-Through-Interview/dp/111941847X/)
+    - Antwoorde in C++ en Java
+    - Hierdie is 'n goeie opwarming vir Cracking the Coding Interview
+    - Nie te moeilik nie. Meeste probleme mag dalk makliker wees as dié in die onderhoud (van wat ek gelees het)
+- [Cracking the Coding Interview, 6th Edition](http://www.amazon.com/Cracking-Coding-Interview-6th-Programming/dp/0984782850/)
+    - antwoorde in Java
+
+### As jy tonne ekstra tyd het:
+
+Kies een:
+
+- [Elements of Programming Interviews (C++ version)](https://www.amazon.com/Elements-Programming-Interviews-Insiders-Guide/dp/1479274836)
+- [Elements of Programming Interviews in Python](https://www.amazon.com/Elements-Programming-Interviews-Python-Insiders/dp/1537713949/)
+- [Elements of Programming Interviews (Java version)](https://www.amazon.com/Elements-Programming-Interviews-Java-Insiders/dp/1517435803/)
+        - [Companion Project - Method Stub and Test Cases for Every Problem in the Book](https://github.com/gardncl/elements-of-programming-interviews)
+

From 55839ee6debc23d024d712bb4fe20306863b188b Mon Sep 17 00:00:00 2001
From: Anri Lombard <anri.m.lombard@gmail.com>
Date: Thu, 14 Jul 2022 20:03:58 +0200
Subject: [PATCH 043/127] Lines 460/1996

---
 translations/README-af.md | 10 ++++++++++
 1 file changed, 10 insertions(+)

diff --git a/translations/README-af.md b/translations/README-af.md
index 9fe123d..5b12567 100644
--- a/translations/README-af.md
+++ b/translations/README-af.md
@@ -447,3 +447,13 @@ Kies een:
 - [Elements of Programming Interviews (Java version)](https://www.amazon.com/Elements-Programming-Interviews-Java-Insiders/dp/1517435803/)
         - [Companion Project - Method Stub and Test Cases for Every Problem in the Book](https://github.com/gardncl/elements-of-programming-interviews)
 
+## Moenie My Foute Maak Nie
+
+Hierdie lys het gegroei oor baie maande, en ja, dit het uit die hand geruk.
+
+Hierdie is 'n paar foute wat ek gemaak het sodat jy 'n beter ervaaring het. En jy sal maande se tyd spaar.
+
+### 1. Jy Sal Nie Alles Onthou Nie
+
+Ek het ure lank videos gekyk en deeglike notas gevat, en maande later was daar baie wat ek nie meer onthou het nie. Ek het 3 dae spandeer
+om deur my notas te gaan en flitskaarte te maak, sodat ek kon herleer. Ek het nie al daardie kennis nodig gehaad nie.

From 985a0112e3bbcb66d1cd050f5b977d133ffda023 Mon Sep 17 00:00:00 2001
From: Anri Lombard <anri.m.lombard@gmail.com>
Date: Thu, 14 Jul 2022 20:08:02 +0200
Subject: [PATCH 044/127] Lines 470/1996

---
 translations/README-af.md | 10 ++++++++++
 1 file changed, 10 insertions(+)

diff --git a/translations/README-af.md b/translations/README-af.md
index 5b12567..5b1224c 100644
--- a/translations/README-af.md
+++ b/translations/README-af.md
@@ -457,3 +457,13 @@ Hierdie is 'n paar foute wat ek gemaak het sodat jy 'n beter ervaaring het. En j
 
 Ek het ure lank videos gekyk en deeglike notas gevat, en maande later was daar baie wat ek nie meer onthou het nie. Ek het 3 dae spandeer
 om deur my notas te gaan en flitskaarte te maak, sodat ek kon herleer. Ek het nie al daardie kennis nodig gehaad nie.
+
+Asseblief, lees sodat jy nie my foute maak nie:
+
+[Retaining Computer Science Knowledge](https://startupnextdoor.com/retaining-computer-science-knowledge/).
+
+### 2. Gebruik flitskaarte
+
+Om die probleem op te los, het ek a klein flitskaart webwerf gemaak waar ek 2 tipe flitskaarte kon byvoeg: algemeen en kode.
+
+Maak jou eie verniet:

From 2f48747443be50d6ac71090b1352610ea566d45b Mon Sep 17 00:00:00 2001
From: Anri Lombard <anri.m.lombard@gmail.com>
Date: Thu, 14 Jul 2022 20:14:06 +0200
Subject: [PATCH 045/127] Lines 480/1996

---
 translations/README-af.md | 12 +++++++++++-
 1 file changed, 11 insertions(+), 1 deletion(-)

diff --git a/translations/README-af.md b/translations/README-af.md
index 5b1224c..d67580c 100644
--- a/translations/README-af.md
+++ b/translations/README-af.md
@@ -456,7 +456,7 @@ Hierdie is 'n paar foute wat ek gemaak het sodat jy 'n beter ervaaring het. En j
 ### 1. Jy Sal Nie Alles Onthou Nie
 
 Ek het ure lank videos gekyk en deeglike notas gevat, en maande later was daar baie wat ek nie meer onthou het nie. Ek het 3 dae spandeer
-om deur my notas te gaan en flitskaarte te maak, sodat ek kon herleer. Ek het nie al daardie kennis nodig gehaad nie.
+om deur my notas te gaan en flitskaarte te maak, sodat ek kon revisie. Ek het nie al daardie kennis nodig gehaad nie.
 
 Asseblief, lees sodat jy nie my foute maak nie:
 
@@ -465,5 +465,15 @@ Asseblief, lees sodat jy nie my foute maak nie:
 ### 2. Gebruik flitskaarte
 
 Om die probleem op te los, het ek a klein flitskaart webwerf gemaak waar ek 2 tipe flitskaarte kon byvoeg: algemeen en kode.
+Elke kaart se formatering was verskillend. Ek het 'n mobiele-eerste webwerf gemaak, so ek kon revisie op my foon en tablet, waarookal ek is.
 
 Maak jou eie verniet:
+
+- [Flashcards site repo](https://github.com/jwasham/computer-science-flash-cards)
+
+**Ek BEVEEL NIE AAN dat jy my flitskaarte gebruik nie.** Daar is te veel onnodige kaarte wat jy nie nodig het nie.
+
+Maar as jy nie na my wil luister nie, hier is hulle:
+- [My flash cards database (1200 cards)](https://github.com/jwasham/computer-science-flash-cards/blob/main/cards-jwasham.db):
+- [My flash cards database (extreme - 1800 cards)](https://github.com/jwasham/computer-science-flash-cards/blob/main/cards-jwasham-extreme.db):
+

From f99ec118e1d014fc621a7a168ee83800ce37de99 Mon Sep 17 00:00:00 2001
From: Anri Lombard <anri.m.lombard@gmail.com>
Date: Thu, 14 Jul 2022 20:21:45 +0200
Subject: [PATCH 046/127] Lines 490/1996

---
 translations/README-af.md | 10 ++++++++++
 1 file changed, 10 insertions(+)

diff --git a/translations/README-af.md b/translations/README-af.md
index d67580c..11f6387 100644
--- a/translations/README-af.md
+++ b/translations/README-af.md
@@ -477,3 +477,13 @@ Maar as jy nie na my wil luister nie, hier is hulle:
 - [My flash cards database (1200 cards)](https://github.com/jwasham/computer-science-flash-cards/blob/main/cards-jwasham.db):
 - [My flash cards database (extreme - 1800 cards)](https://github.com/jwasham/computer-science-flash-cards/blob/main/cards-jwasham-extreme.db):
 
+Hou in gedagte dat ek oorboord gegaan het en het kaarte wat alles van assembly taal en Python trivia na masjien leer en statistiek dek.
+Dit te veel vir wat nodig is.
+
+**Nota op flitskaarte:** Die eerste keer wat jy erken dat jy die anwoord ken, moenie dit as ken merk nie. Jy moet dieselfde
+kaart sien en dit vele kere reg beantwoord voordat jy regtig dit ken. Herhaling sal die kennis diepier
+in jou brein berê.
+
+As 'n alternatief na my flitskaart webwerf is [Anki](http://ankisrs.net/), wat vir my voorgestel is talle kere.
+Dit gebruik 'n herhalingssisteem om te help onthou. Dit gebruikers-vriendelik, beskikbaar op alle platforms en het 'n wolk sync sisteem.
+Dit kos $25 op iOS maar is verniet op ander platforms.

From e859cf725a5339e85839fd491ac6251b9c3ebf4f Mon Sep 17 00:00:00 2001
From: Anri Lombard <anri.m.lombard@gmail.com>
Date: Thu, 14 Jul 2022 20:27:54 +0200
Subject: [PATCH 047/127] Lines 500/1996

---
 translations/README-af.md | 10 ++++++++++
 1 file changed, 10 insertions(+)

diff --git a/translations/README-af.md b/translations/README-af.md
index 11f6387..8426111 100644
--- a/translations/README-af.md
+++ b/translations/README-af.md
@@ -487,3 +487,13 @@ in jou brein berê.
 As 'n alternatief na my flitskaart webwerf is [Anki](http://ankisrs.net/), wat vir my voorgestel is talle kere.
 Dit gebruik 'n herhalingssisteem om te help onthou. Dit gebruikers-vriendelik, beskikbaar op alle platforms en het 'n wolk sync sisteem.
 Dit kos $25 op iOS maar is verniet op ander platforms.
+
+My flitskaart databasis in Anki formaat: https://ankiweb.net/shared/info/25173560 (dankie [@xiewenya](https://github.com/xiewenya)).
+
+Sommige studente het 'n kwessie na vore gebring dat daar wit spasie is in die formatering wat reg gemaak kan word met die volgende stappe: open deck, edit card, kliek cards, kies die "styling" radio knop, verg by die member "white-space: pre;" aan die einde van die card class.
+
+### 3. Doen Kodering Onderhoud Vrae Terwyl Jy Leer
+
+HIERDIE IS BAIE BELANGRIK.
+
+Begin met die kodering onderhoud vrae terwyl jy datastrukture en algoritmes leer.

From 49fb9a01d7e357c2b8f1db2f339b506eb8812d7f Mon Sep 17 00:00:00 2001
From: Anri Lombard <anri.m.lombard@gmail.com>
Date: Thu, 14 Jul 2022 20:35:11 +0200
Subject: [PATCH 048/127] Lines 510/1996

---
 translations/README-af.md | 13 ++++++++++++-
 1 file changed, 12 insertions(+), 1 deletion(-)

diff --git a/translations/README-af.md b/translations/README-af.md
index 8426111..77c1010 100644
--- a/translations/README-af.md
+++ b/translations/README-af.md
@@ -120,7 +120,7 @@ sagteware ontwikkeling/ingeneur rolle.
 - ['n Nota Oor Video Hulpbronne](#n-nota-oor-video-hulpbronne)
 - [Kies 'n Programmeeringstaal](#kies-n-programmeeringstaal)
 - [Boeke vir Datastrukture en Algoritmes](#boeke-vir-datastrukture-en-algoritmes)
-- [Onderhoud Voorbereïngsboeke](#onderhoud-voorbereiding)
+- [Onderhoud Voorbereïngsboeke](#onderhoud-voorbereidingsboeke)
 - [Moenie My Foute Maak Nie](#moenie-my-foute-maak-nie)
 - [Wat Jy Nie Sal Sien Gedek Word Nie](#wat-jy-nie-sal-sien-gedek-word-nie)
 - [Die Daaglikse Plan](#die-daaglikse-plan)
@@ -497,3 +497,14 @@ Sommige studente het 'n kwessie na vore gebring dat daar wit spasie is in die fo
 HIERDIE IS BAIE BELANGRIK.
 
 Begin met die kodering onderhoud vrae terwyl jy datastrukture en algoritmes leer.
+
+Jy moet toepas wat jy leer om probleme op te los, of jy sal vergeet. Ek het die fout gemaak.
+
+Sodra jy 'n onderwerp geleer het, en voel sowat gemaklik met dit, byvoorbeeld, **linked lists**:
+1. Maak een van die [Onderhoud Voorbereïngsboeke](#onderhoud-voorbereidingsboeke) (of kodering probleem webwerve, onder gelys) oop
+2. Doen 2 of 3 vrae met betrekking tot linked lists.
+3. Beweeg aan na die volgende onderwerp.
+4. Later, gaan terug en doen nog 2 of 3 linked list probleme.
+5. Doen hierdie met elke nuwe onderwerp wat jy leer.
+
+**Hou aan probleme doen terwyl jy al hierdie goed leer, nie na die tyd nie.**

From b87dca972409e5e038bb9b421f39cfbb3ccccafe Mon Sep 17 00:00:00 2001
From: Anri Lombard <anri.m.lombard@gmail.com>
Date: Thu, 14 Jul 2022 20:38:22 +0200
Subject: [PATCH 049/127] Lines 520/1996

---
 translations/README-af.md | 9 +++++++++
 1 file changed, 9 insertions(+)

diff --git a/translations/README-af.md b/translations/README-af.md
index 77c1010..c99a80a 100644
--- a/translations/README-af.md
+++ b/translations/README-af.md
@@ -508,3 +508,12 @@ Sodra jy 'n onderwerp geleer het, en voel sowat gemaklik met dit, byvoorbeeld, *
 5. Doen hierdie met elke nuwe onderwerp wat jy leer.
 
 **Hou aan probleme doen terwyl jy al hierdie goed leer, nie na die tyd nie.**
+
+Jy word nie aangestel vir kennis nie, maar hoe jy die kennis toepas.
+
+Daar is baie hulpbronne vir dié glys onder. Gaan voort.
+
+### 4. Fokus
+
+Daar is 'n klomp afleidings wat jou kosbare tyd kan opvat. Fokus en konsentreer is moelik. Sit musiek
+aan sonder lirieke en jy sal in staat wees of goed te fokus.

From cc280bfd700dbdf12514b56f872d87df06518e6e Mon Sep 17 00:00:00 2001
From: Anri Lombard <anri.m.lombard@gmail.com>
Date: Thu, 14 Jul 2022 20:41:13 +0200
Subject: [PATCH 050/127] Lines 530/1996

---
 translations/README-af.md | 10 ++++++++++
 1 file changed, 10 insertions(+)

diff --git a/translations/README-af.md b/translations/README-af.md
index c99a80a..c5c49c2 100644
--- a/translations/README-af.md
+++ b/translations/README-af.md
@@ -517,3 +517,13 @@ Daar is baie hulpbronne vir dié glys onder. Gaan voort.
 
 Daar is 'n klomp afleidings wat jou kosbare tyd kan opvat. Fokus en konsentreer is moelik. Sit musiek
 aan sonder lirieke en jy sal in staat wees of goed te fokus.
+
+## Wat Jy Nie Sal Sien Gedek Word Nie
+
+Hierdie is algemene tegnologie maar is nie deel van hierdie studie plan nie:
+
+- SQL
+- Javascript
+- HTML, CSS, en ander front-end tegnologie.
+
+## Die Daaglikse Plan

From 648c776c723d8ca33c693eacd3e40ef363032ef9 Mon Sep 17 00:00:00 2001
From: Anri Lombard <anri.m.lombard@gmail.com>
Date: Thu, 14 Jul 2022 20:46:33 +0200
Subject: [PATCH 051/127] Lines 540/1996

---
 translations/README-af.md | 11 +++++++++++
 1 file changed, 11 insertions(+)

diff --git a/translations/README-af.md b/translations/README-af.md
index c5c49c2..9c56b4a 100644
--- a/translations/README-af.md
+++ b/translations/README-af.md
@@ -527,3 +527,14 @@ Hierdie is algemene tegnologie maar is nie deel van hierdie studie plan nie:
 - HTML, CSS, en ander front-end tegnologie.
 
 ## Die Daaglikse Plan
+
+Die kursus gaan oor baie onderwerpe. Elkeen sal heerwaarskynlik jou 'n paar dae vat, of dalk tog 'n week of meer. Dit hang af van jou skedule.
+
+Elke dag, vat die volgende onderwerp op die lys, kyk 'n paar videos oor daardie onderwerp, en dan skryf 'n implimentering
+van daardie datastruktuur of algoritme in die taal wat jy gekies het vir hierdie kursus.
+
+Jy kan my kode hier sien:
+ - [C](https://github.com/jwasham/practice-c)
+ - [C++](https://github.com/jwasham/practice-cpp)
+ - [Python](https://github.com/jwasham/practice-python)
+

From db9657308d401f9e485874cdf460685d20ca3835 Mon Sep 17 00:00:00 2001
From: Anri Lombard <anri.m.lombard@gmail.com>
Date: Thu, 14 Jul 2022 20:51:48 +0200
Subject: [PATCH 052/127] Lines 550/1996

---
 translations/README-af.md | 12 ++++++++++++
 1 file changed, 12 insertions(+)

diff --git a/translations/README-af.md b/translations/README-af.md
index 9c56b4a..35a6810 100644
--- a/translations/README-af.md
+++ b/translations/README-af.md
@@ -538,3 +538,15 @@ Jy kan my kode hier sien:
  - [C++](https://github.com/jwasham/practice-cpp)
  - [Python](https://github.com/jwasham/practice-python)
 
+Jy hoef nie elke algoritme the memoriseer nie. Jy moet net dit genoeg verstaan om jou eie implimenteering te skryf.
+
+## Kodering Vrae Beoefening
+
+    Hoekom is dié hier? Ek's nie gereed vir onderhoude nie.
+
+[Dan gaan terug en lees die.](#3-doen-kodering-onderhoud-vrae-terwyl-jy-leer)
+
+Hoekom jy oplossings na programeringprobleme moet oefen:
+- Probleem erkenning, en waar die regte datastrukture en algoritmes inpas
+- Versameling van vereistes vir die probleem
+- 
\ No newline at end of file

From 25c91fdceadf037a43fa8bb53354b89fbf08f056 Mon Sep 17 00:00:00 2001
From: Anri Lombard <anri.m.lombard@gmail.com>
Date: Thu, 14 Jul 2022 21:28:32 +0200
Subject: [PATCH 053/127] Lines 560/1996

---
 translations/README-af.md | 9 ++++++++-
 1 file changed, 8 insertions(+), 1 deletion(-)

diff --git a/translations/README-af.md b/translations/README-af.md
index 35a6810..cd42e1b 100644
--- a/translations/README-af.md
+++ b/translations/README-af.md
@@ -549,4 +549,11 @@ Jy hoef nie elke algoritme the memoriseer nie. Jy moet net dit genoeg verstaan o
 Hoekom jy oplossings na programeringprobleme moet oefen:
 - Probleem erkenning, en waar die regte datastrukture en algoritmes inpas
 - Versameling van vereistes vir die probleem
-- 
\ No newline at end of file
+- Praat oor hoe jy die probleem oplos soos jy sal in die onderhoud
+- Kodering op 'n wit bord of papier, nie 'n rekenaar nie
+- Om te formuleer wat die tyd-en-spasie-kompleksiteit vir jou oplossing is (sien Big-O onder)
+- Toets jou oplossing
+
+Daar is 'n wonderlike inleiding vir metodiese, kommunikatiewe probleem oplossing in 'n onderhoud. Jy sal dié ook van die
+programmeering boeke kry, maar ek het die uitstekend gevind:
+[Algorithm design canvas](http://www.hiredintech.com/algorithm-design/)

From f74970afa35653252cda1414128533c5ed7c3625 Mon Sep 17 00:00:00 2001
From: Anri Lombard <anri.m.lombard@gmail.com>
Date: Thu, 14 Jul 2022 21:34:37 +0200
Subject: [PATCH 054/127] Lines 570/1996

---
 translations/README-af.md | 10 ++++++++++
 1 file changed, 10 insertions(+)

diff --git a/translations/README-af.md b/translations/README-af.md
index cd42e1b..7cf75d2 100644
--- a/translations/README-af.md
+++ b/translations/README-af.md
@@ -557,3 +557,13 @@ Hoekom jy oplossings na programeringprobleme moet oefen:
 Daar is 'n wonderlike inleiding vir metodiese, kommunikatiewe probleem oplossing in 'n onderhoud. Jy sal dié ook van die
 programmeering boeke kry, maar ek het die uitstekend gevind:
 [Algorithm design canvas](http://www.hiredintech.com/algorithm-design/)
+
+Skryf kode op 'n wit bord of papier, nie 'n rekenaar nie. Toets met sommige insette. Dan tik en toets dit op 'n rekenaar.
+
+As jy nie 'n wit bord by die huis het nie, tel 'n groot skryfblad op by die kuns winkel. Jy kan sit op die bank en oefen.
+Dié is my "sofa whiteboard". Ek het die pen in die foto gesit vir skaal. As jy 'n pen gebruik gaan jy wens jy kon dit uitvee.
+Word baie morsig. **Ek gebruik 'n potlood en uitveër.**
+
+![my sofa whiteboard](https://d3j2pkmjtin6ou.cloudfront.net/art_board_sm_2.jpg)
+
+**Kodering vrae oefening is nie oor oplossings van programmering probleme memoriseer nie.**

From dc427333f74734bd64e141ef4f803edf855fb5b8 Mon Sep 17 00:00:00 2001
From: Anri Lombard <anri.m.lombard@gmail.com>
Date: Thu, 14 Jul 2022 21:37:09 +0200
Subject: [PATCH 055/127] Lines 580/1996

---
 translations/README-af.md | 10 ++++++++++
 1 file changed, 10 insertions(+)

diff --git a/translations/README-af.md b/translations/README-af.md
index 7cf75d2..304630a 100644
--- a/translations/README-af.md
+++ b/translations/README-af.md
@@ -567,3 +567,13 @@ Word baie morsig. **Ek gebruik 'n potlood en uitveër.**
 ![my sofa whiteboard](https://d3j2pkmjtin6ou.cloudfront.net/art_board_sm_2.jpg)
 
 **Kodering vrae oefening is nie oor oplossings van programmering probleme memoriseer nie.**
+
+## Kodering Problem
+
+Moenie jou sleutel kodering onderhoud boeke vergeet [hier](#onderhoud-voorbereidingsboeke) nie.
+
+Probleme Oplos:
+- [How to Find a Solution](https://www.topcoder.com/thrive/articles/How%20To%20Find%20a%20Solution)
+- [How to Dissect a Topcoder Problem Statement](https://www.topcoder.com/thrive/articles/How%20To%20Dissect%20a%20Topcoder%20Problem%20Statement%20Content)
+
+Kodering Onderhoud Vrae Videos:

From f14506b0d3d6577ccbd40c1334b365631be17dab Mon Sep 17 00:00:00 2001
From: Anri Lombard <anri.m.lombard@gmail.com>
Date: Thu, 14 Jul 2022 21:40:15 +0200
Subject: [PATCH 056/127] Lines 590/1996

---
 translations/README-af.md | 12 ++++++++++++
 1 file changed, 12 insertions(+)

diff --git a/translations/README-af.md b/translations/README-af.md
index 304630a..e20310d 100644
--- a/translations/README-af.md
+++ b/translations/README-af.md
@@ -577,3 +577,15 @@ Probleme Oplos:
 - [How to Dissect a Topcoder Problem Statement](https://www.topcoder.com/thrive/articles/How%20To%20Dissect%20a%20Topcoder%20Problem%20Statement%20Content)
 
 Kodering Onderhoud Vrae Videos:
+- [IDeserve (88 videos)](https://www.youtube.com/playlist?list=PLamzFoFxwoNjPfxzaWqs7cZGsPYy0x_gI)
+- [Tushar Roy (5 playlists)](https://www.youtube.com/user/tusharroy2525/playlists?shelf_id=2&view=50&sort=dd)
+    - Super om deur oplossings vir die kode te loop
+- [Nick White - LeetCode Solutions (187 Videos)](https://www.youtube.com/playlist?list=PLU_sdQYzUj2keVENTP0a5rdykRSgg9Wp-)
+    - Goeie verduidelikings van oplossings en die kode
+    - Jy kan 'n klomp kyk in 'n klein tyd
+- [FisherCoder - LeetCode Solutions](https://youtube.com/FisherCoder)
+- [Neetcode - BLIND 75 LeetCode Solutions](https://www.youtube.com/watch?v=KLlXCFG5TnA&list=PLot-Xpze53ldVwtstag2TL4HQhAnC8ATf)
+    - Goeie verduidelikings van die oplossings en die python kode
+    - Sien ook [excel sheet](https://docs.google.com/spreadsheets/d/1A2PaQKcdwO_lwxz9bAnxXnIQayCouZP6d-ENrBz_NXc/edit#gid=0) vir all die vrae lyste
+    - [Github links](https://github.com/neetcode-gh/leetcode) vir al die oplossing lyste
+    - [Neetcode 150](https://neetcode.io/)
\ No newline at end of file

From 22079bcadd3528391fdfa75eb634d12febe6745a Mon Sep 17 00:00:00 2001
From: Anri Lombard <anri.m.lombard@gmail.com>
Date: Thu, 14 Jul 2022 21:43:03 +0200
Subject: [PATCH 057/127] Lines 600/1996

---
 translations/README-af.md | 12 +++++++++++-
 1 file changed, 11 insertions(+), 1 deletion(-)

diff --git a/translations/README-af.md b/translations/README-af.md
index e20310d..cc1d0a9 100644
--- a/translations/README-af.md
+++ b/translations/README-af.md
@@ -588,4 +588,14 @@ Kodering Onderhoud Vrae Videos:
     - Goeie verduidelikings van die oplossings en die python kode
     - Sien ook [excel sheet](https://docs.google.com/spreadsheets/d/1A2PaQKcdwO_lwxz9bAnxXnIQayCouZP6d-ENrBz_NXc/edit#gid=0) vir all die vrae lyste
     - [Github links](https://github.com/neetcode-gh/leetcode) vir al die oplossing lyste
-    - [Neetcode 150](https://neetcode.io/)
\ No newline at end of file
+    - [Neetcode 150](https://neetcode.io/)
+
+Uitdaging webwerwe:
+- [LeetCode](https://leetcode.com/)
+    - My gunstelling kodering platform werf. Die geld vir die intekening is die moeite werd vir die moontlike 1-2 maande se voorbereiding.
+    - Sien Nick White en FisherCoder Videos bo om deur die kode toe loop.
+- [HackerRank](https://www.hackerrank.com/)
+- [TopCoder](https://www.topcoder.com/)
+- [Geeks for Geeks](https://practice.geeksforgeeks.org/explore/?page=1)
+- [InterviewBit](https://www.interviewbit.com/)
+- [Project Euler](https://projecteuler.net/)
\ No newline at end of file

From 20d02e94c7064ecb9fc3bd3deb624573036d4d71 Mon Sep 17 00:00:00 2001
From: Anri Lombard <anri.m.lombard@gmail.com>
Date: Fri, 15 Jul 2022 21:15:20 +0200
Subject: [PATCH 058/127] Lines 611/1996

---
 translations/README-af.md | 11 ++++++++++-
 1 file changed, 10 insertions(+), 1 deletion(-)

diff --git a/translations/README-af.md b/translations/README-af.md
index cc1d0a9..313bb9f 100644
--- a/translations/README-af.md
+++ b/translations/README-af.md
@@ -598,4 +598,13 @@ Uitdaging webwerwe:
 - [TopCoder](https://www.topcoder.com/)
 - [Geeks for Geeks](https://practice.geeksforgeeks.org/explore/?page=1)
 - [InterviewBit](https://www.interviewbit.com/)
-- [Project Euler](https://projecteuler.net/)
\ No newline at end of file
+- [Project Euler](https://projecteuler.net/)
+
+## Begin Solank
+
+Oraait, genoeg praat, kom ons leer!
+
+Maar moet nie vergeet om kode probleme op te los terwyl jy leer nie!
+
+## Algoritmiese kompleksiteit / Big-O / Asimptotiese analiese
+

From 52bdfd163aebc94a2f81d6a8d87154d30b42a33c Mon Sep 17 00:00:00 2001
From: Anri Lombard <anri.m.lombard@gmail.com>
Date: Fri, 15 Jul 2022 21:20:13 +0200
Subject: [PATCH 059/127] Lines 620/1996

---
 translations/README-af.md | 14 ++++++++++++++
 1 file changed, 14 insertions(+)

diff --git a/translations/README-af.md b/translations/README-af.md
index 313bb9f..7cf54f7 100644
--- a/translations/README-af.md
+++ b/translations/README-af.md
@@ -608,3 +608,17 @@ Maar moet nie vergeet om kode probleme op te los terwyl jy leer nie!
 
 ## Algoritmiese kompleksiteit / Big-O / Asimptotiese analiese
 
+- Niks hier om te implimenteer nie, jy kyk net videos en vat notas! Yay!
+- Daar is baie videos hier. Kyk net genoeg tot dat jy dit verstaan. Jy kan altyd terug kom en revisie.
+- Moenie bekommer as jy nie al die wiskunde verstaan nie.
+- Jy moet net verstaan hoe om die kompleksiteit van 'n algoritme in terme van Big-O uit te druk.
+- [ ] [Harvard CS50 - Asymptotic Notation (video)](https://www.youtube.com/watch?v=iOq5kSKqeR4)
+- [ ] [Big O Notations (general quick tutorial) (video)](https://www.youtube.com/watch?v=V6mKVRU1evU)
+- [ ] [Big O Notation (and Omega and Theta) - best mathematical explanation (video)](https://www.youtube.com/watch?v=ei-A_wy5Yxw&index=2&list=PL1BaGV1cIH4UhkL8a9bJGG356covJ76qN)
+- [ ] [Skiena (video)](https://www.youtube.com/watch?v=z1mkCe3kVUA)
+- [ ] [UC Berkeley Big O (video)](https://archive.org/details/ucberkeley_webcast_VIS4YDpuP98)
+- [ ] [Amortized Analysis (video)](https://www.youtube.com/watch?v=B3SpQZaAZP4&index=10&list=PL1BaGV1cIH4UhkL8a9bJGG356covJ76qN)
+- [ ] TopCoder (includes recurrence relations and master theorem):
+    - [Computational Complexity: Section 1](https://www.topcoder.com/thrive/articles/Computational%20Complexity%20part%20one)
+    - [Computational Complexity: Section 2](https://www.topcoder.com/thrive/articles/Computational%20Complexity%20part%20two)
+- [ ] [Cheat sheet](http://bigocheatsheet.com/)
\ No newline at end of file

From eef8d697e0af183234e11d35c5ef3cc215d2091a Mon Sep 17 00:00:00 2001
From: Anri Lombard <anri.m.lombard@gmail.com>
Date: Fri, 15 Jul 2022 21:23:17 +0200
Subject: [PATCH 060/127] Lines 630/1996

---
 translations/README-af.md | 7 ++++++-
 1 file changed, 6 insertions(+), 1 deletion(-)

diff --git a/translations/README-af.md b/translations/README-af.md
index 7cf54f7..7aaed82 100644
--- a/translations/README-af.md
+++ b/translations/README-af.md
@@ -621,4 +621,9 @@ Maar moet nie vergeet om kode probleme op te los terwyl jy leer nie!
 - [ ] TopCoder (includes recurrence relations and master theorem):
     - [Computational Complexity: Section 1](https://www.topcoder.com/thrive/articles/Computational%20Complexity%20part%20one)
     - [Computational Complexity: Section 2](https://www.topcoder.com/thrive/articles/Computational%20Complexity%20part%20two)
-- [ ] [Cheat sheet](http://bigocheatsheet.com/)
\ No newline at end of file
+- [ ] [Cheat sheet](http://bigocheatsheet.com/)
+
+Well, dis genoeg van daardie.
+
+Wanneer jy deur "Cracking the Coding Interview" gaan, is daar 'n hoofstuk oor hierdie, en by die einde is daar 'n quiz om te sien
+of jy kan identifiseer wat die runtime kompleksiteit van verskeie algoritmes is. Dis 'n super revisie en toets.

From 9864d1826e954cea3b647d04f70a36b9798250ad Mon Sep 17 00:00:00 2001
From: Anri Lombard <anri.m.lombard@gmail.com>
Date: Fri, 15 Jul 2022 21:37:32 +0200
Subject: [PATCH 061/127] Lines 650/1996

---
 translations/README-af.md | 23 +++++++++++++++++++++++
 1 file changed, 23 insertions(+)

diff --git a/translations/README-af.md b/translations/README-af.md
index 7aaed82..71cda7d 100644
--- a/translations/README-af.md
+++ b/translations/README-af.md
@@ -627,3 +627,26 @@ Well, dis genoeg van daardie.
 
 Wanneer jy deur "Cracking the Coding Interview" gaan, is daar 'n hoofstuk oor hierdie, en by die einde is daar 'n quiz om te sien
 of jy kan identifiseer wat die runtime kompleksiteit van verskeie algoritmes is. Dis 'n super revisie en toets.
+
+## Datastrukture
+
+- ### Skikkings
+    - [ ] Oor Skikkings:
+        - [Arrays (video)](https://www.coursera.org/lecture/data-structures/arrays-OsBSF)
+        - [UC Berkeley CS61B - Linear and Multi-Dim Arrays (video)](https://archive.org/details/ucberkeley_webcast_Wp8oiO_CZZE) (Begin kyk van 15m 32s)
+        - [Dynamic Arrays (video)](https://www.coursera.org/lecture/data-structures/dynamic-arrays-EwbnV)
+        - [Jagged Arrays (video)](https://www.youtube.com/watch?v=1jtrQqYpt7g)
+    - [ ] Implement 'n vektor (mutable skikking met outomatiese grootte verandering)
+        - [ ] Oefen kodering met skikkings en wysers, en wysers wiskunde om te spring na 'n indeks in pleks van indeksering te gebruik.
+        - [ ] Nuwe rou data skikking met gelokeerde geheue
+            - kan int skikking alokeer onder die kap, maar net nie die kenmerke gebruik nie
+            - begin met 16, of as begin nommer groter is, gebruik bevoegdhede van 2 - 16, 32, 64, 128
+        - [ ] size() - hoeveelheid items
+        - [ ] capacity() - hoeveelheid items dit kan hou
+        - [ ] is_empty()
+        - [ ] at(index) - lewer item by gegewende indeks, omplof as indeks buite grens is
+        - [ ] push(item)
+        - [ ] insert(index, item) - voeg item by indeks, skuif daardie indeks se waarde en rank elemente regs
+        - [ ] prepend(item) - kan insert hierbo gebruik by indeks 0
+        - [ ] pop() - verwyder van die einde, lewer waarde
+        - [ ] delete(indeks) - 
\ No newline at end of file

From b88b908ef31ae8b2576c63b4e625fbaa02ab0e55 Mon Sep 17 00:00:00 2001
From: Anri Lombard <anri.m.lombard@gmail.com>
Date: Fri, 15 Jul 2022 21:47:16 +0200
Subject: [PATCH 062/127] Lines 660/1996

---
 translations/README-af.md | 16 +++++++++++++---
 1 file changed, 13 insertions(+), 3 deletions(-)

diff --git a/translations/README-af.md b/translations/README-af.md
index 71cda7d..7f26fe4 100644
--- a/translations/README-af.md
+++ b/translations/README-af.md
@@ -644,9 +644,19 @@ of jy kan identifiseer wat die runtime kompleksiteit van verskeie algoritmes is.
         - [ ] size() - hoeveelheid items
         - [ ] capacity() - hoeveelheid items dit kan hou
         - [ ] is_empty()
-        - [ ] at(index) - lewer item by gegewende indeks, omplof as indeks buite grens is
+        - [ ] at(indeks) - lewer item by gegewende indeks, omplof as indeks buite grens is
         - [ ] push(item)
-        - [ ] insert(index, item) - voeg item by indeks, skuif daardie indeks se waarde en rank elemente regs
+        - [ ] insert(indeks, item) - voeg item by indeks, skuif daardie indeks se waarde en rank elemente regs
         - [ ] prepend(item) - kan insert hierbo gebruik by indeks 0
         - [ ] pop() - verwyder van die einde, lewer waarde
-        - [ ] delete(indeks) - 
\ No newline at end of file
+        - [ ] delete(indeks) - skrap item by indeks, skuif al rank elemente links
+        - [ ] remove(item) - kyk vir waarde en verwyder indeks wat dit hou (al is dit in verskeie plekke)
+        - [ ] find(item) - kyk vir waarde en lewer eerste indeks met daardie waarde, -1 as dit nie bestaan nie
+        - [ ] resize(new_capacity) // privaat funksie
+            - wanner jy kapasiteit bereik, verander om die grootte te dubbel
+            - wanneer 'n item pop, as grootte 1/4 van kapasiteit is, verander na half
+        - [ ] Tyd
+            - O(1) om te add/verwyder aan die einde (geamoriënteer vir toekening van meer spasie), indekx, of updateer
+            - O(n) om te voeg/skrap elders
+        - [ ] Spasie
+            - 
\ No newline at end of file

From 8015016d18ed2780d20b4996a3f1e3dfe0800ecd Mon Sep 17 00:00:00 2001
From: Anri Lombard <anri.m.lombard@gmail.com>
Date: Fri, 15 Jul 2022 23:13:48 +0200
Subject: [PATCH 063/127] Lines 670/1996

---
 translations/README-af.md | 13 +++++++++++--
 1 file changed, 11 insertions(+), 2 deletions(-)

diff --git a/translations/README-af.md b/translations/README-af.md
index 7f26fe4..2cb7ca6 100644
--- a/translations/README-af.md
+++ b/translations/README-af.md
@@ -232,7 +232,7 @@ sagteware ontwikkeling/ingeneur rolle.
   - [Kodering Vrae Beoefening](#kodering-vrae-beoefening)
   - [Kodering Probleme](#kodering-probleme)
   - [Begin Solank](#begin-solank)
-  - [Algoritmiese Kompleksiteit / Big-O / Asimptotiese analise](#algorithmic-complexity--big-o--asymptotic-analysis)
+  - [Algoritmiese Kompleksiteit / Big-O / Asimptotiese analise](#algoritmiese-kompleksiteti--big-o--asimptotiese-analise)
   - [Datastrukture](#datastrukture)
   - [Meer Kennis](#meer-kennis)
   - [Bome](#bome)
@@ -659,4 +659,13 @@ of jy kan identifiseer wat die runtime kompleksiteit van verskeie algoritmes is.
             - O(1) om te add/verwyder aan die einde (geamoriënteer vir toekening van meer spasie), indekx, of updateer
             - O(n) om te voeg/skrap elders
         - [ ] Spasie
-            - 
\ No newline at end of file
+            - aaneenlopend in geheue, so nabyheid help prestasie
+            - spasie nodig - (skikking kapasiteit, wat >= n is) * item grootte, maar tot as dit 2n is, is dit steeds O(n)
+
+- ### Linked Lists
+    - [ ] Beskrywing:
+        - [ ] [Singly Linked Lists (video)](https://www.coursera.org/lecture/data-structures/singly-linked-lists-kHhgK)
+        - [ ] [CS 61B - Linked Lists 1 (video)](https://archive.org/details/ucberkeley_webcast_htzJdKoEmO0)
+        - [ ] [CS 61B - Linked Lists 2 (video)](https://archive.org/details/ucberkeley_webcast_-c4I3gFYe3w)
+    - [ ] [C Code (video)](https://www.youtube.com/watch?v=QN6FPiD0Gzo)
+            - nie die hele video nie, net gedeeltes oor Node struct en geheue toekening
\ No newline at end of file

From 3ccfa8ddc01456ca14500dd5d6dc3df97c211d90 Mon Sep 17 00:00:00 2001
From: Anri Lombard <anri.m.lombard@gmail.com>
Date: Sat, 16 Jul 2022 16:58:33 +0200
Subject: [PATCH 064/127] Lines 680/1996

---
 translations/README-af.md | 12 +++++++++++-
 1 file changed, 11 insertions(+), 1 deletion(-)

diff --git a/translations/README-af.md b/translations/README-af.md
index 2cb7ca6..6319e6c 100644
--- a/translations/README-af.md
+++ b/translations/README-af.md
@@ -668,4 +668,14 @@ of jy kan identifiseer wat die runtime kompleksiteit van verskeie algoritmes is.
         - [ ] [CS 61B - Linked Lists 1 (video)](https://archive.org/details/ucberkeley_webcast_htzJdKoEmO0)
         - [ ] [CS 61B - Linked Lists 2 (video)](https://archive.org/details/ucberkeley_webcast_-c4I3gFYe3w)
     - [ ] [C Code (video)](https://www.youtube.com/watch?v=QN6FPiD0Gzo)
-            - nie die hele video nie, net gedeeltes oor Node struct en geheue toekening
\ No newline at end of file
+            - nie die hele video nie, net gedeeltes oor Node struct en geheue toekening
+    - [ ] Linked List vs Skikkings:
+        - [Core Linked Lists Vs Arrays (video)](https://www.coursera.org/lecture/data-structures-optimizing-performance/core-linked-lists-vs-arrays-rjBs9)
+        - [In The Real World Linked Lists Vs Arrays (video)](https://www.coursera.org/lecture/data-structures-optimizing-performance/in-the-real-world-lists-vs-arrays-QUaUd)
+    - [ ] [why you suld avoid linked lists (video)](https://www.youtube.com/watch?v=YQs6IC-vgmo)
+    - [ ] Gotcha: Jy nodig wyser tot wyser kennis:
+        (vir wanneer jy 'n wyser paas na 'n funksie wat die address na waar die wyser wys verander)
+        Die blad is net om 'n houvas te kry op wyser na wyser. Ek beveel nie aan om hierdie lys transversale styl te lees nie. Leesbaarheid en onderhoudbaarheid ly van slimheid.
+        - [Wysers na Wysers](https://www.eskimo.com/~scs/cclass/int/sx8.html)
+    - [ ] Implement (Ek het dit gedoen met stert wyser en sonder):
+        - [ ] size() 
\ No newline at end of file

From 4eec4d8069c5d075a3d49f257168d76fd2593265 Mon Sep 17 00:00:00 2001
From: Anri Lombard <anri.m.lombard@gmail.com>
Date: Sat, 16 Jul 2022 17:09:18 +0200
Subject: [PATCH 065/127] Lines 690/1996

---
 translations/README-af.md | 12 +++++++++++-
 1 file changed, 11 insertions(+), 1 deletion(-)

diff --git a/translations/README-af.md b/translations/README-af.md
index 6319e6c..83f37f1 100644
--- a/translations/README-af.md
+++ b/translations/README-af.md
@@ -678,4 +678,14 @@ of jy kan identifiseer wat die runtime kompleksiteit van verskeie algoritmes is.
         Die blad is net om 'n houvas te kry op wyser na wyser. Ek beveel nie aan om hierdie lys transversale styl te lees nie. Leesbaarheid en onderhoudbaarheid ly van slimheid.
         - [Wysers na Wysers](https://www.eskimo.com/~scs/cclass/int/sx8.html)
     - [ ] Implement (Ek het dit gedoen met stert wyser en sonder):
-        - [ ] size() 
\ No newline at end of file
+        - [ ] size() - lewer hoeveelheid data elemente in lys
+        - [ ] empty() - bool lewer waar as leeg
+        - [ ] value_at(indeks) - lewer die waarde van die nth item (begin by 0 vir eerste)
+        - [ ] push_front(waarde) - voeg 'n item aan die begin van die lys
+        - [ ] pop_front() - verwyder voorste item en lewer die waarde
+        - [ ] push_back(value) - voeg 'n item aan die einde
+        - [ ] pop_back() - verwyder laaste item en lewer die waarde
+        - [ ] front() - kry waarde van voorste item
+        - [ ] back() - kry waarde van laaste item
+        - [ ] insert(indeks, waarde) - voeg waarde by indeks, so huidige item by daardie indeks word gewys na deur nuwe item by daardie indeks
+        - [ ] 
\ No newline at end of file

From c320804004c84dc03dbf0b536c2bb2660fbc4fcc Mon Sep 17 00:00:00 2001
From: Anri Lombard <anri.m.lombard@gmail.com>
Date: Sat, 16 Jul 2022 17:14:51 +0200
Subject: [PATCH 066/127] Lines 700/1996

---
 translations/README-af.md | 16 +++++++++++++++-
 1 file changed, 15 insertions(+), 1 deletion(-)

diff --git a/translations/README-af.md b/translations/README-af.md
index 83f37f1..900cd9b 100644
--- a/translations/README-af.md
+++ b/translations/README-af.md
@@ -688,4 +688,18 @@ of jy kan identifiseer wat die runtime kompleksiteit van verskeie algoritmes is.
         - [ ] front() - kry waarde van voorste item
         - [ ] back() - kry waarde van laaste item
         - [ ] insert(indeks, waarde) - voeg waarde by indeks, so huidige item by daardie indeks word gewys na deur nuwe item by daardie indeks
-        - [ ] 
\ No newline at end of file
+        - [ ] erase(indeks) - verwyder node by gegewe indeks
+        - [ ] value_n_from_end(n) - lewer die waarde van die node by nth posisie van die einde van die lys af
+        - [ ] reverse() - keer die lys om
+        - [ ] remove_value(waarde) - verwyder die eerste item in die lys met dié waarde
+    - [ ] Doubly-linked List
+        - [Deskripsie (video)](https://www.coursera.org/lecture/data-structures/doubly-linked-lists-jpGKD)
+        - Nie nodig om te implimenteer nie
+
+- ### Stapel
+    - [ ] [Stacks (video)](https://www.coursera.org/lecture/data-structures/stacks-UdKzQ)
+    - [ ] Sal nie implementeer nie. Implementering met skikking is maklik
+
+- ### Queue
+    - [ ] [Queue (video)](https://www.coursera.org/lecture/data-structures/queues-EShpq)
+    - [ ] [Circular buffer/FIFO](https://en.wikipedia.org/wiki/Circular_buffer)
\ No newline at end of file

From 9ebb125666850bcc33f770485640f585ce2796ed Mon Sep 17 00:00:00 2001
From: Anri Lombard <anri.m.lombard@gmail.com>
Date: Sat, 16 Jul 2022 17:17:58 +0200
Subject: [PATCH 067/127] Lines 710/1996

---
 translations/README-af.md | 8 +++++++-
 1 file changed, 7 insertions(+), 1 deletion(-)

diff --git a/translations/README-af.md b/translations/README-af.md
index 900cd9b..0685ad9 100644
--- a/translations/README-af.md
+++ b/translations/README-af.md
@@ -702,4 +702,10 @@ of jy kan identifiseer wat die runtime kompleksiteit van verskeie algoritmes is.
 
 - ### Queue
     - [ ] [Queue (video)](https://www.coursera.org/lecture/data-structures/queues-EShpq)
-    - [ ] [Circular buffer/FIFO](https://en.wikipedia.org/wiki/Circular_buffer)
\ No newline at end of file
+    - [ ] [Circular buffer/FIFO](https://en.wikipedia.org/wiki/Circular_buffer)
+    - [ ] Implementeer met linked-list, met stert wyser:
+        - enqueue(waarde) - voeg waarde by posisie by stert
+        - dequeue() - lewer waarde en verwyder die minste onlangse gevoegde element (voorkant)
+        - empty()
+    - [ ] Implementeer met vaste-grootte skikking:
+        - 
\ No newline at end of file

From de8fcc290bedf34b8cffae9ec03677af00faaa4d Mon Sep 17 00:00:00 2001
From: Anri Lombard <anri.m.lombard@gmail.com>
Date: Sat, 16 Jul 2022 17:21:06 +0200
Subject: [PATCH 068/127] Lines 720/1996

---
 translations/README-af.md | 11 ++++++++++-
 1 file changed, 10 insertions(+), 1 deletion(-)

diff --git a/translations/README-af.md b/translations/README-af.md
index 0685ad9..efe44f5 100644
--- a/translations/README-af.md
+++ b/translations/README-af.md
@@ -708,4 +708,13 @@ of jy kan identifiseer wat die runtime kompleksiteit van verskeie algoritmes is.
         - dequeue() - lewer waarde en verwyder die minste onlangse gevoegde element (voorkant)
         - empty()
     - [ ] Implementeer met vaste-grootte skikking:
-        - 
\ No newline at end of file
+        - enqueue(value) - voeg item aan einde van beskikbare
+        - dequeue() - lewer waarde en verwyder minste onlangse gevoegde element
+        - empty()
+        - full()
+    - [ ] Cost:
+        - 'n Slegte implementering met linked list waar jy enqueue by die hoof en dequeue by die stert sal wees O(n)
+        - enqueue: O(1) (amortized, linked list en array [probing])
+        - dequeue: O(1) (linked list en array)
+        - empty: O(1) (linked list en  array)
+

From 91f074295dc208a0f9e6bff56b10cb3a8fcc7717 Mon Sep 17 00:00:00 2001
From: Anri Lombard <anri.m.lombard@gmail.com>
Date: Sat, 16 Jul 2022 17:22:03 +0200
Subject: [PATCH 069/127] Lines 730/1996

---
 translations/README-af.md | 17 +++++++++++++++++
 1 file changed, 17 insertions(+)

diff --git a/translations/README-af.md b/translations/README-af.md
index efe44f5..e2527cd 100644
--- a/translations/README-af.md
+++ b/translations/README-af.md
@@ -718,3 +718,20 @@ of jy kan identifiseer wat die runtime kompleksiteit van verskeie algoritmes is.
         - dequeue: O(1) (linked list en array)
         - empty: O(1) (linked list en  array)
 
+- ### Hash table
+    - [ ] Videos:
+        - [ ] [Hashing with Chaining (video)](https://www.youtube.com/watch?v=0M_kIqhwbFo&list=PLUl4u3cNGP61Oq3tWYp6V_F-5jb5L2iHb&index=8)
+        - [ ] [Table Doubling, Karp-Rabin (video)](https://www.youtube.com/watch?v=BRO7mVIFt08&index=9&list=PLUl4u3cNGP61Oq3tWYp6V_F-5jb5L2iHb)
+        - [ ] [Open Addressing, Cryptographic Hashing (video)](https://www.youtube.com/watch?v=rvdJDijO2Ro&index=10&list=PLUl4u3cNGP61Oq3tWYp6V_F-5jb5L2iHb)
+        - [ ] [PyCon 2010: The Mighty Dictionary (video)](https://www.youtube.com/watch?v=C4Kc8xzcA68)
+        - [ ] [PyCon 2017: The Dictionary Even Mightier (video)](https://www.youtube.com/watch?v=66P5FMkWoVU)
+        - [ ] [(Advanced) Randomization: Universal & Perfect Hashing (video)](https://www.youtube.com/watch?v=z0lJ2k0sl1g&list=PLUl4u3cNGP6317WaSNfmCvGym2ucw3oGp&index=11)
+        - [ ] [(Advanced) Perfect hashing (video)](https://www.youtube.com/watch?v=N0COwN14gt0&list=PL2B4EEwhKD-NbwZ4ezj7gyc_3yNrojKM9&index=4)
+
+    - [ ] Online Courses:
+        - [ ] [Core Hash Tables (video)](https://www.coursera.org/lecture/data-structures-optimizing-performance/core-hash-tables-m7UuP)
+        - [ ] [Data Structures (video)](https://www.coursera.org/learn/data-structures/home/week/4)
+        - [ ] [Phone Book Problem (video)](https://www.coursera.org/lecture/data-structures/phone-book-problem-NYZZP)
+        - [ ] distributed hash tables:
+            - [Instant Uploads And Storage Optimization In Dropbox (video)](https://www.coursera.org/lecture/data-structures/instant-uploads-and-storage-optimization-in-dropbox-DvaIb)
+            - [Distributed Hash Tables (video)](https://www.coursera.org/lecture/data-structures/distributed-hash-tables-tvH8H)
\ No newline at end of file

From a6b666c63015b89b58ac8d26c545fcbe30fdf912 Mon Sep 17 00:00:00 2001
From: Anri Lombard <anri.m.lombard@gmail.com>
Date: Sat, 16 Jul 2022 17:27:32 +0200
Subject: [PATCH 070/127] Lines 740/1996

---
 translations/README-af.md | 11 ++++++++++-
 1 file changed, 10 insertions(+), 1 deletion(-)

diff --git a/translations/README-af.md b/translations/README-af.md
index e2527cd..ea93d49 100644
--- a/translations/README-af.md
+++ b/translations/README-af.md
@@ -714,6 +714,7 @@ of jy kan identifiseer wat die runtime kompleksiteit van verskeie algoritmes is.
         - full()
     - [ ] Cost:
         - 'n Slegte implementering met linked list waar jy enqueue by die hoof en dequeue by die stert sal wees O(n)
+            want you sal die alement langs die laaste nodig hê, wat 'n volle transversal elke dequeue veroorsaak
         - enqueue: O(1) (amortized, linked list en array [probing])
         - dequeue: O(1) (linked list en array)
         - empty: O(1) (linked list en  array)
@@ -734,4 +735,12 @@ of jy kan identifiseer wat die runtime kompleksiteit van verskeie algoritmes is.
         - [ ] [Phone Book Problem (video)](https://www.coursera.org/lecture/data-structures/phone-book-problem-NYZZP)
         - [ ] distributed hash tables:
             - [Instant Uploads And Storage Optimization In Dropbox (video)](https://www.coursera.org/lecture/data-structures/instant-uploads-and-storage-optimization-in-dropbox-DvaIb)
-            - [Distributed Hash Tables (video)](https://www.coursera.org/lecture/data-structures/distributed-hash-tables-tvH8H)
\ No newline at end of file
+            - [Distributed Hash Tables (video)](https://www.coursera.org/lecture/data-structures/distributed-hash-tables-tvH8H)
+
+    - [ ] Implement met 'n skikking en gebruik linear probing
+        - hash(k, m) - m is grootte van hash table
+        - add(sleutel, waarde) - as sleutel al klaar beskikbaar is, opdateer waarde
+        - exists(sleutel)
+        - get(sleutel)
+        - remove(sleutel)
+

From ce3ba031d7eb58fc51c4cf995aba9202a52d91c9 Mon Sep 17 00:00:00 2001
From: Anri Lombard <anri.m.lombard@gmail.com>
Date: Sat, 16 Jul 2022 17:29:37 +0200
Subject: [PATCH 071/127] Lines 750/1996

---
 translations/README-af.md | 10 ++++++++++
 1 file changed, 10 insertions(+)

diff --git a/translations/README-af.md b/translations/README-af.md
index ea93d49..b0c1e4d 100644
--- a/translations/README-af.md
+++ b/translations/README-af.md
@@ -744,3 +744,13 @@ of jy kan identifiseer wat die runtime kompleksiteit van verskeie algoritmes is.
         - get(sleutel)
         - remove(sleutel)
 
+## Meer Kennis
+
+- ### Binary search
+    - [ ] [Binary Search (video)](https://www.youtube.com/watch?v=D5SrAga1pno)
+    - [ ] [Binary Search (video)](https://www.khanacademy.org/computing/computer-science/algorithms/binary-search/a/binary-search)
+    - [ ] [detail](https://www.topcoder.com/thrive/articles/Binary%20Search)
+    - [ ] [blueprint](https://leetcode.com/discuss/general-discussion/786126/python-powerful-ultimate-binary-search-template-solved-many-problems)
+    - [ ] Implement:
+        - binary search (op 'n gesorteerde skikking van heelgetalle)
+        - binary search met recursion
\ No newline at end of file

From 38176c01385bf3aefd1693b9ac0528b742690011 Mon Sep 17 00:00:00 2001
From: Anri Lombard <anri.m.lombard@gmail.com>
Date: Sat, 16 Jul 2022 17:29:55 +0200
Subject: [PATCH 072/127] Lines 760/1996

---
 translations/README-af.md | 5 ++++-
 1 file changed, 4 insertions(+), 1 deletion(-)

diff --git a/translations/README-af.md b/translations/README-af.md
index b0c1e4d..c1f375e 100644
--- a/translations/README-af.md
+++ b/translations/README-af.md
@@ -753,4 +753,7 @@ of jy kan identifiseer wat die runtime kompleksiteit van verskeie algoritmes is.
     - [ ] [blueprint](https://leetcode.com/discuss/general-discussion/786126/python-powerful-ultimate-binary-search-template-solved-many-problems)
     - [ ] Implement:
         - binary search (op 'n gesorteerde skikking van heelgetalle)
-        - binary search met recursion
\ No newline at end of file
+        - binary search met recursion
+
+- ### Bitwise operations
+    - [ ] [Bits cheat sheet](https://github.com/jwasham/coding-interview-university/blob/main/extras/cheat%20sheets/bits-cheat-sheet.pdf) - you should know many of the powers of 2 from (2^1 to 2^16 and 2^32)
\ No newline at end of file

From b1b919bb1610b2d868d2f50f07c1849abd3a42f4 Mon Sep 17 00:00:00 2001
From: Anri Lombard <anri.m.lombard@gmail.com>
Date: Sat, 16 Jul 2022 17:32:19 +0200
Subject: [PATCH 073/127] Lines 770/1996

---
 translations/README-af.md | 13 ++++++++++++-
 1 file changed, 12 insertions(+), 1 deletion(-)

diff --git a/translations/README-af.md b/translations/README-af.md
index c1f375e..9e18358 100644
--- a/translations/README-af.md
+++ b/translations/README-af.md
@@ -756,4 +756,15 @@ of jy kan identifiseer wat die runtime kompleksiteit van verskeie algoritmes is.
         - binary search met recursion
 
 - ### Bitwise operations
-    - [ ] [Bits cheat sheet](https://github.com/jwasham/coding-interview-university/blob/main/extras/cheat%20sheets/bits-cheat-sheet.pdf) - you should know many of the powers of 2 from (2^1 to 2^16 and 2^32)
\ No newline at end of file
+    - [ ] [Bits cheat sheet](https://github.com/jwasham/coding-interview-university/blob/main/extras/cheat%20sheets/bits-cheat-sheet.pdf) - jy moet baie van die bevoegdhede van 2 ken van (2^1 na 2^16 na 2^32)
+    - [ ] Verstaan baie goed hoe om bits te manipuleer met: &, |, ^, ~, >>, <<
+        - [ ] [words](https://en.wikipedia.org/wiki/Word_(computer_architecture))
+        - [ ] Good intro:
+            [Bit Manipulation (video)](https://www.youtube.com/watch?v=7jkIUgLC29I)
+        - [ ] [C Programming Tutorial 2-10: Bitwise Operators (video)](https://www.youtube.com/watch?v=d0AwjSpNXR0)
+        - [ ] [Bit Manipulation](https://en.wikipedia.org/wiki/Bit_manipulation)
+        - [ ] [Bitwise Operation](https://en.wikipedia.org/wiki/Bitwise_operation)
+        - [ ] [Bithacks](https://graphics.stanford.edu/~seander/bithacks.html)
+        - [ ] [The Bit Twiddler](https://bits.stephan-brumme.com/)
+        - [ ] [The Bit Twiddler Interactive](https://bits.stephan-brumme.com/interactive.html)
+        - [ ] [Bit Hacks (video)](https://www.youtube.com/watch?v=ZusiKXcz_ac)
\ No newline at end of file

From f4d0b09a5e660aa3dcd4a1a43bf9a940dd86b7e7 Mon Sep 17 00:00:00 2001
From: Anri Lombard <anri.m.lombard@gmail.com>
Date: Sat, 16 Jul 2022 17:33:43 +0200
Subject: [PATCH 074/127] Lines 780/1996

---
 translations/README-af.md | 14 ++++++++++++--
 1 file changed, 12 insertions(+), 2 deletions(-)

diff --git a/translations/README-af.md b/translations/README-af.md
index 9e18358..6ba3ebb 100644
--- a/translations/README-af.md
+++ b/translations/README-af.md
@@ -759,7 +759,7 @@ of jy kan identifiseer wat die runtime kompleksiteit van verskeie algoritmes is.
     - [ ] [Bits cheat sheet](https://github.com/jwasham/coding-interview-university/blob/main/extras/cheat%20sheets/bits-cheat-sheet.pdf) - jy moet baie van die bevoegdhede van 2 ken van (2^1 na 2^16 na 2^32)
     - [ ] Verstaan baie goed hoe om bits te manipuleer met: &, |, ^, ~, >>, <<
         - [ ] [words](https://en.wikipedia.org/wiki/Word_(computer_architecture))
-        - [ ] Good intro:
+        - [ ] Goeie intro:
             [Bit Manipulation (video)](https://www.youtube.com/watch?v=7jkIUgLC29I)
         - [ ] [C Programming Tutorial 2-10: Bitwise Operators (video)](https://www.youtube.com/watch?v=d0AwjSpNXR0)
         - [ ] [Bit Manipulation](https://en.wikipedia.org/wiki/Bit_manipulation)
@@ -767,4 +767,14 @@ of jy kan identifiseer wat die runtime kompleksiteit van verskeie algoritmes is.
         - [ ] [Bithacks](https://graphics.stanford.edu/~seander/bithacks.html)
         - [ ] [The Bit Twiddler](https://bits.stephan-brumme.com/)
         - [ ] [The Bit Twiddler Interactive](https://bits.stephan-brumme.com/interactive.html)
-        - [ ] [Bit Hacks (video)](https://www.youtube.com/watch?v=ZusiKXcz_ac)
\ No newline at end of file
+        - [ ] [Bit Hacks (video)](https://www.youtube.com/watch?v=ZusiKXcz_ac)
+        - [ ] [Practice Operations](https://pconrad.github.io/old_pconrad_cs16/topics/bitOps/)
+    - [ ] 2 en 1 se kompliment
+        - [Binary: Plusses & Minuses (Why We Use Two's Complement) (video)](https://www.youtube.com/watch?v=lKTsv6iVxV4)
+        - [1s Complement](https://en.wikipedia.org/wiki/Ones%27_complement)
+        - [2s Complement](https://en.wikipedia.org/wiki/Two%27s_complement)
+    - [ ] Tel set bits
+        - [4 ways to count bits in a byte (video)](https://youtu.be/Hzuzo9NJrlc)
+        - [Count Bits](https://graphics.stanford.edu/~seander/bithacks.html#CountBitsSetKernighan)
+        - [How To Count The Number Of Set Bits In a 32 Bit Integer](http://stackoverflow.com/questions/109023/how-to-count-the-number-of-set-bits-in-a-32-bit-integer)
+    - [ ] Ruil waardes:
\ No newline at end of file

From 99162afd1ffdbc0f2eb2071ab36d0ce763ee0a69 Mon Sep 17 00:00:00 2001
From: Anri Lombard <anri.m.lombard@gmail.com>
Date: Sat, 16 Jul 2022 17:47:24 +0200
Subject: [PATCH 075/127] Lines 800/1996

---
 translations/README-af.md | 26 +++++++++++++++++++++++++-
 1 file changed, 25 insertions(+), 1 deletion(-)

diff --git a/translations/README-af.md b/translations/README-af.md
index 6ba3ebb..31b39fb 100644
--- a/translations/README-af.md
+++ b/translations/README-af.md
@@ -777,4 +777,28 @@ of jy kan identifiseer wat die runtime kompleksiteit van verskeie algoritmes is.
         - [4 ways to count bits in a byte (video)](https://youtu.be/Hzuzo9NJrlc)
         - [Count Bits](https://graphics.stanford.edu/~seander/bithacks.html#CountBitsSetKernighan)
         - [How To Count The Number Of Set Bits In a 32 Bit Integer](http://stackoverflow.com/questions/109023/how-to-count-the-number-of-set-bits-in-a-32-bit-integer)
-    - [ ] Ruil waardes:
\ No newline at end of file
+    - [ ] Ruil waardes:
+        - [Swap](https://bits.stephan-brumme.com/swap.html)
+    - [ ] Absolute value:
+        - [Absolute Integer](https://bits.stephan-brumme.com/absInteger.html)
+
+## Bome
+
+- ### Bome - Notas & Agtergrond
+    - [ ] [Series: Trees (video)](https://www.coursera.org/lecture/data-structures/trees-95qda)
+    - basiese boom konstruksie
+    - traversal
+    - manipulasie algoritmes
+    - [ ] [BFS(breadth-first search) and DFS(depth-first search) (video)](https://www.youtube.com/watch?v=uWL6FJhq5fM)
+        - BFS notas:
+           - level order (BFS, met queue)
+           - tyd kompleksiteit: O(n)
+           - spasie kompleksiteit: beste: O(1), slegste: O(n/2)=O(n)
+        - DFS notas:
+            - tyd kompleksiteit: O(n)
+            - spasie kompleksiteit:
+                beste: O(log n) - gemidelde hoogte van boom
+                slegste: O(n)
+            - inorder (DFS: links, self, regs)
+            - postorder (DFS: links, regs, self)
+            - preorder (DFS: self, links, regs)

From fa50a60b0ac049f333184c0e5c3a8cff90e0c70f Mon Sep 17 00:00:00 2001
From: Anri Lombard <anri.m.lombard@gmail.com>
Date: Sun, 17 Jul 2022 20:35:04 +0200
Subject: [PATCH 076/127] Lines 810/1996

---
 translations/README-af.md | 6 ++++++
 1 file changed, 6 insertions(+)

diff --git a/translations/README-af.md b/translations/README-af.md
index 31b39fb..05ede9d 100644
--- a/translations/README-af.md
+++ b/translations/README-af.md
@@ -802,3 +802,9 @@ of jy kan identifiseer wat die runtime kompleksiteit van verskeie algoritmes is.
             - inorder (DFS: links, self, regs)
             - postorder (DFS: links, regs, self)
             - preorder (DFS: self, links, regs)
+
+- ### Binary search trees: BSTs
+    - [ ] [Binary Search Tree Review (video)](https://www.youtube.com/watch?v=x6At0nzX92o&index=1&list=PLA5Lqm4uh9Bbq-E0ZnqTIa8LRaL77ica6)    
+    - [ ] [Introduction (video)](https://www.coursera.org/learn/data-structures/lecture/E7cXP/introduction)
+    - [ ] [MIT (video)](https://www.youtube.com/watch?v=76dhtgZt38A&ab_channel=MITOpenCourseWare)
+    - C/C++:
\ No newline at end of file

From 00956d83515b5abf19d81689c7142eef90a345fd Mon Sep 17 00:00:00 2001
From: Anri Lombard <anri.m.lombard@gmail.com>
Date: Sun, 17 Jul 2022 20:39:29 +0200
Subject: [PATCH 077/127] Lines 820/1996

---
 translations/README-af.md | 16 +++++++++++++---
 1 file changed, 13 insertions(+), 3 deletions(-)

diff --git a/translations/README-af.md b/translations/README-af.md
index 05ede9d..32935d9 100644
--- a/translations/README-af.md
+++ b/translations/README-af.md
@@ -804,7 +804,17 @@ of jy kan identifiseer wat die runtime kompleksiteit van verskeie algoritmes is.
             - preorder (DFS: self, links, regs)
 
 - ### Binary search trees: BSTs
-    - [ ] [Binary Search Tree Review (video)](https://www.youtube.com/watch?v=x6At0nzX92o&index=1&list=PLA5Lqm4uh9Bbq-E0ZnqTIa8LRaL77ica6)    
-    - [ ] [Introduction (video)](https://www.coursera.org/learn/data-structures/lecture/E7cXP/introduction)
+    - [ ] [Binary Search Tree Revisie (video)](https://www.youtube.com/watch?v=x6At0nzX92o&index=1&list=PLA5Lqm4uh9Bbq-E0ZnqTIa8LRaL77ica6)    
+    - [ ] [Inleiding (video)](https://www.coursera.org/learn/data-structures/lecture/E7cXP/introduction)
     - [ ] [MIT (video)](https://www.youtube.com/watch?v=76dhtgZt38A&ab_channel=MITOpenCourseWare)
-    - C/C++:
\ No newline at end of file
+    - C/C++:
+        - [ ] [Binary search tree - Implementering in C/C++ (video)](https://www.youtube.com/watch?v=COZK7NATh4k&list=PL2_aWCzGMAwI3W_JlcBbtYTwiQSsOTa6P&index=28)
+        - [ ] [BST implementation - memory allocation met stapels en hope (video)](https://www.youtube.com/watch?v=hWokyBoo0aI&list=PL2_aWCzGMAwI3W_JlcBbtYTwiQSsOTa6P&index=29)
+        - [ ] [Kry min en max element in 'n binary search tree (video)](https://www.youtube.com/watch?v=Ut90klNN264&index=30&list=PL2_aWCzGMAwI3W_JlcBbtYTwiQSsOTa6P)
+        - [ ] [Kry hooggte van 'n binary tree (video)](https://www.youtube.com/watch?v=_pnqMz5nrRs&list=PL2_aWCzGMAwI3W_JlcBbtYTwiQSsOTa6P&index=31)
+        - [ ] [Binary tree traversal - breadth-first en depth-first strategieë (video)](https://www.youtube.com/watch?v=9RHO6jU--GU&list=PL2_aWCzGMAwI3W_JlcBbtYTwiQSsOTa6P&index=32)
+        - [ ] [Binary tree: Level Order Traversal (video)](https://www.youtube.com/watch?v=86g8jAQug04&index=33&list=PL2_aWCzGMAwI3W_JlcBbtYTwiQSsOTa6P)
+        - [ ] [Binary tree traversal: Preorder, Inorder, Postorder (video)](https://www.youtube.com/watch?v=gm8DUJJhmY4&index=34&list=PL2_aWCzGMAwI3W_JlcBbtYTwiQSsOTa6P)
+        - [ ] [Kyk of 'n binary tree 'b binary search tree is of nie(video)](https://www.youtube.com/watch?v=yEwSGhSsT0U&index=35&list=PL2_aWCzGMAwI3W_JlcBbtYTwiQSsOTa6P)
+        - [ ] [Verwyder 'n node van 'n Binary Search Tree (video)](https://www.youtube.com/watch?v=gcULXE7ViZw&list=PL2_aWCzGMAwI3W_JlcBbtYTwiQSsOTa6P&index=36)
+        - [ ] [Inorder Successor in 'n binary search tree (video)](https://www.youtube.com/watch?v=5cPbNCrdotA&index=37&list=PL2_aWCzGMAwI3W_JlcBbtYTwiQSsOTa6P)
\ No newline at end of file

From 87e4a5b3565bd126f87d04a34ae01b83cdd5c3d3 Mon Sep 17 00:00:00 2001
From: Anri Lombard <anri.m.lombard@gmail.com>
Date: Sun, 17 Jul 2022 20:46:31 +0200
Subject: [PATCH 078/127] Lines 830/1996

---
 translations/README-af.md | 16 +++++++++++++++-
 1 file changed, 15 insertions(+), 1 deletion(-)

diff --git a/translations/README-af.md b/translations/README-af.md
index 32935d9..15d3a4d 100644
--- a/translations/README-af.md
+++ b/translations/README-af.md
@@ -817,4 +817,18 @@ of jy kan identifiseer wat die runtime kompleksiteit van verskeie algoritmes is.
         - [ ] [Binary tree traversal: Preorder, Inorder, Postorder (video)](https://www.youtube.com/watch?v=gm8DUJJhmY4&index=34&list=PL2_aWCzGMAwI3W_JlcBbtYTwiQSsOTa6P)
         - [ ] [Kyk of 'n binary tree 'b binary search tree is of nie(video)](https://www.youtube.com/watch?v=yEwSGhSsT0U&index=35&list=PL2_aWCzGMAwI3W_JlcBbtYTwiQSsOTa6P)
         - [ ] [Verwyder 'n node van 'n Binary Search Tree (video)](https://www.youtube.com/watch?v=gcULXE7ViZw&list=PL2_aWCzGMAwI3W_JlcBbtYTwiQSsOTa6P&index=36)
-        - [ ] [Inorder Successor in 'n binary search tree (video)](https://www.youtube.com/watch?v=5cPbNCrdotA&index=37&list=PL2_aWCzGMAwI3W_JlcBbtYTwiQSsOTa6P)
\ No newline at end of file
+        - [ ] [Inorder Successor in 'n binary search tree (video)](https://www.youtube.com/watch?v=5cPbNCrdotA&index=37&list=PL2_aWCzGMAwI3W_JlcBbtYTwiQSsOTa6P)
+    - [ ] Implement:
+        - [ ] insert   // vog 'n waarde in 'n boom
+        - [ ] get_node_count   // kry hoeveelheid waardes gestoor is
+        - [ ] print_values   // print die waardes in die boom, van min na max
+        - [ ] delete_tree
+        - [ ] is_in_tree   // waar wanneer 'n gegewende waarde in 'n boom is
+        - [ ] get_height   // gee die hooggte in nodes (enkel node se hooggte is 1)
+        - [ ] get_min   // gee die minimum waarde wat gestoor is in die boom
+        - [ ] get_max   // gee die maksimum waarde wat gestoor is in die boom
+        - [ ] is_binary_search_tree
+        - [ ] delete_value
+        - [ ] get_successor   // gee volgende hoogste waarde in die boom na die gegewende waarde, -1 as niks
+
+- ### Heap / Priority Queue / Binary Heap
\ No newline at end of file

From 1b7ff89a303285d50d44b6eb0e6239c5df57ef81 Mon Sep 17 00:00:00 2001
From: Anri Lombard <anri.m.lombard@gmail.com>
Date: Sun, 17 Jul 2022 20:50:43 +0200
Subject: [PATCH 079/127] Lines 850/1996

---
 translations/README-af.md | 42 ++++++++++++++++++++++++++++++++++++++-
 1 file changed, 41 insertions(+), 1 deletion(-)

diff --git a/translations/README-af.md b/translations/README-af.md
index 15d3a4d..b69bb69 100644
--- a/translations/README-af.md
+++ b/translations/README-af.md
@@ -831,4 +831,44 @@ of jy kan identifiseer wat die runtime kompleksiteit van verskeie algoritmes is.
         - [ ] delete_value
         - [ ] get_successor   // gee volgende hoogste waarde in die boom na die gegewende waarde, -1 as niks
 
-- ### Heap / Priority Queue / Binary Heap
\ No newline at end of file
+- ### Heap / Priority Queue / Binary Heap
+    - gevisualiseer as 'n boom, maar is gewoonlik lineêr gestoor (skikking, linked list)
+    - [ ] [Heap](https://en.wikipedia.org/wiki/Heap_(data_structure))
+    - [ ] [Inleiding (video)](https://www.coursera.org/lecture/data-structures/introduction-2OpTs)
+    - [ ] [Naïef implementering (video)](https://www.coursera.org/learn/data-structures/lecture/z3l9N/naive-implementations)
+    - [ ] [Binary Trees (video)](https://www.coursera.org/learn/data-structures/lecture/GRV2q/binary-trees)
+    - [ ] [Tree Height Remark (video)](https://www.coursera.org/learn/data-structures/supplement/S5xxz/tree-height-remark)
+    - [ ] [Basese operasies (video)](https://www.coursera.org/learn/data-structures/lecture/0g1dl/basic-operations)
+    - [ ] [Complete Binary Trees (video)](https://www.coursera.org/learn/data-structures/lecture/gl5Ni/complete-binary-trees)
+    - [ ] [Pseudokode (video)](https://www.coursera.org/learn/data-structures/lecture/HxQo9/pseudocode)
+    - [ ] [Heap Sort - spring na begin (video)](https://youtu.be/odNJmw5TOEE?list=PLFDnELG9dpVxQCxuD-9BSy2E7BWY3t5Sm&t=3291)
+    - [ ] [Heap Sort (video)](https://www.coursera.org/lecture/data-structures/heap-sort-hSzMO)
+    - [ ] [Bou 'n heap (video)](https://www.coursera.org/lecture/data-structures/building-a-heap-dwrOS)
+    - [ ] [MIT: Heaps en Heap Sort (video)](https://www.youtube.com/watch?v=B7hVxCmfPtM&index=4&list=PLUl4u3cNGP61Oq3tWYp6V_F-5jb5L2iHb)
+    - [ ] [CS 61B Lecture 24: Priority Queues (video)](https://archive.org/details/ucberkeley_webcast_yIUFT6AKBGE)
+    - [ ] [Lineêr Tyd BuildHeap (max-heap)](https://www.youtube.com/watch?v=MiyLo8adrWw)
+    - [ ] Implementeer 'n max-heap:
+        - [ ] insert
+        - [ ] sift_up - needed for insert
+        - [ ] get_max - returns the max item, without removing it
+        - [ ] get_size() - return number of elements stored
+        - [ ] is_empty() - returns true if heap contains no elements
+        - [ ] extract_max - returns the max item, removing it
+        - [ ] sift_down - needed for extract_max
+        - [ ] remove(x) - removes item at index x
+        - [ ] heapify - create a heap from an array of elements, needed for heap_sort
+        - [ ] heap_sort() - take an unsorted array and turn it into a sorted array in-place using a max heap or min heap
+
+## Sorting
+
+- [ ] Notes:
+    - Implement sorts & know best case/worst case, average complexity of each:
+        - no bubble sort - it's terrible - O(n^2), except when n <= 16
+    - [ ] Stability in sorting algorithms ("Is Quicksort stable?")
+        - [Sorting Algorithm Stability](https://en.wikipedia.org/wiki/Sorting_algorithm#Stability)
+        - [Stability In Sorting Algorithms](http://stackoverflow.com/questions/1517793/stability-in-sorting-algorithms)
+        - [Stability In Sorting Algorithms](http://www.geeksforgeeks.org/stability-in-sorting-algorithms/)
+        - [Sorting Algorithms - Stability](http://homepages.math.uic.edu/~leon/cs-mcs401-s08/handouts/stability.pdf)
+    - [ ] Which algorithms can be used on linked lists? Which on arrays? Which on both?
+        - I wouldn't recommend sorting a linked list, but merge sort is doable.
+        - [Merge Sort For Linked List](http://www.geeksforgeeks.org/merge-sort-for-linked-list/)
\ No newline at end of file

From cf075a8c81dbe6b9b9a4ab3465e715f8e6798bd0 Mon Sep 17 00:00:00 2001
From: Anri Lombard <anri.m.lombard@gmail.com>
Date: Sun, 17 Jul 2022 20:55:48 +0200
Subject: [PATCH 080/127] Lines 860/1996

---
 translations/README-af.md | 18 +++++++++---------
 1 file changed, 9 insertions(+), 9 deletions(-)

diff --git a/translations/README-af.md b/translations/README-af.md
index b69bb69..2d81edf 100644
--- a/translations/README-af.md
+++ b/translations/README-af.md
@@ -849,15 +849,15 @@ of jy kan identifiseer wat die runtime kompleksiteit van verskeie algoritmes is.
     - [ ] [Lineêr Tyd BuildHeap (max-heap)](https://www.youtube.com/watch?v=MiyLo8adrWw)
     - [ ] Implementeer 'n max-heap:
         - [ ] insert
-        - [ ] sift_up - needed for insert
-        - [ ] get_max - returns the max item, without removing it
-        - [ ] get_size() - return number of elements stored
-        - [ ] is_empty() - returns true if heap contains no elements
-        - [ ] extract_max - returns the max item, removing it
-        - [ ] sift_down - needed for extract_max
-        - [ ] remove(x) - removes item at index x
-        - [ ] heapify - create a heap from an array of elements, needed for heap_sort
-        - [ ] heap_sort() - take an unsorted array and turn it into a sorted array in-place using a max heap or min heap
+        - [ ] sift_up - nodig vir insert
+        - [ ] get_max - gee die max item, sonder om dit te verwyder
+        - [ ] get_size() - gee hoeveelheid elemente gestoor is
+        - [ ] is_empty() - waar as heap geen elemente het nie
+        - [ ] extract_max - gee max item, en verwyder dit
+        - [ ] sift_down - nodig vir extract_max
+        - [ ] remove(x) - verwyder item by indeks x
+        - [ ] heapify - maak 'h heap van 'n skikking elemente, nodig vir heap_sort
+        - [ ] heap_sort() - vat 'n ongesorteerde skikking en verander dit na 'n gesorteerde skikking in-plek met 'n max heap of 'n min heap
 
 ## Sorting
 

From fef66477942975ffdbec6035a5dfc3a020ec521e Mon Sep 17 00:00:00 2001
From: Anri Lombard <anri.m.lombard@gmail.com>
Date: Sun, 17 Jul 2022 21:00:42 +0200
Subject: [PATCH 081/127] Lines 870/1996

---
 translations/README-af.md | 14 +++++++-------
 1 file changed, 7 insertions(+), 7 deletions(-)

diff --git a/translations/README-af.md b/translations/README-af.md
index 2d81edf..8c16eb4 100644
--- a/translations/README-af.md
+++ b/translations/README-af.md
@@ -859,16 +859,16 @@ of jy kan identifiseer wat die runtime kompleksiteit van verskeie algoritmes is.
         - [ ] heapify - maak 'h heap van 'n skikking elemente, nodig vir heap_sort
         - [ ] heap_sort() - vat 'n ongesorteerde skikking en verander dit na 'n gesorteerde skikking in-plek met 'n max heap of 'n min heap
 
-## Sorting
+## Sorteer
 
-- [ ] Notes:
-    - Implement sorts & know best case/worst case, average complexity of each:
-        - no bubble sort - it's terrible - O(n^2), except when n <= 16
-    - [ ] Stability in sorting algorithms ("Is Quicksort stable?")
+- [ ] Notas:
+    - Implementeer soterings & weet wat die beste/slegste gevalle is, gemidelde kompleksiteite van elk:
+        - geen bubble sort - dis verskriklik sleg - O(n^2), behalwe wanneer n <= 16
+    - [ ] Stabiliteit in sorteer algoritmes ("Is Quicksort stabiel?")
         - [Sorting Algorithm Stability](https://en.wikipedia.org/wiki/Sorting_algorithm#Stability)
         - [Stability In Sorting Algorithms](http://stackoverflow.com/questions/1517793/stability-in-sorting-algorithms)
         - [Stability In Sorting Algorithms](http://www.geeksforgeeks.org/stability-in-sorting-algorithms/)
         - [Sorting Algorithms - Stability](http://homepages.math.uic.edu/~leon/cs-mcs401-s08/handouts/stability.pdf)
-    - [ ] Which algorithms can be used on linked lists? Which on arrays? Which on both?
-        - I wouldn't recommend sorting a linked list, but merge sort is doable.
+    - [ ] Watse algoritmes kan op linked lists gebruik word? Watses op arrays? Watses op beide?
+        - I sal nie aan beveel om 'n linked list te sorteer nie, maar merge sort is doenbaar
         - [Merge Sort For Linked List](http://www.geeksforgeeks.org/merge-sort-for-linked-list/)
\ No newline at end of file

From 35bedef2cb8f6ce5a47208bc40b31559ab66f5c0 Mon Sep 17 00:00:00 2001
From: Anri Lombard <anri.m.lombard@gmail.com>
Date: Sun, 17 Jul 2022 21:01:50 +0200
Subject: [PATCH 082/127] Lines 880/1996

---
 translations/README-af.md | 11 ++++++++++-
 1 file changed, 10 insertions(+), 1 deletion(-)

diff --git a/translations/README-af.md b/translations/README-af.md
index 8c16eb4..6edacf2 100644
--- a/translations/README-af.md
+++ b/translations/README-af.md
@@ -871,4 +871,13 @@ of jy kan identifiseer wat die runtime kompleksiteit van verskeie algoritmes is.
         - [Sorting Algorithms - Stability](http://homepages.math.uic.edu/~leon/cs-mcs401-s08/handouts/stability.pdf)
     - [ ] Watse algoritmes kan op linked lists gebruik word? Watses op arrays? Watses op beide?
         - I sal nie aan beveel om 'n linked list te sorteer nie, maar merge sort is doenbaar
-        - [Merge Sort For Linked List](http://www.geeksforgeeks.org/merge-sort-for-linked-list/)
\ No newline at end of file
+        - [Merge Sort For Linked List](http://www.geeksforgeeks.org/merge-sort-for-linked-list/)
+
+- Vir heapsort, sien Heap datastruktuur bo. Heap sort is fantasties, maar nie stabiel
+
+- [ ] [Sedgewick - Mergesort (5 videos)](https://www.coursera.org/learn/algorithms-part1/home/week/3)
+    - [ ] [1. Mergesort](https://www.coursera.org/lecture/algorithms-part1/mergesort-ARWDq)
+    - [ ] [2. Bottom up Mergesort](https://www.coursera.org/learn/algorithms-part1/lecture/PWNEl/bottom-up-mergesort)
+    - [ ] [3. Sorting Complexity](https://www.coursera.org/lecture/algorithms-part1/sorting-complexity-xAltF)
+    - [ ] [4. Comparators](https://www.coursera.org/lecture/algorithms-part1/comparators-9FYhS)
+    - [ ] [5. Stability](https://www.coursera.org/learn/algorithms-part1/lecture/pvvLZ/stability)
\ No newline at end of file

From 97171dececcce09ed5de4975e8dc2b23dd1727f2 Mon Sep 17 00:00:00 2001
From: Anri Lombard <anri.m.lombard@gmail.com>
Date: Sun, 17 Jul 2022 21:02:09 +0200
Subject: [PATCH 083/127] Lines 890/1996

---
 translations/README-af.md | 8 +++++++-
 1 file changed, 7 insertions(+), 1 deletion(-)

diff --git a/translations/README-af.md b/translations/README-af.md
index 6edacf2..6829e31 100644
--- a/translations/README-af.md
+++ b/translations/README-af.md
@@ -880,4 +880,10 @@ of jy kan identifiseer wat die runtime kompleksiteit van verskeie algoritmes is.
     - [ ] [2. Bottom up Mergesort](https://www.coursera.org/learn/algorithms-part1/lecture/PWNEl/bottom-up-mergesort)
     - [ ] [3. Sorting Complexity](https://www.coursera.org/lecture/algorithms-part1/sorting-complexity-xAltF)
     - [ ] [4. Comparators](https://www.coursera.org/lecture/algorithms-part1/comparators-9FYhS)
-    - [ ] [5. Stability](https://www.coursera.org/learn/algorithms-part1/lecture/pvvLZ/stability)
\ No newline at end of file
+    - [ ] [5. Stability](https://www.coursera.org/learn/algorithms-part1/lecture/pvvLZ/stability)
+
+- [ ] [Sedgewick - Quicksort (4 videos)](https://www.coursera.org/learn/algorithms-part1/home/week/3)
+    - [ ] [1. Quicksort](https://www.coursera.org/learn/algorithms-part1/lecture/vjvnC/quicksort)
+    - [ ] [2. Selection](https://www.coursera.org/lecture/algorithms-part1/selection-UQxFT)
+    - [ ] [3. Duplicate Keys](https://www.coursera.org/lecture/algorithms-part1/duplicate-keys-XvjPd)
+    - [ ] [4. System Sorts](https://www.coursera.org/lecture/algorithms-part1/system-sorts-QBNZ7)
\ No newline at end of file

From 5dbeec488f929f305a48a2eea255a96aaeb9d8c5 Mon Sep 17 00:00:00 2001
From: Anri Lombard <anri.m.lombard@gmail.com>
Date: Sun, 17 Jul 2022 21:02:38 +0200
Subject: [PATCH 084/127] Lines 900/1996

---
 translations/README-af.md | 16 +++++++++++++++-
 1 file changed, 15 insertions(+), 1 deletion(-)

diff --git a/translations/README-af.md b/translations/README-af.md
index 6829e31..9302e3a 100644
--- a/translations/README-af.md
+++ b/translations/README-af.md
@@ -886,4 +886,18 @@ of jy kan identifiseer wat die runtime kompleksiteit van verskeie algoritmes is.
     - [ ] [1. Quicksort](https://www.coursera.org/learn/algorithms-part1/lecture/vjvnC/quicksort)
     - [ ] [2. Selection](https://www.coursera.org/lecture/algorithms-part1/selection-UQxFT)
     - [ ] [3. Duplicate Keys](https://www.coursera.org/lecture/algorithms-part1/duplicate-keys-XvjPd)
-    - [ ] [4. System Sorts](https://www.coursera.org/lecture/algorithms-part1/system-sorts-QBNZ7)
\ No newline at end of file
+    - [ ] [4. System Sorts](https://www.coursera.org/lecture/algorithms-part1/system-sorts-QBNZ7)
+
+- [ ] UC Berkeley:
+    - [ ] [CS 61B Lecture 29: Sorting I (video)](https://archive.org/details/ucberkeley_webcast_EiUvYS2DT6I)
+    - [ ] [CS 61B Lecture 30: Sorting II (video)](https://archive.org/details/ucberkeley_webcast_2hTY3t80Qsk)
+    - [ ] [CS 61B Lecture 32: Sorting III (video)](https://archive.org/details/ucberkeley_webcast_Y6LOLpxg6Dc)
+    - [ ] [CS 61B Lecture 33: Sorting V (video)](https://archive.org/details/ucberkeley_webcast_qNMQ4ly43p4)
+
+- [ ] [Bubble Sort (video)](https://www.youtube.com/watch?v=P00xJgWzz2c&index=1&list=PL89B61F78B552C1AB)
+- [ ] [Analyzing Bubble Sort (video)](https://www.youtube.com/watch?v=ni_zk257Nqo&index=7&list=PL89B61F78B552C1AB)
+- [ ] [Insertion Sort, Merge Sort (video)](https://www.youtube.com/watch?v=Kg4bqzAqRBM&index=3&list=PLUl4u3cNGP61Oq3tWYp6V_F-5jb5L2iHb)
+- [ ] [Insertion Sort (video)](https://www.youtube.com/watch?v=c4BRHC7kTaQ&index=2&list=PL89B61F78B552C1AB)
+- [ ] [Merge Sort (video)](https://www.youtube.com/watch?v=GCae1WNvnZM&index=3&list=PL89B61F78B552C1AB)
+- [ ] [Quicksort (video)](https://www.youtube.com/watch?v=y_G9BkAm6B8&index=4&list=PL89B61F78B552C1AB)
+- [ ] [Selection Sort (video)](https://www.youtube.com/watch?v=6nDMgr0-Yyo&index=8&list=PL89B61F78B552C1AB)
\ No newline at end of file

From db0c5a12fb964eed8ad10a8586ecf45061d75423 Mon Sep 17 00:00:00 2001
From: Anri Lombard <anri.m.lombard@gmail.com>
Date: Sun, 17 Jul 2022 21:03:00 +0200
Subject: [PATCH 085/127] Lines 910/1996

---
 translations/README-af.md | 11 ++++++++++-
 1 file changed, 10 insertions(+), 1 deletion(-)

diff --git a/translations/README-af.md b/translations/README-af.md
index 9302e3a..11be1c3 100644
--- a/translations/README-af.md
+++ b/translations/README-af.md
@@ -900,4 +900,13 @@ of jy kan identifiseer wat die runtime kompleksiteit van verskeie algoritmes is.
 - [ ] [Insertion Sort (video)](https://www.youtube.com/watch?v=c4BRHC7kTaQ&index=2&list=PL89B61F78B552C1AB)
 - [ ] [Merge Sort (video)](https://www.youtube.com/watch?v=GCae1WNvnZM&index=3&list=PL89B61F78B552C1AB)
 - [ ] [Quicksort (video)](https://www.youtube.com/watch?v=y_G9BkAm6B8&index=4&list=PL89B61F78B552C1AB)
-- [ ] [Selection Sort (video)](https://www.youtube.com/watch?v=6nDMgr0-Yyo&index=8&list=PL89B61F78B552C1AB)
\ No newline at end of file
+- [ ] [Selection Sort (video)](https://www.youtube.com/watch?v=6nDMgr0-Yyo&index=8&list=PL89B61F78B552C1AB)
+
+- [ ] Merge sort kode:
+    - [ ] [Using output array (C)](http://www.cs.yale.edu/homes/aspnes/classes/223/examples/sorting/mergesort.c)
+    - [ ] [Using output array (Python)](https://github.com/jwasham/practice-python/blob/master/merge_sort/merge_sort.py)
+    - [ ] [In-place (C++)](https://github.com/jwasham/practice-cpp/blob/master/merge_sort/merge_sort.cc)
+- [ ] Quick sort kode:
+    - [ ] [Implementation (C)](http://www.cs.yale.edu/homes/aspnes/classes/223/examples/randomization/quick.c)
+    - [ ] [Implementation (C)](https://github.com/jwasham/practice-c/blob/master/quick_sort/quick_sort.c)
+    - [ ] [Implementation (Python)](https://github.com/jwasham/practice-python/blob/master/quick_sort/quick_sort.py)
\ No newline at end of file

From d83f843462fde7f095dc7c27905415c0435f8340 Mon Sep 17 00:00:00 2001
From: Anri Lombard <anri.m.lombard@gmail.com>
Date: Sun, 17 Jul 2022 21:04:37 +0200
Subject: [PATCH 086/127] Lines 916/1996

---
 translations/README-af.md | 6 +++++-
 1 file changed, 5 insertions(+), 1 deletion(-)

diff --git a/translations/README-af.md b/translations/README-af.md
index 11be1c3..618f91d 100644
--- a/translations/README-af.md
+++ b/translations/README-af.md
@@ -909,4 +909,8 @@ of jy kan identifiseer wat die runtime kompleksiteit van verskeie algoritmes is.
 - [ ] Quick sort kode:
     - [ ] [Implementation (C)](http://www.cs.yale.edu/homes/aspnes/classes/223/examples/randomization/quick.c)
     - [ ] [Implementation (C)](https://github.com/jwasham/practice-c/blob/master/quick_sort/quick_sort.c)
-    - [ ] [Implementation (Python)](https://github.com/jwasham/practice-python/blob/master/quick_sort/quick_sort.py)
\ No newline at end of file
+    - [ ] [Implementation (Python)](https://github.com/jwasham/practice-python/blob/master/quick_sort/quick_sort.py)
+
+- [ ] Implementeer:
+    - [ ] Mergesort: O(n log n) gemiddelde en slegste gevalle
+    - [ ] Quicksort O(n log n) gemiddelde geval
\ No newline at end of file

From 92385f8dd1b7a3dc0aa781d700efb84b15d693d0 Mon Sep 17 00:00:00 2001
From: Anri Lombard <anri.m.lombard@gmail.com>
Date: Sun, 17 Jul 2022 21:13:34 +0200
Subject: [PATCH 087/127] Lines 930/1996

---
 translations/README-af.md | 18 +++++++++++++++++-
 1 file changed, 17 insertions(+), 1 deletion(-)

diff --git a/translations/README-af.md b/translations/README-af.md
index 618f91d..e563bd3 100644
--- a/translations/README-af.md
+++ b/translations/README-af.md
@@ -913,4 +913,20 @@ of jy kan identifiseer wat die runtime kompleksiteit van verskeie algoritmes is.
 
 - [ ] Implementeer:
     - [ ] Mergesort: O(n log n) gemiddelde en slegste gevalle
-    - [ ] Quicksort O(n log n) gemiddelde geval
\ No newline at end of file
+    - [ ] Quicksort O(n log n) gemiddelde geval
+    - Selection sort en insertion sort is albei O(n^2) gemiddeld en slegste gevalle
+    - Vir heapsort, sien Heap datastrukture bo
+
+- [ ] Nie nodig nie, maar ek beveel hulle aan:
+    - [ ] [Sedgewick - Radix Sorts (6 videos)](https://www.coursera.org/learn/algorithms-part2/home/week/3)
+        - [ ] [1. Strings in Java](https://www.coursera.org/learn/algorithms-part2/lecture/vGHvb/strings-in-java)
+        - [ ] [2. Key Indexed Counting](https://www.coursera.org/lecture/algorithms-part2/key-indexed-counting-2pi1Z)
+        - [ ] [3. Least Significant Digit First String Radix Sort](https://www.coursera.org/learn/algorithms-part2/lecture/c1U7L/lsd-radix-sort)
+        - [ ] [4. Most Significant Digit First String Radix Sort](https://www.coursera.org/learn/algorithms-part2/lecture/gFxwG/msd-radix-sort)
+        - [ ] [5. 3 Way Radix Quicksort](https://www.coursera.org/lecture/algorithms-part2/3-way-radix-quicksort-crkd5)
+        - [ ] [6. Suffix Arrays](https://www.coursera.org/learn/algorithms-part2/lecture/TH18W/suffix-arrays)
+    - [ ] [Radix Sort](http://www.cs.yale.edu/homes/aspnes/classes/223/notes.html#radixSort)
+    - [ ] [Radix Sort (video)](https://www.youtube.com/watch?v=xhr26ia4k38)
+    - [ ] [Radix Sort, Counting Sort (linear time given constraints) (video)](https://www.youtube.com/watch?v=Nz1KZXbghj8&index=7&list=PLUl4u3cNGP61Oq3tWYp6V_F-5jb5L2iHb)
+    - [ ] [Randomization: Matrix Multiply, Quicksort, Freivalds' algorithm (video)](https://www.youtube.com/watch?v=cNB2lADK3_s&index=8&list=PLUl4u3cNGP6317WaSNfmCvGym2ucw3oGp)
+    - [ ] [Sorting in Linear Time (video)](https://www.youtube.com/watch?v=pOKy3RZbSws&list=PLUl4u3cNGP61hsJNdULdudlRL493b-XZf&index=14)
\ No newline at end of file

From 7c8e81779d2ceebfeebee628a05e4b3e9b65e249 Mon Sep 17 00:00:00 2001
From: Anri Lombard <anri.m.lombard@gmail.com>
Date: Sun, 17 Jul 2022 22:38:39 +0200
Subject: [PATCH 088/127] Lines 940/1996

---
 translations/README-af.md | 9 ++++++++-
 1 file changed, 8 insertions(+), 1 deletion(-)

diff --git a/translations/README-af.md b/translations/README-af.md
index e563bd3..028ec70 100644
--- a/translations/README-af.md
+++ b/translations/README-af.md
@@ -929,4 +929,11 @@ of jy kan identifiseer wat die runtime kompleksiteit van verskeie algoritmes is.
     - [ ] [Radix Sort (video)](https://www.youtube.com/watch?v=xhr26ia4k38)
     - [ ] [Radix Sort, Counting Sort (linear time given constraints) (video)](https://www.youtube.com/watch?v=Nz1KZXbghj8&index=7&list=PLUl4u3cNGP61Oq3tWYp6V_F-5jb5L2iHb)
     - [ ] [Randomization: Matrix Multiply, Quicksort, Freivalds' algorithm (video)](https://www.youtube.com/watch?v=cNB2lADK3_s&index=8&list=PLUl4u3cNGP6317WaSNfmCvGym2ucw3oGp)
-    - [ ] [Sorting in Linear Time (video)](https://www.youtube.com/watch?v=pOKy3RZbSws&list=PLUl4u3cNGP61hsJNdULdudlRL493b-XZf&index=14)
\ No newline at end of file
+    - [ ] [Sorting in Linear Time (video)](https://www.youtube.com/watch?v=pOKy3RZbSws&list=PLUl4u3cNGP61hsJNdULdudlRL493b-XZf&index=14)
+
+As 'n opsomming, hier is 'n visuele verteenwoordiging van [15 sorting algorithms](https://www.youtube.com/watch?v=kPRA0W1kECg).
+As jy nog detail nodig het op hierdie onderwer, sien "Sorteer" seksie in [Bykomende Detail op Sommige Vakke](#bykomende-detail-op-sommige-vakke)
+
+## Grafieke
+
+Grafieke kan gebruik word om baie problmeme in rekenaar wetenskap te verteenwoordig, so die seksie is lank, soos bome en sortering was.

From 386919780b03018646942ea6c43525e22eee7b36 Mon Sep 17 00:00:00 2001
From: Anri Lombard <anri.m.lombard@gmail.com>
Date: Sun, 17 Jul 2022 22:43:59 +0200
Subject: [PATCH 089/127] Lines 950/1996

---
 translations/README-af.md | 11 +++++++++++
 1 file changed, 11 insertions(+)

diff --git a/translations/README-af.md b/translations/README-af.md
index 028ec70..93ae283 100644
--- a/translations/README-af.md
+++ b/translations/README-af.md
@@ -937,3 +937,14 @@ As jy nog detail nodig het op hierdie onderwer, sien "Sorteer" seksie in [Bykome
 ## Grafieke
 
 Grafieke kan gebruik word om baie problmeme in rekenaar wetenskap te verteenwoordig, so die seksie is lank, soos bome en sortering was.
+
+- Notas:
+    - Daar is 4 basiese maniere om 'n grafiek in geheue te verteenwoordig:
+        - objects and pointers
+        - adjacency matrix
+        - adjacency list
+        - adjacency map
+    - Familiariseer jouself met elke verteenwoordiging en sy voor- en nadele
+    - BFS en DFS - ken hulle computational kompleksiteit, hulle ruilings-waardes, en hoe om hulle te implimenteer in regte kode
+    - Wanner 'n vraag gevra word, kyk vir 'n grafiek-gebaseerde oplossing eerste, dan begeen aan as niks
+

From c08a4932f5cd85943f73dea61327be986b9fb851 Mon Sep 17 00:00:00 2001
From: Anri Lombard <anri.m.lombard@gmail.com>
Date: Sun, 17 Jul 2022 22:44:26 +0200
Subject: [PATCH 090/127] Lines 960/1996

---
 translations/README-af.md | 11 +++++++++++
 1 file changed, 11 insertions(+)

diff --git a/translations/README-af.md b/translations/README-af.md
index 93ae283..96ec7ba 100644
--- a/translations/README-af.md
+++ b/translations/README-af.md
@@ -948,3 +948,14 @@ Grafieke kan gebruik word om baie problmeme in rekenaar wetenskap te verteenwoor
     - BFS en DFS - ken hulle computational kompleksiteit, hulle ruilings-waardes, en hoe om hulle te implimenteer in regte kode
     - Wanner 'n vraag gevra word, kyk vir 'n grafiek-gebaseerde oplossing eerste, dan begeen aan as niks
 
+- [ ] MIT(videos):
+    - [ ] [Breadth-First Search](https://www.youtube.com/watch?v=oFVYVzlvk9c&t=14s&ab_channel=MITOpenCourseWare)
+    - [ ] [Depth-First Search](https://www.youtube.com/watch?v=IBfWDYSffUU&t=32s&ab_channel=MITOpenCourseWare)
+
+- [ ] Skiena Lectures - great intro:
+    - [ ] [CSE373 2020 - Lecture 10 - Graph Data Structures (video)](https://www.youtube.com/watch?v=Sjk0xqWWPCc&list=PLOtl7M3yp-DX6ic0HGT0PUX_wiNmkWkXx&index=10)
+    - [ ] [CSE373 2020 - Lecture 11 - Graph Traversal (video)](https://www.youtube.com/watch?v=ZTwjXj81NVY&list=PLOtl7M3yp-DX6ic0HGT0PUX_wiNmkWkXx&index=11)
+    - [ ] [CSE373 2020 - Lecture 12 - Depth First Search (video)](https://www.youtube.com/watch?v=KyordYB3BOs&list=PLOtl7M3yp-DX6ic0HGT0PUX_wiNmkWkXx&index=12)
+    - [ ] [CSE373 2020 - Lecture 13 - Minimum Spanning Trees (video)](https://www.youtube.com/watch?v=oolm2VnJUKw&list=PLOtl7M3yp-DX6ic0HGT0PUX_wiNmkWkXx&index=13)
+    - [ ] [CSE373 2020 - Lecture 14 - Minimum Spanning Trees (con't) (video)](https://www.youtube.com/watch?v=RktgPx0MarY&list=PLOtl7M3yp-DX6ic0HGT0PUX_wiNmkWkXx&index=14)
+    - [ ] [CSE373 2020 - Lecture 15 - Graph Algorithms (con't 2) (video)](https://www.youtube.com/watch?v=MUe5DXRhyAo&list=PLOtl7M3yp-DX6ic0HGT0PUX_wiNmkWkXx&index=15)
\ No newline at end of file

From 1c11edb19826edc39ea609012814f7537221bd8c Mon Sep 17 00:00:00 2001
From: Anri Lombard <anri.m.lombard@gmail.com>
Date: Sun, 17 Jul 2022 22:45:09 +0200
Subject: [PATCH 091/127] Lines 970/1996

---
 translations/README-af.md | 16 +++++++++++++++-
 1 file changed, 15 insertions(+), 1 deletion(-)

diff --git a/translations/README-af.md b/translations/README-af.md
index 96ec7ba..26d4bc0 100644
--- a/translations/README-af.md
+++ b/translations/README-af.md
@@ -958,4 +958,18 @@ Grafieke kan gebruik word om baie problmeme in rekenaar wetenskap te verteenwoor
     - [ ] [CSE373 2020 - Lecture 12 - Depth First Search (video)](https://www.youtube.com/watch?v=KyordYB3BOs&list=PLOtl7M3yp-DX6ic0HGT0PUX_wiNmkWkXx&index=12)
     - [ ] [CSE373 2020 - Lecture 13 - Minimum Spanning Trees (video)](https://www.youtube.com/watch?v=oolm2VnJUKw&list=PLOtl7M3yp-DX6ic0HGT0PUX_wiNmkWkXx&index=13)
     - [ ] [CSE373 2020 - Lecture 14 - Minimum Spanning Trees (con't) (video)](https://www.youtube.com/watch?v=RktgPx0MarY&list=PLOtl7M3yp-DX6ic0HGT0PUX_wiNmkWkXx&index=14)
-    - [ ] [CSE373 2020 - Lecture 15 - Graph Algorithms (con't 2) (video)](https://www.youtube.com/watch?v=MUe5DXRhyAo&list=PLOtl7M3yp-DX6ic0HGT0PUX_wiNmkWkXx&index=15)
\ No newline at end of file
+    - [ ] [CSE373 2020 - Lecture 15 - Graph Algorithms (con't 2) (video)](https://www.youtube.com/watch?v=MUe5DXRhyAo&list=PLOtl7M3yp-DX6ic0HGT0PUX_wiNmkWkXx&index=15)
+
+- [ ] Graphs (revisie en meer):
+
+    - [ ] [6.006 Single-Source Shortest Paths Problem (video)](https://www.youtube.com/watch?v=Aa2sqUhIn-E&index=15&list=PLUl4u3cNGP61Oq3tWYp6V_F-5jb5L2iHb)
+    - [ ] [6.006 Dijkstra (video)](https://www.youtube.com/watch?v=NSHizBK9JD8&t=1731s&ab_channel=MITOpenCourseWare)
+    - [ ] [6.006 Bellman-Ford (video)](https://www.youtube.com/watch?v=f9cVS_URPc0&ab_channel=MITOpenCourseWare)
+    - [ ] [6.006 Speeding Up Dijkstra (video)](https://www.youtube.com/watch?v=CHvQ3q_gJ7E&list=PLUl4u3cNGP61Oq3tWYp6V_F-5jb5L2iHb&index=18)
+    - [ ] [Aduni: Graph Algorithms I - Topological Sorting, Minimum Spanning Trees, Prim's Algorithm -  Lecture 6 (video)]( https://www.youtube.com/watch?v=i_AQT_XfvD8&index=6&list=PLFDnELG9dpVxQCxuD-9BSy2E7BWY3t5Sm)
+    - [ ] [Aduni: Graph Algorithms II - DFS, BFS, Kruskal's Algorithm, Union Find Data Structure - Lecture 7 (video)]( https://www.youtube.com/watch?v=ufj5_bppBsA&list=PLFDnELG9dpVxQCxuD-9BSy2E7BWY3t5Sm&index=7)
+    - [ ] [Aduni: Graph Algorithms III: Shortest Path - Lecture 8 (video)](https://www.youtube.com/watch?v=DiedsPsMKXc&list=PLFDnELG9dpVxQCxuD-9BSy2E7BWY3t5Sm&index=8)
+    - [ ] [Aduni: Graph Alg. IV: Intro to geometric algorithms - Lecture 9 (video)](https://www.youtube.com/watch?v=XIAQRlNkJAw&list=PLFDnELG9dpVxQCxuD-9BSy2E7BWY3t5Sm&index=9)
+    - [ ] [CS 61B 2014: Weighted graphs (video)](https://archive.org/details/ucberkeley_webcast_zFbq8vOZ_0k)
+    - [ ] [Greedy Algorithms: Minimum Spanning Tree (video)](https://www.youtube.com/watch?v=tKwnms5iRBU&index=16&list=PLUl4u3cNGP6317WaSNfmCvGym2ucw3oGp)
+    - [ ] [Strongly Connected Components Kosaraju's Algorithm Graph Algorithm (video)](https://www.youtube.com/watch?v=RpgcYiky7uw)

From 19a9e59015ecacbdb6062e06236721a12bc9d176 Mon Sep 17 00:00:00 2001
From: Anri Lombard <anri.m.lombard@gmail.com>
Date: Sun, 17 Jul 2022 22:48:32 +0200
Subject: [PATCH 092/127] Lines 990/1996

---
 translations/README-af.md | 19 +++++++++++++++++++
 1 file changed, 19 insertions(+)

diff --git a/translations/README-af.md b/translations/README-af.md
index 26d4bc0..7ef3ff5 100644
--- a/translations/README-af.md
+++ b/translations/README-af.md
@@ -973,3 +973,22 @@ Grafieke kan gebruik word om baie problmeme in rekenaar wetenskap te verteenwoor
     - [ ] [CS 61B 2014: Weighted graphs (video)](https://archive.org/details/ucberkeley_webcast_zFbq8vOZ_0k)
     - [ ] [Greedy Algorithms: Minimum Spanning Tree (video)](https://www.youtube.com/watch?v=tKwnms5iRBU&index=16&list=PLUl4u3cNGP6317WaSNfmCvGym2ucw3oGp)
     - [ ] [Strongly Connected Components Kosaraju's Algorithm Graph Algorithm (video)](https://www.youtube.com/watch?v=RpgcYiky7uw)
+
+- Full Coursera Kursus:
+    - [ ] [Algorithms on Graphs (video)](https://www.coursera.org/learn/algorithms-on-graphs/home/welcome)
+
+- Ek sou implimenteer:
+    - [ ] DFS met adjacency list (recursive)
+    - [ ] DFS met adjacency list (iterative met stack)
+    - [ ] DFS met adjacency matrix (recursive)
+    - [ ] DFS met adjacency matrix (iterative met stack)
+    - [ ] BFS met adjacency list
+    - [ ] BFS met adjacency matrix
+    - [ ] single-source shortest path (Dijkstra)
+    - [ ] minimum spanning tree
+    - DFS-based algorithms (sien Aduni videos bo):
+        - [ ] kyk vir cycle (nodig vir topological sort, aangesien ons wil kyk vir 'n cycle voordat ons begin)
+        - [ ] topological sort
+        - [ ] tel gekoppelde komponente in 'n grafiek
+        - [ ] lys sterk gokoppelde komponente
+        - [ ] kyk vir bipartite graph
\ No newline at end of file

From 8415adc8a22145aa7e89485a571cb0d3d887d83e Mon Sep 17 00:00:00 2001
From: Anri Lombard <anri.m.lombard@gmail.com>
Date: Sun, 17 Jul 2022 22:49:57 +0200
Subject: [PATCH 093/127] Lines 1000/1996

---
 translations/README-af.md | 11 ++++++++++-
 1 file changed, 10 insertions(+), 1 deletion(-)

diff --git a/translations/README-af.md b/translations/README-af.md
index 7ef3ff5..1020f55 100644
--- a/translations/README-af.md
+++ b/translations/README-af.md
@@ -991,4 +991,13 @@ Grafieke kan gebruik word om baie problmeme in rekenaar wetenskap te verteenwoor
         - [ ] topological sort
         - [ ] tel gekoppelde komponente in 'n grafiek
         - [ ] lys sterk gokoppelde komponente
-        - [ ] kyk vir bipartite graph
\ No newline at end of file
+        - [ ] kyk vir bipartite graph
+
+## Nog Meer Kennis
+
+- ### Recursion
+    - [ ] Stanford lesings oor recursion & backtracking:
+        - [ ] [Lecture 8 | Programming Abstractions (video)](https://www.youtube.com/watch?v=gl3emqCuueQ&list=PLFE6E58F856038C69&index=8)
+        - [ ] [Lecture 9 | Programming Abstractions (video)](https://www.youtube.com/watch?v=uFJhEPrbycQ&list=PLFE6E58F856038C69&index=9)
+        - [ ] [Lecture 10 | Programming Abstractions (video)](https://www.youtube.com/watch?v=NdF1QDTRkck&index=10&list=PLFE6E58F856038C69)
+        - [ ] [Lecture 11 | Programming Abstractions (video)](https://www.youtube.com/watch?v=p-gpaIGRCQI&list=PLFE6E58F856038C69&index=11)
\ No newline at end of file

From df104373ef6ab8f2788aafdacc872e2b267afe0a Mon Sep 17 00:00:00 2001
From: Anri Lombard <anri.m.lombard@gmail.com>
Date: Mon, 18 Jul 2022 20:38:38 +0200
Subject: [PATCH 094/127] Links fixed

---
 translations/README-af.md | 8 ++++----
 1 file changed, 4 insertions(+), 4 deletions(-)

diff --git a/translations/README-af.md b/translations/README-af.md
index 1020f55..85224e1 100644
--- a/translations/README-af.md
+++ b/translations/README-af.md
@@ -113,7 +113,7 @@ sagteware ontwikkeling/ingeneur rolle.
 
 ### Die Studie Plan
 
-- [Wat is dit?]()
+- [Wat is dit?](#wat-is-dit)
 - [Hoekom gebruik dit?](#hoekom-gebruik-dit)
 - [Hoe om dit te gebruik](#hoe-om-dit-te-gebruik)
 - [Moenie voel asof jy nie slim genoeg is nie](#moenie-voel-asof-jy-nie-slim-genoeg-is-nie)
@@ -129,7 +129,7 @@ sagteware ontwikkeling/ingeneur rolle.
 
 ## Onderwerpe om te Studeer
 
-- [Kodering Onderhoud Universiteit]()
+- [Kodering Onderhoud Universiteit](#kodering-onderhoud-universiteit)
   - [Wat is dit?](#wat-is-dit)
   - [Inhoudsopgawe](#inhoudsopgawe)
     - [Die Studie Plan](#die-studie-plan)
@@ -188,7 +188,7 @@ sagteware ontwikkeling/ingeneur rolle.
 
 ### Kry die Werk
 
-- [Werk Jou CV By]()
+- [Werk Jou CV By](#werk-jou-cv-by)
 - [Kry 'n Werk](#kry-n-werk)
 - [Onderhoudproses & Algemene Voorbereiding](#onderhoudproses--algemene-voorbereiding)
 - [Dink aan vir wanneer die onderhoud kom](#dink-aan-vir-wanneer-die-onderhoud-kom)
@@ -199,7 +199,7 @@ sagteware ontwikkeling/ingeneur rolle.
 
 ### Opsionele Ekstra Onderwerpe & Hulpbronne
 
-- [Kodering Onderhoud Universiteit]()
+- [Kodering Onderhoud Universiteit](#kodering-onderhoud-universiteit)
   - [Wat is dit?](#wat-is-dit)
   - [Inhoudsopgawe](#inhoudsopgawe)
     - [Die Studie Plan](#die-studie-plan)

From 44c0b88e17b92e5d3715bf95a289da88c4a533f5 Mon Sep 17 00:00:00 2001
From: Anri Lombard <anri.m.lombard@gmail.com>
Date: Mon, 18 Jul 2022 20:41:56 +0200
Subject: [PATCH 095/127] Lines 1011/1996

---
 translations/README-af.md | 10 +++++++++-
 1 file changed, 9 insertions(+), 1 deletion(-)

diff --git a/translations/README-af.md b/translations/README-af.md
index 85224e1..921d705 100644
--- a/translations/README-af.md
+++ b/translations/README-af.md
@@ -1000,4 +1000,12 @@ Grafieke kan gebruik word om baie problmeme in rekenaar wetenskap te verteenwoor
         - [ ] [Lecture 8 | Programming Abstractions (video)](https://www.youtube.com/watch?v=gl3emqCuueQ&list=PLFE6E58F856038C69&index=8)
         - [ ] [Lecture 9 | Programming Abstractions (video)](https://www.youtube.com/watch?v=uFJhEPrbycQ&list=PLFE6E58F856038C69&index=9)
         - [ ] [Lecture 10 | Programming Abstractions (video)](https://www.youtube.com/watch?v=NdF1QDTRkck&index=10&list=PLFE6E58F856038C69)
-        - [ ] [Lecture 11 | Programming Abstractions (video)](https://www.youtube.com/watch?v=p-gpaIGRCQI&list=PLFE6E58F856038C69&index=11)
\ No newline at end of file
+        - [ ] [Lecture 11 | Programming Abstractions (video)](https://www.youtube.com/watch?v=p-gpaIGRCQI&list=PLFE6E58F856038C69&index=11)
+    - Wanneer is dit gepas om te gebruik?
+    - Hoe is sterk recursion beter as nie?
+        - [ ] [What Is Tail Recursion Why Is It So Bad?](https://www.quora.com/What-is-tail-recursion-Why-is-it-so-bad)
+        - [ ] [Tail Recursion (video)](https://www.coursera.org/lecture/programming-languages/tail-recursion-YZic1)
+    - [ ] [5 Simple Steps for Solving Any Recursive Problem(video)](https://youtu.be/ngCos392W4w)
+
+	Backtracking Blueprint: [Java](https://leetcode.com/problems/combination-sum/discuss/16502/A-general-approach-to-backtracking-questions-in-Java-(Subsets-Permutations-Combination-Sum-Palindrome-Partitioning))
+	[Python](https://leetcode.com/problems/combination-sum/discuss/429538/General-Backtracking-questions-solutions-in-Python-for-reference-%3A)
\ No newline at end of file

From c6f379b69ee6d81d4d8f3d75eab210df0e260e8e Mon Sep 17 00:00:00 2001
From: Anri Lombard <anri.m.lombard@gmail.com>
Date: Mon, 18 Jul 2022 20:49:14 +0200
Subject: [PATCH 096/127] Lines 1030/1996

---
 translations/README-af.md | 28 +++++++++++++++++++++++++++-
 1 file changed, 27 insertions(+), 1 deletion(-)

diff --git a/translations/README-af.md b/translations/README-af.md
index 921d705..6d78e08 100644
--- a/translations/README-af.md
+++ b/translations/README-af.md
@@ -1008,4 +1008,30 @@ Grafieke kan gebruik word om baie problmeme in rekenaar wetenskap te verteenwoor
     - [ ] [5 Simple Steps for Solving Any Recursive Problem(video)](https://youtu.be/ngCos392W4w)
 
 	Backtracking Blueprint: [Java](https://leetcode.com/problems/combination-sum/discuss/16502/A-general-approach-to-backtracking-questions-in-Java-(Subsets-Permutations-Combination-Sum-Palindrome-Partitioning))
-	[Python](https://leetcode.com/problems/combination-sum/discuss/429538/General-Backtracking-questions-solutions-in-Python-for-reference-%3A)
\ No newline at end of file
+	[Python](https://leetcode.com/problems/combination-sum/discuss/429538/General-Backtracking-questions-solutions-in-Python-for-reference-%3A)
+- ### Dinamiese Programering
+    - Jy sal heelwaarskynlik geen dinamiese probleme in die onderhoud sien nie, maar dis die moeite werd om 
+    'n probleem te herken as 'n dinamiese programering probleem.
+    - Hierde onderwerp kan redelik moeilik wees, omdat elke DP oplosbare probleem gedefinieer moet word as 'n recursion verhouding, en om daarmee op te kom is moeilik.
+    - Ek beveel aan om na soveel DP probleme te kyk as moontlik tot dat jy 'n goeie begrip van die patroon het.
+    - [ ] Videos:
+        - [ ] [Skiena: CSE373 2020 - Lecture 19 - Introduction to Dynamic Programming (video)](https://www.youtube.com/watch?v=wAA0AMfcJHQ&list=PLOtl7M3yp-DX6ic0HGT0PUX_wiNmkWkXx&index=18)
+        - [ ] [Skiena: CSE373 2020 - Lecture 20 - Edit Distance (video)](https://www.youtube.com/watch?v=T3A4jlHlhtA&list=PLOtl7M3yp-DX6ic0HGT0PUX_wiNmkWkXx&index=19)
+        - [ ] [Skiena: CSE373 2020 - Lecture 20 - Edit Distance (continued) (video)](https://www.youtube.com/watch?v=iPnPVcZmRbE&list=PLOtl7M3yp-DX6ic0HGT0PUX_wiNmkWkXx&index=20)
+        - [ ] [Skiena: CSE373 2020 - Lecture 21 - Dynamic Programming (video)](https://www.youtube.com/watch?v=2xPE4Wq8coQ&list=PLOtl7M3yp-DX6ic0HGT0PUX_wiNmkWkXx&index=21)
+        - [ ] [Skiena: CSE373 2020 - Lecture 21 - Dynamic Programming and Review (video)](https://www.youtube.com/watch?v=2xPE4Wq8coQ&list=PLOtl7M3yp-DX6ic0HGT0PUX_wiNmkWkXx&index=21)
+        - [ ] [Simonson: Dynamic Programming 0 (starts at 59:18) (video)](https://youtu.be/J5aJEcOr6Eo?list=PLFDnELG9dpVxQCxuD-9BSy2E7BWY3t5Sm&t=3558)
+        - [ ] [Simonson: Dynamic Programming I - Lecture 11 (video)](https://www.youtube.com/watch?v=0EzHjQ_SOeU&index=11&list=PLFDnELG9dpVxQCxuD-9BSy2E7BWY3t5Sm)
+        - [ ] [Simonson: Dynamic programming II - Lecture 12 (video)](https://www.youtube.com/watch?v=v1qiRwuJU7g&list=PLFDnELG9dpVxQCxuD-9BSy2E7BWY3t5Sm&index=12)
+        - [ ] List of individual DP problems (each is short):
+            [Dynamic Programming (video)](https://www.youtube.com/playlist?list=PLrmLmBdmIlpsHaNTPP_jHHDx_os9ItYXr)
+    - [ ] Yale Lecture notes:
+        - [ ] [Dynamic Programming](http://www.cs.yale.edu/homes/aspnes/classes/223/notes.html#dynamicProgramming)
+    - [ ] Coursera:
+        - [ ] [The RNA secondary structure problem (video)](https://www.coursera.org/learn/algorithmic-thinking-2/lecture/80RrW/the-rna-secondary-structure-problem)
+        - [ ] [A dynamic programming algorithm (video)](https://www.coursera.org/lecture/algorithmic-thinking-2/a-dynamic-programming-algorithm-PSonq)
+        - [ ] [Illustrating the DP algorithm (video)](https://www.coursera.org/lecture/algorithmic-thinking-2/illustrating-the-dp-algorithm-oUEK2)
+        - [ ] [Running time of the DP algorithm (video)](https://www.coursera.org/learn/algorithmic-thinking-2/lecture/nfK2r/running-time-of-the-dp-algorithm)
+        - [ ] [DP vs. recursive implementation (video)](https://www.coursera.org/learn/algorithmic-thinking-2/lecture/M999a/dp-vs-recursive-implementation)
+        - [ ] [Global pairwise sequence alignment (video)](https://www.coursera.org/lecture/algorithmic-thinking-2/global-pairwise-sequence-alignment-UZ7o6)
+        - [ ] [Local pairwise sequence alignment (video)](https://www.coursera.org/learn/algorithmic-thinking-2/lecture/WnNau/local-pairwise-sequence-alignment)
\ No newline at end of file

From 16b2200f4908d103695cbff2fbcc95066214feb6 Mon Sep 17 00:00:00 2001
From: Anri Lombard <anri.m.lombard@gmail.com>
Date: Mon, 18 Jul 2022 20:50:32 +0200
Subject: [PATCH 097/127] Lines 1060/1996

---
 translations/README-af.md | 25 ++++++++++++++++++++++++-
 1 file changed, 24 insertions(+), 1 deletion(-)

diff --git a/translations/README-af.md b/translations/README-af.md
index 6d78e08..72cb89d 100644
--- a/translations/README-af.md
+++ b/translations/README-af.md
@@ -1034,4 +1034,27 @@ Grafieke kan gebruik word om baie problmeme in rekenaar wetenskap te verteenwoor
         - [ ] [Running time of the DP algorithm (video)](https://www.coursera.org/learn/algorithmic-thinking-2/lecture/nfK2r/running-time-of-the-dp-algorithm)
         - [ ] [DP vs. recursive implementation (video)](https://www.coursera.org/learn/algorithmic-thinking-2/lecture/M999a/dp-vs-recursive-implementation)
         - [ ] [Global pairwise sequence alignment (video)](https://www.coursera.org/lecture/algorithmic-thinking-2/global-pairwise-sequence-alignment-UZ7o6)
-        - [ ] [Local pairwise sequence alignment (video)](https://www.coursera.org/learn/algorithmic-thinking-2/lecture/WnNau/local-pairwise-sequence-alignment)
\ No newline at end of file
+        - [ ] [Local pairwise sequence alignment (video)](https://www.coursera.org/learn/algorithmic-thinking-2/lecture/WnNau/local-pairwise-sequence-alignment)
+
+- ### Ontwerp patrone
+    - [ ] [Quick UML review (video)](https://www.youtube.com/watch?v=3cmzqZzwNDM&list=PLGLfVvz_LVvQ5G-LdJ8RLqe-ndo7QITYc&index=3)
+    - [ ] Leer hierdie patrone:
+        - [ ] strategy
+        - [ ] singleton
+        - [ ] adapter
+        - [ ] prototype
+        - [ ] decorator
+        - [ ] visitor
+        - [ ] factory, abstract factory
+        - [ ] facade
+        - [ ] observer
+        - [ ] proxy
+        - [ ] delegate
+        - [ ] command
+        - [ ] state
+        - [ ] memento
+        - [ ] iterator
+        - [ ] composite
+        - [ ] flyweight
+    - [ ] [Series of videos (27 videos)](https://www.youtube.com/playlist?list=PLF206E906175C7E07)
+    - [ ] [Book: Head First Design Patterns](https://www.amazon.com/Head-First-Design-Patterns-Freeman/dp/0596007124)
\ No newline at end of file

From 0285be248726a4a3817d85341a22564d87ae046c Mon Sep 17 00:00:00 2001
From: Anri Lombard <anri.m.lombard@gmail.com>
Date: Mon, 18 Jul 2022 20:54:00 +0200
Subject: [PATCH 098/127] Lines 1070/1996

---
 translations/README-af.md | 14 +++++++++++++-
 1 file changed, 13 insertions(+), 1 deletion(-)

diff --git a/translations/README-af.md b/translations/README-af.md
index 72cb89d..691c067 100644
--- a/translations/README-af.md
+++ b/translations/README-af.md
@@ -1057,4 +1057,16 @@ Grafieke kan gebruik word om baie problmeme in rekenaar wetenskap te verteenwoor
         - [ ] composite
         - [ ] flyweight
     - [ ] [Series of videos (27 videos)](https://www.youtube.com/playlist?list=PLF206E906175C7E07)
-    - [ ] [Book: Head First Design Patterns](https://www.amazon.com/Head-First-Design-Patterns-Freeman/dp/0596007124)
\ No newline at end of file
+    - [ ] [Book: Head First Design Patterns](https://www.amazon.com/Head-First-Design-Patterns-Freeman/dp/0596007124)
+        - Ek weet die kanonieke boek is "Design Patterns: Elements of Reusable Object-Orientated Software", maar Head First is 'n goeie begin na OO ook.
+    - [Handy reference: 101 Design Patterns & Tips for Developers](https://sourcemaking.com/design-patterns-and-tips)
+
+- ### Kombinatorika (n kies k) & Probability
+    - [ ] [Math Skills: How to find Factorial, Permutation and Combination (Choose) (video)](https://www.youtube.com/watch?v=8RRo6Ti9d0U)
+    - [ ] [Make School: Probability (video)](https://www.youtube.com/watch?v=sZkAAk9Wwa4)
+    - [ ] [Make School: More Probability and Markov Chains (video)](https://www.youtube.com/watch?v=dNaJg-mLobQ)
+    - [ ] Khan Academy:
+        - Kursus uitleg:
+            - [ ] [Basic Theoretical Probability](https://www.khanacademy.org/math/probability/probability-and-combinatorics-topic)
+        - Net die videos - 41 (elkeen is eenvoudig en elkeen is kort):
+            - [ ] [Probability Explained (video)](https://www.youtube.com/watch?v=uzkc-qNVoOk&list=PLC58778F28211FA19)
\ No newline at end of file

From f652b9adb249810ee94c7469e82f09865250ec6c Mon Sep 17 00:00:00 2001
From: Anri Lombard <anri.m.lombard@gmail.com>
Date: Mon, 18 Jul 2022 20:57:35 +0200
Subject: [PATCH 099/127] Lines 1090/1996

---
 translations/README-af.md | 18 +++++++++++++++++-
 1 file changed, 17 insertions(+), 1 deletion(-)

diff --git a/translations/README-af.md b/translations/README-af.md
index 691c067..280be1c 100644
--- a/translations/README-af.md
+++ b/translations/README-af.md
@@ -1069,4 +1069,20 @@ Grafieke kan gebruik word om baie problmeme in rekenaar wetenskap te verteenwoor
         - Kursus uitleg:
             - [ ] [Basic Theoretical Probability](https://www.khanacademy.org/math/probability/probability-and-combinatorics-topic)
         - Net die videos - 41 (elkeen is eenvoudig en elkeen is kort):
-            - [ ] [Probability Explained (video)](https://www.youtube.com/watch?v=uzkc-qNVoOk&list=PLC58778F28211FA19)
\ No newline at end of file
+            - [ ] [Probability Explained (video)](https://www.youtube.com/watch?v=uzkc-qNVoOk&list=PLC58778F28211FA19)
+
+- ### NP, NP-Complete en Approximation Algorithms
+    - Ken die mees beroemde klasse van NP-complete probleme, soos traveling salesman en die knapsack probleem,
+        en wees reg om hulle the herken wanneer 'n onderhoudvoerder jou vir hulle vra in vermomming.
+    - Ken wat NP-complete beteken.
+    - [ ] [Computational Complexity (video)](https://www.youtube.com/watch?v=moPtwq_cVH8&list=PLUl4u3cNGP61Oq3tWYp6V_F-5jb5L2iHb&index=23)
+    - [ ] Simonson:
+        - [ ] [Greedy Algs. II & Intro to NP Completeness (video)](https://youtu.be/qcGnJ47Smlo?list=PLFDnELG9dpVxQCxuD-9BSy2E7BWY3t5Sm&t=2939)
+        - [ ] [NP Completeness II & Reductions (video)](https://www.youtube.com/watch?v=e0tGC6ZQdQE&index=16&list=PLFDnELG9dpVxQCxuD-9BSy2E7BWY3t5Sm)
+        - [ ] [NP Completeness III (Video)](https://www.youtube.com/watch?v=fCX1BGT3wjE&index=17&list=PLFDnELG9dpVxQCxuD-9BSy2E7BWY3t5Sm)
+        - [ ] [NP Completeness IV (video)](https://www.youtube.com/watch?v=NKLDp3Rch3M&list=PLFDnELG9dpVxQCxuD-9BSy2E7BWY3t5Sm&index=18)
+    - [ ] Skiena:
+        - [ ] [CSE373 2020 - Lecture 23 - NP-Completeness (video)](https://www.youtube.com/watch?v=ItHp5laE1VE&list=PLOtl7M3yp-DX6ic0HGT0PUX_wiNmkWkXx&index=23)
+        - [ ] [CSE373 2020 - Lecture 24 - Satisfiability (video)](https://www.youtube.com/watch?v=inaFJeCzGxU&list=PLOtl7M3yp-DX6ic0HGT0PUX_wiNmkWkXx&index=24)
+        - [ ] [CSE373 2020 - Lecture 25 - More NP-Completeness (video)](https://www.youtube.com/watch?v=B-bhKxjZLlc&list=PLOtl7M3yp-DX6ic0HGT0PUX_wiNmkWkXx&index=25)
+        - [ ] [CSE373 2020 - Lecture 26 - NP-Completeness Challenge (video)](https://www.youtube.com/watch?v=_EzetTkG_Cc&list=PLOtl7M3yp-DX6ic0HGT0PUX_wiNmkWkXx&index=26)
\ No newline at end of file

From 66743697b15b9930eb8d02f7cdc4118207f0f81a Mon Sep 17 00:00:00 2001
From: Anri Lombard <anri.m.lombard@gmail.com>
Date: Mon, 18 Jul 2022 20:59:47 +0200
Subject: [PATCH 100/127] Lines 1100/1996

---
 translations/README-af.md | 16 +++++++++++++++-
 1 file changed, 15 insertions(+), 1 deletion(-)

diff --git a/translations/README-af.md b/translations/README-af.md
index 280be1c..c8018cc 100644
--- a/translations/README-af.md
+++ b/translations/README-af.md
@@ -1085,4 +1085,18 @@ Grafieke kan gebruik word om baie problmeme in rekenaar wetenskap te verteenwoor
         - [ ] [CSE373 2020 - Lecture 23 - NP-Completeness (video)](https://www.youtube.com/watch?v=ItHp5laE1VE&list=PLOtl7M3yp-DX6ic0HGT0PUX_wiNmkWkXx&index=23)
         - [ ] [CSE373 2020 - Lecture 24 - Satisfiability (video)](https://www.youtube.com/watch?v=inaFJeCzGxU&list=PLOtl7M3yp-DX6ic0HGT0PUX_wiNmkWkXx&index=24)
         - [ ] [CSE373 2020 - Lecture 25 - More NP-Completeness (video)](https://www.youtube.com/watch?v=B-bhKxjZLlc&list=PLOtl7M3yp-DX6ic0HGT0PUX_wiNmkWkXx&index=25)
-        - [ ] [CSE373 2020 - Lecture 26 - NP-Completeness Challenge (video)](https://www.youtube.com/watch?v=_EzetTkG_Cc&list=PLOtl7M3yp-DX6ic0HGT0PUX_wiNmkWkXx&index=26)
\ No newline at end of file
+        - [ ] [CSE373 2020 - Lecture 26 - NP-Completeness Challenge (video)](https://www.youtube.com/watch?v=_EzetTkG_Cc&list=PLOtl7M3yp-DX6ic0HGT0PUX_wiNmkWkXx&index=26)
+         - [ ] [Complexity: P, NP, NP-completeness, Reductions (video)](https://www.youtube.com/watch?v=eHZifpgyH_4&list=PLUl4u3cNGP6317WaSNfmCvGym2ucw3oGp&index=22)
+    - [ ] [Complexity: Approximation Algorithms (video)](https://www.youtube.com/watch?v=MEz1J9wY2iM&list=PLUl4u3cNGP6317WaSNfmCvGym2ucw3oGp&index=24)
+    - [ ] [Complexity: Fixed-Parameter Algorithms (video)](https://www.youtube.com/watch?v=4q-jmGrmxKs&index=25&list=PLUl4u3cNGP6317WaSNfmCvGym2ucw3oGp)
+    - Peter Norvig bespreek amper-optimale oplossings vir die travaling salesman probleem:
+        - [Jupyter Notebook](http://nbviewer.jupyter.org/url/norvig.com/ipython/TSP.ipynb)
+    - Bladsye 1048 - 1140 in CLRS as jy dit het.
+
+- ### Hoe rekenare 'n program proses
+
+    - [ ] [How CPU executes a program (video)](https://www.youtube.com/watch?v=XM4lGflQFvA)
+    - [ ] [How computers calculate - ALU (video)](https://youtu.be/1I5ZMmrOfnA)
+    - [ ] [Registers and RAM (video)](https://youtu.be/fpnE6UAfbtU)
+    - [ ] [The Central Processing Unit (CPU) (video)](https://youtu.be/FZGugFqdr60)
+    - [ ] [Instructions and Programs (video)](https://youtu.be/zltgXvg6r3k)
\ No newline at end of file

From 7e84eb7f965e9b619f8e2569807c00d86a96079e Mon Sep 17 00:00:00 2001
From: Anri Lombard <anri.m.lombard@gmail.com>
Date: Mon, 18 Jul 2022 21:02:32 +0200
Subject: [PATCH 101/127] Lines 1130/1996

---
 translations/README-af.md | 29 ++++++++++++++++++++++++++++-
 1 file changed, 28 insertions(+), 1 deletion(-)

diff --git a/translations/README-af.md b/translations/README-af.md
index c8018cc..6db6d22 100644
--- a/translations/README-af.md
+++ b/translations/README-af.md
@@ -1099,4 +1099,31 @@ Grafieke kan gebruik word om baie problmeme in rekenaar wetenskap te verteenwoor
     - [ ] [How computers calculate - ALU (video)](https://youtu.be/1I5ZMmrOfnA)
     - [ ] [Registers and RAM (video)](https://youtu.be/fpnE6UAfbtU)
     - [ ] [The Central Processing Unit (CPU) (video)](https://youtu.be/FZGugFqdr60)
-    - [ ] [Instructions and Programs (video)](https://youtu.be/zltgXvg6r3k)
\ No newline at end of file
+    - [ ] [Instructions and Programs (video)](https://youtu.be/zltgXvg6r3k)
+
+- ### Caches
+    - [ ] LRU cache:
+        - [ ] [The Magic of LRU Cache (100 Days of Google Dev) (video)](https://www.youtube.com/watch?v=R5ON3iwx78M)
+        - [ ] [Implementing LRU (video)](https://www.youtube.com/watch?v=bq6N7Ym81iI)
+        - [ ] [LeetCode - 146 LRU Cache (C++) (video)](https://www.youtube.com/watch?v=8-FZRAjR7qU)
+    - [ ] CPU cache:
+        - [ ] [MIT 6.004 L15: The Memory Hierarchy (video)](https://www.youtube.com/watch?v=vjYF_fAZI5E&list=PLrRW1w6CGAcXbMtDFj205vALOGmiRc82-&index=24)
+        - [ ] [MIT 6.004 L16: Cache Issues (video)](https://www.youtube.com/watch?v=ajgC3-pyGlk&index=25&list=PLrRW1w6CGAcXbMtDFj205vALOGmiRc82-)
+
+- ### Prosesse en Threads
+    - [ ] Rekenaar Wetenskap 162 - Operating Systems (25 videos):
+        - vir prosesse en threads sien videos 1-11
+        - [Operating Systems and System Programming (video)](https://archive.org/details/ucberkeley-webcast-PL-XXv-cvA_iBDyz-ba4yDskqMDY6A1w_c)
+    - [What Is The Difference Between A Process And A Thread?](https://www.quora.com/What-is-the-difference-between-a-process-and-a-thread)
+    - Dek:
+        - Prosesse, Threads, Concurrency kwessies
+            - Verskil tussen prosesse en threads
+            - Prosesse
+            - Threads
+            - Locks
+            - Mutexes
+            - Semaphores
+            - Monitors
+            - How they work?
+            - Deadlock
+            - Livelock
\ No newline at end of file

From 16ac1366cbd9b512c25b642a76053bf008725a32 Mon Sep 17 00:00:00 2001
From: Anri Lombard <anri.m.lombard@gmail.com>
Date: Mon, 18 Jul 2022 21:10:09 +0200
Subject: [PATCH 102/127] Lines 1140/1996

---
 translations/README-af.md | 11 ++++++++++-
 1 file changed, 10 insertions(+), 1 deletion(-)

diff --git a/translations/README-af.md b/translations/README-af.md
index 6db6d22..eac1714 100644
--- a/translations/README-af.md
+++ b/translations/README-af.md
@@ -1126,4 +1126,13 @@ Grafieke kan gebruik word om baie problmeme in rekenaar wetenskap te verteenwoor
             - Monitors
             - How they work?
             - Deadlock
-            - Livelock
\ No newline at end of file
+            - Livelock
+        - CPU aktiwiteit, onderbrekings, konteks verandering
+        - Moderne concurrency konstrukte met multicore prosesse
+        - [Paging, segmentation and virtual memory (video)](https://youtu.be/O4nwUqQodAg)
+        - [Interrupts (video)](https://youtu.be/iKlAWIKEyuw)
+        - Prosess hulpbronne benodighede (geheue: kode, statiese stoor, stack, heap, en ook file descriptors, i/o)
+        - Thread hulpbronne benodighede (deel boonstes (minus stack) met ander threads in die selfde proses maar elk het sy eie pc, stack counter, registers, en stack)
+        - Vurk is regtig net 'n kopie op skryf (net-lees) tot dat 'n nuwe proses na die geheue skryf, dan doen dit 'n vol kopie.
+        - Konteks verandering
+            - Koe konteks verandering geïnisieer word deur 'n operating sisteem en onderliggende hardeware?
\ No newline at end of file

From 62292e41ee6602fa134371b54de3f208e144ce27 Mon Sep 17 00:00:00 2001
From: Anri Lombard <anri.m.lombard@gmail.com>
Date: Mon, 18 Jul 2022 21:10:38 +0200
Subject: [PATCH 103/127] Lines 1150/1996

---
 translations/README-af.md | 12 +++++++++++-
 1 file changed, 11 insertions(+), 1 deletion(-)

diff --git a/translations/README-af.md b/translations/README-af.md
index eac1714..39b0400 100644
--- a/translations/README-af.md
+++ b/translations/README-af.md
@@ -1135,4 +1135,14 @@ Grafieke kan gebruik word om baie problmeme in rekenaar wetenskap te verteenwoor
         - Thread hulpbronne benodighede (deel boonstes (minus stack) met ander threads in die selfde proses maar elk het sy eie pc, stack counter, registers, en stack)
         - Vurk is regtig net 'n kopie op skryf (net-lees) tot dat 'n nuwe proses na die geheue skryf, dan doen dit 'n vol kopie.
         - Konteks verandering
-            - Koe konteks verandering geïnisieer word deur 'n operating sisteem en onderliggende hardeware?
\ No newline at end of file
+            - Koe konteks verandering geïnisieer word deur 'n operating sisteem en onderliggende hardeware?
+    - [ ] [threads in C++ (series - 10 videos)](https://www.youtube.com/playlist?list=PL5jc9xFGsL8E12so1wlMS0r0hTQoJL74M)
+    - [ ] [CS 377 Spring '14: Operating Systems from University of Massachusetts](https://www.youtube.com/playlist?list=PLacuG5pysFbDQU8kKxbUh4K5c1iL5_k7k)
+    - [ ] concurrency in Python (videos):
+        - [ ] [Short series on threads](https://www.youtube.com/playlist?list=PL1H1sBF1VAKVMONJWJkmUh6_p8g4F2oy1)
+        - [ ] [Python Threads](https://www.youtube.com/watch?v=Bs7vPNbB9JM)
+        - [ ] [Understanding the Python GIL (2010)](https://www.youtube.com/watch?v=Obt-vMVdM8s)
+            - [reference](http://www.dabeaz.com/GIL)
+        - [ ] [David Beazley - Python Concurrency From the Ground Up: LIVE! - PyCon 2015](https://www.youtube.com/watch?v=MCs5OvhV9S4)
+        - [ ] [Keynote David Beazley - Topics of Interest (Python Asyncio)](https://www.youtube.com/watch?v=ZzfHjytDceU)
+        - [ ] [Mutex in Python](https://www.youtube.com/watch?v=0zaPs8OtyKY)

From 4b931b5067f16195623ae95115055f1e722a094e Mon Sep 17 00:00:00 2001
From: Anri Lombard <anri.m.lombard@gmail.com>
Date: Mon, 18 Jul 2022 21:12:21 +0200
Subject: [PATCH 104/127] Lines 1160/1996

---
 translations/README-af.md | 15 +++++++++++++++
 1 file changed, 15 insertions(+)

diff --git a/translations/README-af.md b/translations/README-af.md
index 39b0400..66a1fe5 100644
--- a/translations/README-af.md
+++ b/translations/README-af.md
@@ -1146,3 +1146,18 @@ Grafieke kan gebruik word om baie problmeme in rekenaar wetenskap te verteenwoor
         - [ ] [David Beazley - Python Concurrency From the Ground Up: LIVE! - PyCon 2015](https://www.youtube.com/watch?v=MCs5OvhV9S4)
         - [ ] [Keynote David Beazley - Topics of Interest (Python Asyncio)](https://www.youtube.com/watch?v=ZzfHjytDceU)
         - [ ] [Mutex in Python](https://www.youtube.com/watch?v=0zaPs8OtyKY)
+
+- ### Toets
+    - Om te dek:
+        - hoe eenheidstoetse werk
+        - wat is mock objects
+        - wat is integrasietoetse
+        - wat is dependency injection
+    - [ ] [Agile Software Testing with James Bach (video)](https://www.youtube.com/watch?v=SAhJf36_u5U)
+    - [ ] [Open Lecture by James Bach on Software Testing (video)](https://www.youtube.com/watch?v=ILkT_HV9DVU)
+    - [ ] [Steve Freeman - Test-Driven Development (that’s not what we meant) (video)](https://vimeo.com/83960706)
+        - [slides](http://gotocon.com/dl/goto-berlin-2013/slides/SteveFreeman_TestDrivenDevelopmentThatsNotWhatWeMeant.pdf)
+    - [ ] Dependency injection:
+        - [ ] [video](https://www.youtube.com/watch?v=IKD2-MAkXyQ)
+        - [ ] [Tao Of Testing](http://jasonpolites.github.io/tao-of-testing/ch3-1.1.html)
+    - [ ] [How to write tests](http://jasonpolites.github.io/tao-of-testing/ch4-1.1.html)
\ No newline at end of file

From 9b0949bc66368c3ee5ee2e613ff630e96b867320 Mon Sep 17 00:00:00 2001
From: Anri Lombard <anri.m.lombard@gmail.com>
Date: Mon, 18 Jul 2022 21:13:15 +0200
Subject: [PATCH 105/127] Lines 1170/1996

---
 translations/README-af.md | 11 ++++++++++-
 1 file changed, 10 insertions(+), 1 deletion(-)

diff --git a/translations/README-af.md b/translations/README-af.md
index 66a1fe5..616017c 100644
--- a/translations/README-af.md
+++ b/translations/README-af.md
@@ -1160,4 +1160,13 @@ Grafieke kan gebruik word om baie problmeme in rekenaar wetenskap te verteenwoor
     - [ ] Dependency injection:
         - [ ] [video](https://www.youtube.com/watch?v=IKD2-MAkXyQ)
         - [ ] [Tao Of Testing](http://jasonpolites.github.io/tao-of-testing/ch3-1.1.html)
-    - [ ] [How to write tests](http://jasonpolites.github.io/tao-of-testing/ch4-1.1.html)
\ No newline at end of file
+    - [ ] [How to write tests](http://jasonpolites.github.io/tao-of-testing/ch4-1.1.html)
+
+- ### String soek & manipulasies
+    - [ ] [Sedgewick - Suffix Arrays (video)](https://www.coursera.org/learn/algorithms-part2/lecture/TH18W/suffix-arrays)
+    - [ ] [Sedgewick - Substring Search (videos)](https://www.coursera.org/learn/algorithms-part2/home/week/4)
+        - [ ] [1. Introduction to Substring Search](https://www.coursera.org/lecture/algorithms-part2/introduction-to-substring-search-n3ZpG)
+        - [ ] [2. Brute-Force Substring Search](https://www.coursera.org/learn/algorithms-part2/lecture/2Kn5i/brute-force-substring-search)
+        - [ ] [3. Knuth-Morris Pratt](https://www.coursera.org/learn/algorithms-part2/lecture/TAtDr/knuth-morris-pratt)
+        - [ ] [4. Boyer-Moore](https://www.coursera.org/learn/algorithms-part2/lecture/CYxOT/boyer-moore)
+        - [ ] [5. Rabin-Karp](https://www.coursera.org/lecture/algorithms-part2/rabin-karp-3KiqT)
\ No newline at end of file

From 98afa2e8141608c0a4f5b79d14a44de18c7bfa48 Mon Sep 17 00:00:00 2001
From: Anri Lombard <anri.m.lombard@gmail.com>
Date: Mon, 18 Jul 2022 21:17:17 +0200
Subject: [PATCH 106/127] Lines 1180/1996

---
 translations/README-af.md | 11 ++++++++++-
 1 file changed, 10 insertions(+), 1 deletion(-)

diff --git a/translations/README-af.md b/translations/README-af.md
index 616017c..6ea9833 100644
--- a/translations/README-af.md
+++ b/translations/README-af.md
@@ -1169,4 +1169,13 @@ Grafieke kan gebruik word om baie problmeme in rekenaar wetenskap te verteenwoor
         - [ ] [2. Brute-Force Substring Search](https://www.coursera.org/learn/algorithms-part2/lecture/2Kn5i/brute-force-substring-search)
         - [ ] [3. Knuth-Morris Pratt](https://www.coursera.org/learn/algorithms-part2/lecture/TAtDr/knuth-morris-pratt)
         - [ ] [4. Boyer-Moore](https://www.coursera.org/learn/algorithms-part2/lecture/CYxOT/boyer-moore)
-        - [ ] [5. Rabin-Karp](https://www.coursera.org/lecture/algorithms-part2/rabin-karp-3KiqT)
\ No newline at end of file
+        - [ ] [5. Rabin-Karp](https://www.coursera.org/lecture/algorithms-part2/rabin-karp-3KiqT)
+    - [ ] [Search pattern in text (video)](https://www.coursera.org/learn/data-structures/lecture/tAfHI/search-pattern-in-text)
+
+    As jy meer detail op hierde onderwerp doek, sien die "String Matching" seksie in [Bykomende Detail op Sommige Vakke](#bykomende-detail-op-sommige-vakke)
+
+- ### Bome
+    - Let daarop dat daar verskillende soorte bome is. Somiges het prefikse, somige nie, en somige gebruik string in stede van bits
+        om die pad te volg
+    - Ek het deur die kode geliees, maar sal nie implimenteer nie
+    
\ No newline at end of file

From 4ac54547bb1a71aaec13106c294c6b4ec5c6e4b1 Mon Sep 17 00:00:00 2001
From: Anri Lombard <anri.m.lombard@gmail.com>
Date: Mon, 18 Jul 2022 21:17:53 +0200
Subject: [PATCH 107/127] Lines 1190/1996

---
 translations/README-af.md | 10 +++++++++-
 1 file changed, 9 insertions(+), 1 deletion(-)

diff --git a/translations/README-af.md b/translations/README-af.md
index 6ea9833..a67a73b 100644
--- a/translations/README-af.md
+++ b/translations/README-af.md
@@ -1178,4 +1178,12 @@ Grafieke kan gebruik word om baie problmeme in rekenaar wetenskap te verteenwoor
     - Let daarop dat daar verskillende soorte bome is. Somiges het prefikse, somige nie, en somige gebruik string in stede van bits
         om die pad te volg
     - Ek het deur die kode geliees, maar sal nie implimenteer nie
-    
\ No newline at end of file
+    - [ ] [Sedgewick - Tries (3 videos)](https://www.coursera.org/learn/algorithms-part2/home/week/4)
+        - [ ] [1. R Way Tries](https://www.coursera.org/learn/algorithms-part2/lecture/CPVdr/r-way-tries)
+        - [ ] [2. Ternary Search Tries](https://www.coursera.org/learn/algorithms-part2/lecture/yQM8K/ternary-search-tries)
+        - [ ] [3. Character Based Operations](https://www.coursera.org/learn/algorithms-part2/lecture/jwNmV/character-based-operations)
+    - [ ] [Notes on Data Structures and Programming Techniques](http://www.cs.yale.edu/homes/aspnes/classes/223/notes.html#Tries)
+    - [ ] Short course videos:
+        - [ ] [Introduction To Tries (video)](https://www.coursera.org/learn/data-structures-optimizing-performance/lecture/08Xyf/core-introduction-to-tries)
+        - [ ] [Performance Of Tries (video)](https://www.coursera.org/learn/data-structures-optimizing-performance/lecture/PvlZW/core-performance-of-tries)
+        - [ ] [Implementing A Trie (video)](https://www.coursera.org/learn/data-structures-optimizing-performance/lecture/DFvd3/core-implementing-a-trie)

From ca620454d3d486eba03455ee20f1a48816488ba8 Mon Sep 17 00:00:00 2001
From: Anri Lombard <anri.m.lombard@gmail.com>
Date: Mon, 18 Jul 2022 21:18:37 +0200
Subject: [PATCH 108/127] Lines 1200/1996

---
 translations/README-af.md | 11 +++++++++++
 1 file changed, 11 insertions(+)

diff --git a/translations/README-af.md b/translations/README-af.md
index a67a73b..e9de4a2 100644
--- a/translations/README-af.md
+++ b/translations/README-af.md
@@ -1187,3 +1187,14 @@ Grafieke kan gebruik word om baie problmeme in rekenaar wetenskap te verteenwoor
         - [ ] [Introduction To Tries (video)](https://www.coursera.org/learn/data-structures-optimizing-performance/lecture/08Xyf/core-introduction-to-tries)
         - [ ] [Performance Of Tries (video)](https://www.coursera.org/learn/data-structures-optimizing-performance/lecture/PvlZW/core-performance-of-tries)
         - [ ] [Implementing A Trie (video)](https://www.coursera.org/learn/data-structures-optimizing-performance/lecture/DFvd3/core-implementing-a-trie)
+    - [ ] [The Trie: A Neglected Data Structure](https://www.toptal.com/java/the-trie-a-neglected-data-structure)
+    - [ ] [TopCoder - Using Tries](https://www.topcoder.com/thrive/articles/Using%20Tries)
+    - [ ] [Stanford Lecture (real world use case) (video)](https://www.youtube.com/watch?v=TJ8SkcUSdbU)
+    - [ ] [MIT, Advanced Data Structures, Strings (can get pretty obscure about halfway through) (video)](https://www.youtube.com/watch?v=NinWEPPrkDQ&index=16&list=PLUl4u3cNGP61hsJNdULdudlRL493b-XZf)
+
+- ### Floating Point Numbers
+    - [ ] simple 8-bit: [Representation of Floating Point Numbers - 1 (video - there is an error in calculations - see video description)](https://www.youtube.com/watch?v=ji3SfClm8TU)
+
+- ### Unicode
+    - [ ] [The Absolute Minimum Every Software Developer Absolutely, Positively Must Know About Unicode and Character Sets]( http://www.joelonsoftware.com/articles/Unicode.html)
+    - [ ] [What Every Programmer Absolutely, Positively Needs To Know About Encodings And Character Sets To Work With Text](http://kunststube.net/encoding/)

From 5a006888f44f91d3ef080647961e1516f65f3342 Mon Sep 17 00:00:00 2001
From: Anri Lombard <anri.m.lombard@gmail.com>
Date: Tue, 19 Jul 2022 18:00:06 +0200
Subject: [PATCH 109/127] Fix contents

---
 README.md                 | 202 +++++++++++++++++--------------------
 translations/README-af.md | 204 +++++++++++++++++---------------------
 2 files changed, 179 insertions(+), 227 deletions(-)

diff --git a/README.md b/README.md
index 747e4af..8098802 100644
--- a/README.md
+++ b/README.md
@@ -129,62 +129,51 @@ software development/engineering roles.
 
 ### Topics of Study
 
-- [Coding Interview University](#coding-interview-university)
-  - [What is it?](#what-is-it)
-  - [Table of Contents](#table-of-contents)
-    - [The Study Plan](#the-study-plan)
-    - [Topics of Study](#topics-of-study)
-    - [Getting the Job](#getting-the-job)
-    - [Optional Extra Topics & Resources](#optional-extra-topics--resources)
-  - [Why use it?](#why-use-it)
-  - [How to use it](#how-to-use-it)
-    - [If you don't want to use git](#if-you-dont-want-to-use-git)
-    - [If you're comfortable with git](#if-youre-comfortable-with-git)
-  - [Don't feel you aren't smart enough](#dont-feel-you-arent-smart-enough)
-  - [A Note About Video Resources](#a-note-about-video-resources)
-  - [Choose a Programming Language](#choose-a-programming-language)
-    - [For this Study Plan](#for-this-study-plan)
-    - [For your Coding Interview](#for-your-coding-interview)
-  - [Books for Data Structures and Algorithms](#books-for-data-structures-and-algorithms)
-    - [C](#c)
-    - [Python](#python)
-    - [Java](#java)
-    - [C++](#c-1)
-  - [Interview Prep Books](#interview-prep-books)
-    - [If you have tons of extra time:](#if-you-have-tons-of-extra-time)
-  - [Don't Make My Mistakes](#dont-make-my-mistakes)
-    - [1. You Won't Remember it All](#1-you-wont-remember-it-all)
-    - [2. Use Flashcards](#2-use-flashcards)
-    - [3. Do Coding Interview Questions While You're Learning](#3-do-coding-interview-questions-while-youre-learning)
-    - [4. Focus](#4-focus)
-  - [What you won't see covered](#what-you-wont-see-covered)
-  - [The Daily Plan](#the-daily-plan)
-  - [Coding Question Practice](#coding-question-practice)
-  - [Coding Problems](#coding-problems)
-  - [Let's Get Started](#lets-get-started)
-  - [Algorithmic complexity / Big-O / Asymptotic analysis](#algorithmic-complexity--big-o--asymptotic-analysis)
-  - [Data Structures](#data-structures)
-  - [More Knowledge](#more-knowledge)
-  - [Trees](#trees)
-  - [Sorting](#sorting)
-  - [Graphs](#graphs)
-  - [Even More Knowledge](#even-more-knowledge)
-  - [Final Review](#final-review)
-  - [Update Your Resume](#update-your-resume)
-  - [Find a Job](#find-a-job)
-  - [Interview Process & General Interview Prep](#interview-process--general-interview-prep)
-  - [Be thinking of for when the interview comes](#be-thinking-of-for-when-the-interview-comes)
-  - [Have questions for the interviewer](#have-questions-for-the-interviewer)
-  - [Once You've Got The Job](#once-youve-got-the-job)
-  - [Additional Books](#additional-books)
-  - [System Design, Scalability, Data Handling](#system-design-scalability-data-handling)
-  - [Additional Learning](#additional-learning)
-  - [Additional Detail on Some Subjects](#additional-detail-on-some-subjects)
-  - [Video Series](#video-series)
-  - [Computer Science Courses](#computer-science-courses)
-  - [Algorithms implementation](#algorithms-implementation)
-  - [Papers](#papers)
-  - [LICENSE](#license)
+- [Algorithmic complexity / Big-O / Asymptotic analysis](#algorithmic-complexity--big-o--asymptotic-analysis)
+- [Data Structures](#data-structures)
+    - [Arrays](#arrays)
+    - [Linked Lists](#linked-lists)
+    - [Stack](#stack)
+    - [Queue](#queue)
+    - [Hash table](#hash-table)
+- [More Knowledge](#more-knowledge)
+    - [Binary search](#binary-search)
+    - [Bitwise operations](#bitwise-operations)
+- [Trees](#trees)
+    - [Trees - Notes & Background](#trees---notes--background)
+    - [Binary search trees: BSTs](#binary-search-trees-bsts)
+    - [Heap / Priority Queue / Binary Heap](#heap--priority-queue--binary-heap)
+    - balanced search trees (general concept, not details)
+    - traversals: preorder, inorder, postorder, BFS, DFS
+- [Sorting](#sorting)
+    - selection
+    - insertion
+    - heapsort
+    - quicksort
+    - merge sort
+- [Graphs](#graphs)
+    - directed
+    - undirected
+    - adjacency matrix
+    - adjacency list
+    - traversals: BFS, DFS
+- [Even More Knowledge](#even-more-knowledge)
+    - [Recursion](#recursion)
+    - [Dynamic Programming](#dynamic-programming)
+    - [Design Patterns](#design-patterns)
+    - [Combinatorics (n choose k) & Probability](#combinatorics-n-choose-k--probability)
+    - [NP, NP-Complete and Approximation Algorithms](#np-np-complete-and-approximation-algorithms)
+    - [How computers process a program](#how-computers-process-a-program)
+    - [Caches](#caches)
+    - [Processes and Threads](#processes-and-threads)
+    - [Testing](#testing)
+    - [String searching & manipulations](#string-searching--manipulations)
+    - [Tries](#tries)
+    - [Floating Point Numbers](#floating-point-numbers)
+    - [Unicode](#unicode)
+    - [Endianness](#endianness)
+    - [Networking](#networking)
+- [Final Review](#final-review)
 
 ### Getting the Job
 
@@ -199,63 +188,50 @@ software development/engineering roles.
 
 ### Optional Extra Topics & Resources
 
-- [Coding Interview University](#coding-interview-university)
-  - [What is it?](#what-is-it)
-  - [Table of Contents](#table-of-contents)
-    - [The Study Plan](#the-study-plan)
-    - [Topics of Study](#topics-of-study)
-    - [Getting the Job](#getting-the-job)
-    - [Optional Extra Topics & Resources](#optional-extra-topics--resources)
-  - [Why use it?](#why-use-it)
-  - [How to use it](#how-to-use-it)
-    - [If you don't want to use git](#if-you-dont-want-to-use-git)
-    - [If you're comfortable with git](#if-youre-comfortable-with-git)
-  - [Don't feel you aren't smart enough](#dont-feel-you-arent-smart-enough)
-  - [A Note About Video Resources](#a-note-about-video-resources)
-  - [Choose a Programming Language](#choose-a-programming-language)
-    - [For this Study Plan](#for-this-study-plan)
-    - [For your Coding Interview](#for-your-coding-interview)
-  - [Books for Data Structures and Algorithms](#books-for-data-structures-and-algorithms)
-    - [C](#c)
-    - [Python](#python)
-    - [Java](#java)
-    - [C++](#c-1)
-  - [Interview Prep Books](#interview-prep-books)
-    - [If you have tons of extra time:](#if-you-have-tons-of-extra-time)
-  - [Don't Make My Mistakes](#dont-make-my-mistakes)
-    - [1. You Won't Remember it All](#1-you-wont-remember-it-all)
-    - [2. Use Flashcards](#2-use-flashcards)
-    - [3. Do Coding Interview Questions While You're Learning](#3-do-coding-interview-questions-while-youre-learning)
-    - [4. Focus](#4-focus)
-  - [What you won't see covered](#what-you-wont-see-covered)
-  - [The Daily Plan](#the-daily-plan)
-  - [Coding Question Practice](#coding-question-practice)
-  - [Coding Problems](#coding-problems)
-  - [Let's Get Started](#lets-get-started)
-  - [Algorithmic complexity / Big-O / Asymptotic analysis](#algorithmic-complexity--big-o--asymptotic-analysis)
-  - [Data Structures](#data-structures)
-  - [More Knowledge](#more-knowledge)
-  - [Trees](#trees)
-  - [Sorting](#sorting)
-  - [Graphs](#graphs)
-  - [Even More Knowledge](#even-more-knowledge)
-  - [Final Review](#final-review)
-  - [Update Your Resume](#update-your-resume)
-  - [Find a Job](#find-a-job)
-  - [Interview Process & General Interview Prep](#interview-process--general-interview-prep)
-  - [Be thinking of for when the interview comes](#be-thinking-of-for-when-the-interview-comes)
-  - [Have questions for the interviewer](#have-questions-for-the-interviewer)
-  - [Once You've Got The Job](#once-youve-got-the-job)
-  - [Additional Books](#additional-books)
-  - [System Design, Scalability, Data Handling](#system-design-scalability-data-handling)
-  - [Additional Learning](#additional-learning)
-  - [Additional Detail on Some Subjects](#additional-detail-on-some-subjects)
-  - [Video Series](#video-series)
-  - [Computer Science Courses](#computer-science-courses)
-  - [Algorithms implementation](#algorithms-implementation)
-  - [Papers](#papers)
-  - [LICENSE](#license)
-
+- [Additional Books](#additional-books)
+- [System Design, Scalability, Data Handling](#system-design-scalability-data-handling) (if you have 4+ years experience)
+- [Additional Learning](#additional-learning)
+    - [Compilers](#compilers)
+    - [Emacs and vi(m)](#emacs-and-vim)
+    - [Unix command line tools](#unix-command-line-tools)
+    - [Information theory](#information-theory-videos)
+    - [Parity & Hamming Code](#parity--hamming-code-videos)
+    - [Entropy](#entropy)
+    - [Cryptography](#cryptography)
+    - [Compression](#compression)
+    - [Computer Security](#computer-security)
+    - [Garbage collection](#garbage-collection)
+    - [Parallel Programming](#parallel-programming)
+    - [Messaging, Serialization, and Queueing Systems](#messaging-serialization-and-queueing-systems)
+    - [A*](#a)
+    - [Fast Fourier Transform](#fast-fourier-transform)
+    - [Bloom Filter](#bloom-filter)
+    - [HyperLogLog](#hyperloglog)
+    - [Locality-Sensitive Hashing](#locality-sensitive-hashing)
+    - [van Emde Boas Trees](#van-emde-boas-trees)
+    - [Augmented Data Structures](#augmented-data-structures)
+    - [Balanced search trees](#balanced-search-trees)
+        - AVL trees
+        - Splay trees
+        - Red/black trees
+        - 2-3 search trees
+        - 2-3-4 Trees (aka 2-4 trees)
+        - N-ary (K-ary, M-ary) trees
+        - B-Trees
+    - [k-D Trees](#k-d-trees)
+    - [Skip lists](#skip-lists)
+    - [Network Flows](#network-flows)
+    - [Disjoint Sets & Union Find](#disjoint-sets--union-find)
+    - [Math for Fast Processing](#math-for-fast-processing)
+    - [Treap](#treap)
+    - [Linear Programming](#linear-programming-videos)
+    - [Geometry, Convex hull](#geometry-convex-hull-videos)
+    - [Discrete math](#discrete-math)
+    - [Machine Learning](#machine-learning)
+- [Additional Detail on Some Subjects](#additional-detail-on-some-subjects)
+- [Video Series](#video-series)
+- [Computer Science Courses](#computer-science-courses)
+- [Papers](#papers)
 ---
 
 ## Why use it?
diff --git a/translations/README-af.md b/translations/README-af.md
index e9de4a2..e2e859e 100644
--- a/translations/README-af.md
+++ b/translations/README-af.md
@@ -129,62 +129,51 @@ sagteware ontwikkeling/ingeneur rolle.
 
 ## Onderwerpe om te Studeer
 
-- [Kodering Onderhoud Universiteit](#kodering-onderhoud-universiteit)
-  - [Wat is dit?](#wat-is-dit)
-  - [Inhoudsopgawe](#inhoudsopgawe)
-    - [Die Studie Plan](#die-studie-plan)
-    - [Onderwerpe om te Studeer](#onderwerpe-om-te-studeer)
-    - [Kry die Werk](#kry-die-werk)
-    - [Opsionele Ekstra Onderwerpe & Hulpbronne](#opsionele-ekstra-onderwerpe--hulpbronne)
-  - [Hoekom gebruik dit?](#hoekom-gebruik-dit)
-  - [Hoe om dit te gebruik?](#hoe-om-dit-te-gebruik)
-    - [As jy nie git wil gebruik nie](#as-jy-nie-git-wil-gebruik-nie)
-    - [As jy gemaklik met git is](#as-jy-gemaklik-met-git-is)
-  - [Moenie voel asof jy nie slim genoeg is nie](#moenie-voel-asof-jy-nie-slim-genoeg-is-nie)
-  - ['n Nota Oor Video Hulpbronne](#n-nota-oor-video-hulpbronne)
-  - [Kies 'n Programmeeringstaal](#kies-n-programmeeringstaal)
-    - [Vir die Studie Plan](#vir-die-studie-plan)
-    - [Vir jou Kodering Onderhoud](#vir-jou-kodering-onderhoud)
-  - [Boeke vir Datastrukture en Algoritmes](#boeke-vir-datastrukture-en-algoritmes)
-    - [C](#c)
-    - [Python](#python)
-    - [Java](#java)
-    - [C++](#c-1)
-  - [Onderhoud Voorbereïngsboeke](#onderhoud-voorbereiding)
-    - [As jy tonne ekstra tyd het](#as-jy-tonne-ekstra-tyd-het)
-  - [Moenie My Foute Maak Nie](#moenie-my-foute-maak-nie)
-    - [1. Jy Sal Nie Alles Onthou Nie](#1-jy-sal-nie-alles-onthou-nie)
-    - [2. Gebruik flitskaarte](#2-gebruik-flitskaarte)
-    - [3. Doen Kodering Onderhoud Vrae Terwyl Jy Leer](#3-doen-kodering-onderhoud-vrae-terwyl-jy-leer)
-    - [4. Fokus](#4-fokus)
-  - [Wat Jy Nie Sal Sien Gedek Word Nie](#wat-jy-nie-sal-sien-gedek-word-nie)
-  - [Die Daaglikse Plan](#die-daaglikse-plan)
-  - [Kodering Vrae Beoefening](#kodering-vrae-beoefening)
-  - [Kodering Probleme](#kodering-probleme)
-  - [Begin Solank](#begin-solank)
-  - [Algoritmiese Kompleksiteit / Big-O / Asimptotiese analise](#algorithmic-complexity--big-o--asymptotic-analysis)
-  - [Datastrukture](#datastrukture)
-  - [Meer Kennis](#meer-kennis)
-  - [Bome](#bome)
-  - [Sorteer](#sorteer)
-  - [Grafieke](#grafieke)
-  - [Nog Meer Kennis](#nog-meer-kennis)
-  - [Finale Resensie](#finale-resensie)
-  - [Werk Jou CV By](#werk-jou-cv-by)
-  - [Kry 'n Werk](#kry-n-werk)
-  - [Onderhoudproses & Algemene Voorbereiding](#onderhoudproses--algemene-voorbereiding)
-  - [Dink aan vir wanneer die onderhoud kom](#dink-aan-vir-wanneer-die-onderhoud-kom)
-  - [Hê vrae vir die onderhoudvoerder](#he-vrae-vir-die-onderhoudvoerder)
-  - [Sodra Jy Die Werk Het](#sodra-jy-die-werk-het)
-  - [Bykomende Boeke](#bykomende-boeke)
-  - [Stelsel Onderwerp, Skaalbaarheid, Data Hantering](#stelsel-onderwerp-skaalbaarheid-data-hantering)
-  - [Bykomende Leer](#bykomende-leer)
-  - [Bykomende Detail op Sommige Vakke](#bykomende-detail-op-sommige-vakke)
-  - [Video Reeks](#video-reeks)
-  - [Rekenaar Wetenshap Kursusse](#rekenaar-wetenshap-kursusse)
-  - [Algoritmes implementering](#algoritmes-implementering)
-  - [Papiere](#papiere)
-  - [LISENSIE](#lisensie)
+- [Algoritmiese Kompleksiteit / Big-O / Asimptotiese analise](#algorithmic-complexity--big-o--asymptotic-analysis)
+- [Datastrukture](#datastrukture)
+    - [Skikkings](#skikkings)
+    - [Linked Lists](#linked-lists)
+    - [Stack](#stack)
+    - [Queue](#queue)
+    - [Hash table](#hash-table)
+- [Meer Kennis](#meer-kennis)
+    - [Binary search](#binary-search)
+    - [Bitwise operations](#bitwise-operations)
+- [Bome](#bome)
+    - [Bome - Notas & Agtergrond](#bome---notas--agtergrond)
+    - [Binary search trees: BSTs](#binary-search-trees-bsts)
+    - [Heap / Priority Queue / Binary Heap](#heap--priority-queue--binary-heap)
+    - balanced search trees (general concept, not details)
+    - traversals: preorder, inorder, postorder, BFS, DFS
+- [Sorting](#sorting)
+    - selection
+    - insertion
+    - heapsort
+    - quicksort
+    - merge sort
+- [Grafieke](#grafieke)
+    - directed
+    - undirected
+    - adjacency matrix
+    - adjacency list
+    - traversals: BFS, DFS
+- [Nog Meer Kennis](#nog-meer-kennis)
+    - [Recursion](#recursion)
+    - [Dinamiese Programering](#dinamiese-programering)
+    - [Ontwerp Patrone](#ontwerp-patrone)
+    - [Combinatorics (n choose k) & Probability](#combinatorics-n-choose-k--probability)
+    - [NP, NP-Complete en Approximation Algorithms](#np-np-complete-en-approximation-algorithms)
+    - [Hoe rekenare 'n program proseseer](#hoe-rekenare-n-program-proseseer)
+    - [Caches](#caches)
+    - [Prosesse en Threads](#prosesse-en-threads)
+    - [Toets](#toets)
+    - [String searching & manipulations](#string-searching--manipulations)
+    - [Bome](#bome)
+    - [Floating Point Numbers](#floating-point-numbers)
+    - [Unicode](#unicode)
+    - [Endianness](#endianness)
+    - [Networking](#networking)
+- [Finale revisie](#finale-revisie)
 
 ### Kry die Werk
 
@@ -199,63 +188,50 @@ sagteware ontwikkeling/ingeneur rolle.
 
 ### Opsionele Ekstra Onderwerpe & Hulpbronne
 
-- [Kodering Onderhoud Universiteit](#kodering-onderhoud-universiteit)
-  - [Wat is dit?](#wat-is-dit)
-  - [Inhoudsopgawe](#inhoudsopgawe)
-    - [Die Studie Plan](#die-studie-plan)
-    - [Onderwerpe om te Studeer](#onderwerpe-om-te-studeer)
-    - [Kry die Werk](#kry-die-werk)
-    - [Opsionele Ekstra Onderwerpe & Hulpbronne](#opsionele-ekstra-onderwerpe--hulpbronne)
-  - [Hoekom gebruik dit?](#hoekom-gebruik-dit)
-  - [Hoe om dit te gebruik?](#hoe-om-dit-te-gebruik)
-    - [As jy nie git wil gebruik nie](#as-jy-nie-git-wil-gebruik-nie)
-    - [As jy gemaklik met git is](#as-jy-gemaklik-met-git-is)
-  - [Moenie voel asof jy nie slim genoeg is nie](#moenie-voel-asof-jy-nie-slim-genoeg-is-nie)
-  - ['n Nota Oor Video Hulpbronne](#n-nota-oor-video-hulpbronne)
-  - [Kies 'n Programmeeringstaal](#kies-n-programmeeringstaal)
-    - [Vir die Studie Plan](#vir-die-studie-plan)
-    - [Vir jou Kodering Onderhoud](#vir-jou-kodering-onderhoud)
-  - [Boeke vir Datastrukture en Algoritmes](#boeke-vir-datastrukture-en-algoritmes)
-    - [C](#c)
-    - [Python](#python)
-    - [Java](#java)
-    - [C++](#c-1)
-  - [Onderhoud Voorbereïngsboeke](#onderhoud-voorbereiding)
-    - [As jy tonne ekstra tyd het](#as-jy-tonne-ekstra-tyd-het)
-  - [Moenie My Foute Maak Nie](#moenie-my-foute-maak-nie)
-    - [1. Jy Sal Nie Alles Onthou Nie](#1-jy-sal-nie-alles-onthou-nie)
-    - [2. Gebruik flitskaarte](#2-gebruik-flitskaarte)
-    - [3. Doen Kodering Onderhoud Vrae Terwyl Jy Leer](#3-doen-kodering-onderhoud-vrae-terwyl-jy-leer)
-    - [4. Fokus](#4-fokus)
-  - [Wat Jy Nie Sal Sien Gedek Word Nie](#wat-jy-nie-sal-sien-gedek-word-nie)
-  - [Die Daaglikse Plan](#die-daaglikse-plan)
-  - [Kodering Vrae Beoefening](#kodering-vrae-beoefening)
-  - [Kodering Probleme](#kodering-probleme)
-  - [Begin Solank](#begin-solank)
-  - [Algoritmiese Kompleksiteit / Big-O / Asimptotiese analise](#algoritmiese-kompleksiteti--big-o--asimptotiese-analise)
-  - [Datastrukture](#datastrukture)
-  - [Meer Kennis](#meer-kennis)
-  - [Bome](#bome)
-  - [Sorteer](#sorteer)
-  - [Grafieke](#grafieke)
-  - [Nog Meer Kennis](#nog-meer-kennis)
-  - [Finale Resensie](#finale-resensie)
-  - [Werk Jou CV By](#werk-jou-cv-by)
-  - [Kry 'n Werk](#kry-n-werk)
-  - [Onderhoudproses & Algemene Voorbereiding](#onderhoudproses--algemene-voorbereiding)
-  - [Dink aan vir wanneer die onderhoud kom](#dink-aan-vir-wanneer-die-onderhoud-kom)
-  - [Hê vrae vir die onderhoudvoerder](#he-vrae-vir-die-onderhoudvoerder)
-  - [Sodra Jy Die Werk Het](#sodra-jy-die-werk-het)
-  - [Bykomende Boeke](#bykomende-boeke)
-  - [Stelsel Onderwerp, Skaalbaarheid, Data Hantering](#stelsel-onderwerp-skaalbaarheid-data-hantering)
-  - [Bykomende Leer](#bykomende-leer)
-  - [Bykomende Detail op Sommige Vakke](#bykomende-detail-op-sommige-vakke)
-  - [Video Reeks](#video-reeks)
-  - [Rekenaar Wetenshap Kursusse](#rekenaar-wetenshap-kursusse)
-  - [Algoritmes implementering](#algoritmes-implementering)
-  - [Papiere](#papiere)
-  - [LISENSIE](#lisensie)
-
+- [Bykomende Boeke](#bykomende-boeke)
+- [System Design, Scalability, Data Handling](#system-design-scalability-data-handling) (as jy 4+ jaar ondervinding het)
+- [Bykomende Leer](#bykomende-leer)
+    - [Compilers](#compilers)
+    - [Emacs en vi(m)](#emacs-en-vim)
+    - [Unix command line tools](#unix-command-line-tools)
+    - [Inligtingsteorie](#inligtingsteorie-videos)
+    - [Parity & Hamming Kode](#parity--hamming-kode-videos)
+    - [Entropy](#entropy)
+    - [Cryptography](#cryptography)
+    - [Compression](#compression)
+    - [Rekenaar sekuriteit](#rekenaar-sekuriteit)
+    - [Garbage collection](#garbage-collection)
+    - [Parallel Programming](#parallel-programming)
+    - [Messaging, Serialization, en Queueing Systems](#messaging-serialization-en-queueing-systems)
+    - [A*](#a)
+    - [Vinnige Fourier Transform](#vinnige-fourier-transform)
+    - [Bloom Filter](#bloom-filter)
+    - [HyperLogLog](#hyperloglog)
+    - [Locality-Sensitive Hashing](#locality-sensitive-hashing)
+    - [van Emde Boas Trees](#van-emde-boas-trees)
+    - [Augmented Data Structures](#augmented-data-structures)
+    - [Balanced search trees](#balanced-search-trees)
+        - AVL trees
+        - Splay trees
+        - Red/black trees
+        - 2-3 search trees
+        - 2-3-4 Trees (aka 2-4 trees)
+        - N-ary (K-ary, M-ary) trees
+        - B-Trees
+    - [k-D Bome](#k-d-bome)
+    - [Skip lists](#skip-lists)
+    - [Network Flows](#network-flows)
+    - [Disjoint Sets & Union Find](#disjoint-sets--union-find)
+    - [Wiskunde vir Vinnige Verwerking](#wiskunde-vir-vinnige-verwerking)
+    - [Treap](#treap)
+    - [Lineêre Programering](#lineêre-programering-videos)
+    - [Geometry, Convex hull](#geometry-convex-hull-videos)
+    - [Diskrete wiskunde](#diskrete-wiskunde)
+    - [Masjienleer](#masjienleer)
+- [Bykomende Detail op Sommige Vakke](#bykomende-detail-op-sommige-vakke)
+- [Video Reeks](#video-reeks)
+- [Rekenaar Wetenshap Kursusse](#rekenaar-wetenshap-kursusse)
+- [Papiere](#papiere)
 ---
 
 ## Hoekom gebruik dit?
@@ -1093,7 +1069,7 @@ Grafieke kan gebruik word om baie problmeme in rekenaar wetenskap te verteenwoor
         - [Jupyter Notebook](http://nbviewer.jupyter.org/url/norvig.com/ipython/TSP.ipynb)
     - Bladsye 1048 - 1140 in CLRS as jy dit het.
 
-- ### Hoe rekenare 'n program proses
+- ### Hoe rekenare 'n program proseseer
 
     - [ ] [How CPU executes a program (video)](https://www.youtube.com/watch?v=XM4lGflQFvA)
     - [ ] [How computers calculate - ALU (video)](https://youtu.be/1I5ZMmrOfnA)

From fdfe8bcd94428affbca62f624568d0e19fc73343 Mon Sep 17 00:00:00 2001
From: Anri Lombard <anri.m.lombard@gmail.com>
Date: Tue, 19 Jul 2022 18:02:00 +0200
Subject: [PATCH 110/127] Add afrikaans

---
 translations/README-af.md | 1 +
 1 file changed, 1 insertion(+)

diff --git a/translations/README-af.md b/translations/README-af.md
index e2e859e..3a8dd27 100644
--- a/translations/README-af.md
+++ b/translations/README-af.md
@@ -50,6 +50,7 @@
 - [Greek](https://github.com/jwasham/coding-interview-university/issues/166)
 - [Malayalam](https://github.com/jwasham/coding-interview-university/issues/239)
 - [Persian - Farsi](https://github.com/jwasham/coding-interview-university/issues/186)
+- [Afrikaans](https://github.com/jwasham/coding-interview-university/issues/1164)
 
 </details>
 

From a16355ffd1c5faa74d5e95677a471c40a842b2aa Mon Sep 17 00:00:00 2001
From: Anri Lombard <anri.m.lombard@gmail.com>
Date: Tue, 19 Jul 2022 18:04:19 +0200
Subject: [PATCH 111/127] Whitespace fix

---
 README.md                 | 2 ++
 translations/README-af.md | 1 +
 2 files changed, 3 insertions(+)

diff --git a/README.md b/README.md
index 8098802..2f6622e 100644
--- a/README.md
+++ b/README.md
@@ -50,6 +50,7 @@
 - [Greek](https://github.com/jwasham/coding-interview-university/issues/166)
 - [Malayalam](https://github.com/jwasham/coding-interview-university/issues/239)
 - [Persian - Farsi](https://github.com/jwasham/coding-interview-university/issues/186)
+- [Afrikaans](https://github.com/jwasham/coding-interview-university/issues/1164)
 
 </details>
 
@@ -232,6 +233,7 @@ software development/engineering roles.
 - [Video Series](#video-series)
 - [Computer Science Courses](#computer-science-courses)
 - [Papers](#papers)
+
 ---
 
 ## Why use it?
diff --git a/translations/README-af.md b/translations/README-af.md
index 3a8dd27..fcf6315 100644
--- a/translations/README-af.md
+++ b/translations/README-af.md
@@ -233,6 +233,7 @@ sagteware ontwikkeling/ingeneur rolle.
 - [Video Reeks](#video-reeks)
 - [Rekenaar Wetenshap Kursusse](#rekenaar-wetenshap-kursusse)
 - [Papiere](#papiere)
+
 ---
 
 ## Hoekom gebruik dit?

From 7ed2cc8726ee357eb8685fdf03a498ccf1871b88 Mon Sep 17 00:00:00 2001
From: Anri Lombard <anri.m.lombard@gmail.com>
Date: Tue, 19 Jul 2022 20:26:21 +0200
Subject: [PATCH 112/127] Lines 1200/1996

---
 translations/README-af.md | 26 ++++++++++++++++++++++++++
 1 file changed, 26 insertions(+)

diff --git a/translations/README-af.md b/translations/README-af.md
index fcf6315..cc1c7bd 100644
--- a/translations/README-af.md
+++ b/translations/README-af.md
@@ -1176,3 +1176,29 @@ Grafieke kan gebruik word om baie problmeme in rekenaar wetenskap te verteenwoor
 - ### Unicode
     - [ ] [The Absolute Minimum Every Software Developer Absolutely, Positively Must Know About Unicode and Character Sets]( http://www.joelonsoftware.com/articles/Unicode.html)
     - [ ] [What Every Programmer Absolutely, Positively Needs To Know About Encodings And Character Sets To Work With Text](http://kunststube.net/encoding/)
+
+- ### Endianness
+    - [ ] [Big And Little Endian](https://web.archive.org/web/20180107141940/http://www.cs.umd.edu:80/class/sum2003/cmsc311/Notes/Data/endian.html)
+    - [ ] [Big Endian Vs Little Endian (video)](https://www.youtube.com/watch?v=JrNF0KRAlyo)
+    - [ ] [Big And Little Endian Inside/Out (video)](https://www.youtube.com/watch?v=oBSuXP-1Tc0)
+        - Baie tegniese gesprek vir kernel devs. Moenie warrie as meeste oor jou kop gaan nie.
+        - Die eerste helfde is genoeg.
+
+- ### Networking
+    - **As jy netwerk ondervinding het of wil 'n reliability ingenieur of operations ingenieur word, verwag vrae**
+    - Anders is hierdie net goed om te weet
+    - [ ] [Khan Academy](https://www.khanacademy.org/computing/code-org/computers-and-the-internet)
+    - [ ] [UDP and TCP: Comparison of Transport Protocols (video)](https://www.youtube.com/watch?v=Vdc8TCESIg8)
+    - [ ] [TCP/IP and the OSI Model Explained! (video)](https://www.youtube.com/watch?v=e5DEVa9eSN0)
+    - [ ] [Packet Transmission across the Internet. Networking & TCP/IP tutorial. (video)](https://www.youtube.com/watch?v=nomyRJehhnM)
+    - [ ] [HTTP (video)](https://www.youtube.com/watch?v=WGJrLqtX7As)
+    - [ ] [SSL and HTTPS (video)](https://www.youtube.com/watch?v=S2iBR2ZlZf0)
+    - [ ] [SSL/TLS (video)](https://www.youtube.com/watch?v=Rp3iZUvXWlM)
+    - [ ] [HTTP 2.0 (video)](https://www.youtube.com/watch?v=E9FxNzv1Tr8)
+    - [ ] [Video Series (21 videos) (video)](https://www.youtube.com/playlist?list=PLEbnTDJUr_IegfoqO4iPnPYQui46QqT0j)
+    - [ ] [Subnetting Demystified - Part 5 CIDR Notation (video)](https://www.youtube.com/watch?v=t5xYI0jzOf4)
+    - [ ] Sockets:
+        - [ ] [Java - Sockets - Introduction (video)](https://www.youtube.com/watch?v=6G_W54zuadg&t=6s)
+        - [ ] [Socket Programming (video)](https://www.youtube.com/watch?v=G75vN2mnJeQ)
+
+---
\ No newline at end of file

From 0663c6f4c8c15a1206cfe26a8ad843f1107fcf66 Mon Sep 17 00:00:00 2001
From: Anri Lombard <anri.m.lombard@gmail.com>
Date: Tue, 19 Jul 2022 20:30:15 +0200
Subject: [PATCH 113/127] Lines 1220/1996

---
 translations/README-af.md | 14 ++++++++++++++
 1 file changed, 14 insertions(+)

diff --git a/translations/README-af.md b/translations/README-af.md
index cc1c7bd..6876f88 100644
--- a/translations/README-af.md
+++ b/translations/README-af.md
@@ -1201,4 +1201,18 @@ Grafieke kan gebruik word om baie problmeme in rekenaar wetenskap te verteenwoor
         - [ ] [Java - Sockets - Introduction (video)](https://www.youtube.com/watch?v=6G_W54zuadg&t=6s)
         - [ ] [Socket Programming (video)](https://www.youtube.com/watch?v=G75vN2mnJeQ)
 
+---
+
+## Finalde Revisie
+
+    Die seksie sal korter videos hê wat jy kan kyk redelik vinnig vir revisie van die mees belangrike konsepte.
+    Dis goed om die geheue tydelik te vervris.
+
+- [ ] Reeks van 2-3 minute kort onderwerp videos (23 videos)
+    - [Videos](https://www.youtube.com/watch?v=r4r1DZcx1cM&list=PLmVb1OknmNJuC5POdcDv5oCS7_OUkDgpj&index=22)
+- [ ] Reeks van 2-5 minute kort onderwerp videos - Michael Sambol (18 videos):
+    - [Videos](https://www.youtube.com/channel/UCzDJwLWoYCUQowF_nG3m5OQ)
+- [ ] [Sedgewick Videos - Algorithms I](https://www.coursera.org/learn/algorithms-part1)
+- [ ] [Sedgewick Videos - Algorithms II](https://www.coursera.org/learn/algorithms-part2)
+
 ---
\ No newline at end of file

From c7409489071843e542edf19cc1af1663d29261ed Mon Sep 17 00:00:00 2001
From: Anri Lombard <anri.m.lombard@gmail.com>
Date: Tue, 19 Jul 2022 20:38:34 +0200
Subject: [PATCH 114/127] Lines 1240/1996

---
 translations/README-af.md | 30 +++++++++++++++++++++++++++++-
 1 file changed, 29 insertions(+), 1 deletion(-)

diff --git a/translations/README-af.md b/translations/README-af.md
index 6876f88..633e197 100644
--- a/translations/README-af.md
+++ b/translations/README-af.md
@@ -1215,4 +1215,32 @@ Grafieke kan gebruik word om baie problmeme in rekenaar wetenskap te verteenwoor
 - [ ] [Sedgewick Videos - Algorithms I](https://www.coursera.org/learn/algorithms-part1)
 - [ ] [Sedgewick Videos - Algorithms II](https://www.coursera.org/learn/algorithms-part2)
 
----
\ No newline at end of file
+---
+
+## Werk Jou CV By
+
+- Sien Resume voorbereiding in die boeke: "Cracking The Coding Interview" en "Programming Interviews Exposed"
+- Ek weet nie hoe belangrik dit is nie (jy kan jou eie navorsing doen) maar hier is 'n artikel oor hoe om jou resume ATS versoenbaar te maak:
+    - [How to Create or Check if your Resume is ATS Compliant](https://ayedot.com/97/MiniBlog/Meaning-of-ATS-compliant-resume-and-How-to-create-ATS-Resume-for-Free)
+- ["This Is What A GOOD Resume Should Look Like" by Gayle McDowell (author of Cracking the Coding Interview)](https://www.careercup.com/resume), 
+    - Nota duer die outeur: "This is for a US-focused resume. CVs for India and other countries have different expectations, although many of the points will be the same."
+- ["Step-by-step resume guide" by Tech Interview Handbook](https://www.techinterviewhandbook.org/resume/guide)
+    - Gedetailleerde gids oor hoe om jou resume op te stel van niks, hoe om effektiewe resume inhoud te skryf, dit te optimiseer, en jou resume te toets
+
+## Kry die Werk
+
+- [Sites for Finding Jobs](https://ayedot.com/151/MiniBlog/Top-10-Best-Websites-for-Careers--Jobs)
+
+## Onderhoudproses & Algemene Voorbereiding
+
+- [ ] [How to Pass the Engineering Interview in 2021](https://davidbyttow.medium.com/how-to-pass-the-engineering-interview-in-2021-45f1b389a1)
+- [ ] [Demystifying Tech Recruiting](https://www.youtube.com/watch?v=N233T0epWTs)
+- [ ] How to Get a Job at the Big 4:
+    - [ ] [How to Get a Job at the Big 4 - Amazon, Facebook, Google & Microsoft (video)](https://www.youtube.com/watch?v=YJZCUhxNCv8)
+    - [ ] [How to Get a Job at the Big 4.1 (Follow-up video)](https://www.youtube.com/watch?v=6790FVXWBw8&feature=youtu.be)
+- [ ] Cracking The Coding Interview Set 1:
+    - [ ] [Gayle L McDowell - Cracking The Coding Interview (video)](https://www.youtube.com/watch?v=rEJzOhC5ZtQ)
+    - [ ] [Cracking the Coding Interview with Author Gayle Laakmann McDowell (video)](https://www.youtube.com/watch?v=aClxtDcdpsQ)
+- [ ] Cracking the Facebook Coding Interview:
+    - [ ] [The Approach](https://www.youtube.com/watch?v=wCl9kvQGHPI)
+    - [ ] [Problem Walkthrough](https://www.youtube.com/watch?v=4UWDyJq8jZg)
\ No newline at end of file

From 75761eefd7aabe23b752cea5683fdbd337b081a5 Mon Sep 17 00:00:00 2001
From: Anri Lombard <anri.m.lombard@gmail.com>
Date: Tue, 19 Jul 2022 20:47:13 +0200
Subject: [PATCH 115/127] Lines 1260/1996

---
 translations/README-af.md | 16 ++++++++++++++--
 1 file changed, 14 insertions(+), 2 deletions(-)

diff --git a/translations/README-af.md b/translations/README-af.md
index 633e197..7692ebd 100644
--- a/translations/README-af.md
+++ b/translations/README-af.md
@@ -1235,7 +1235,7 @@ Grafieke kan gebruik word om baie problmeme in rekenaar wetenskap te verteenwoor
 
 - [ ] [How to Pass the Engineering Interview in 2021](https://davidbyttow.medium.com/how-to-pass-the-engineering-interview-in-2021-45f1b389a1)
 - [ ] [Demystifying Tech Recruiting](https://www.youtube.com/watch?v=N233T0epWTs)
-- [ ] How to Get a Job at the Big 4:
+- [ ] Hoe om 'n werk by die Groot 4 te kry:
     - [ ] [How to Get a Job at the Big 4 - Amazon, Facebook, Google & Microsoft (video)](https://www.youtube.com/watch?v=YJZCUhxNCv8)
     - [ ] [How to Get a Job at the Big 4.1 (Follow-up video)](https://www.youtube.com/watch?v=6790FVXWBw8&feature=youtu.be)
 - [ ] Cracking The Coding Interview Set 1:
@@ -1243,4 +1243,16 @@ Grafieke kan gebruik word om baie problmeme in rekenaar wetenskap te verteenwoor
     - [ ] [Cracking the Coding Interview with Author Gayle Laakmann McDowell (video)](https://www.youtube.com/watch?v=aClxtDcdpsQ)
 - [ ] Cracking the Facebook Coding Interview:
     - [ ] [The Approach](https://www.youtube.com/watch?v=wCl9kvQGHPI)
-    - [ ] [Problem Walkthrough](https://www.youtube.com/watch?v=4UWDyJq8jZg)
\ No newline at end of file
+    - [ ] [Problem Walkthrough](https://www.youtube.com/watch?v=4UWDyJq8jZg)
+
+- Prep Courses:
+    - [Software Engineer Interview Unleashed (paid course)](https://www.udemy.com/software-engineer-interview-unleashed):
+        - Leer hoe om jouself gereed te maak vir sagteware ingeneur onderhoude van vorige Google onderhoudvoerders.
+    - [Python for Data Structures, Algorithms, and Interviews (paid course)](https://www.udemy.com/python-for-data-structures-algorithms-and-interviews/):
+        - 'n Python sentriese onderhoudsvoorbereiding kursus wat datastrukture, algoritmes, spot onderhoude en baie meer dek.
+    - [Intro to Data Structures and Algorithms using Python (Udacity free course)](https://www.udacity.com/course/data-structures-and-algorithms-in-python--ud513):
+        - 'n Verniet Python sentriese datastruktuur en algorithme kursus.
+    - [Data Structures and Algorithms Nanodegree! (Udacity paid Nanodegree)](https://www.udacity.com/course/data-structures-and-algorithms-nanodegree--nd256):
+        - Kry praktiese ervaring met oor 'n 100 datastrukture en algoritmiese oefeninge en leiding van 'n toegewyde mentor om jou te help voorberei vir onderhoude en on-the-job scenarios.
+    - [Grokking the Behavioral Interview (Educative free course)](https://www.educative.io/courses/grokking-the-behavioral-interview):
+        - Baie kere is dit nie jou tegniese bevoegdheid wat jou terug hou van jou droom werk kry nie, dis hoe jy in die gedragsonderhoude voer.
\ No newline at end of file

From fda74c9f269b83f96a5779cb05b4d817828ee92c Mon Sep 17 00:00:00 2001
From: Anri Lombard <anri.m.lombard@gmail.com>
Date: Tue, 19 Jul 2022 20:58:22 +0200
Subject: [PATCH 116/127] Lines 1280/1996

---
 translations/README-af.md | 25 ++++++++++++++++++++++++-
 1 file changed, 24 insertions(+), 1 deletion(-)

diff --git a/translations/README-af.md b/translations/README-af.md
index 7692ebd..131ee1d 100644
--- a/translations/README-af.md
+++ b/translations/README-af.md
@@ -1255,4 +1255,27 @@ Grafieke kan gebruik word om baie problmeme in rekenaar wetenskap te verteenwoor
     - [Data Structures and Algorithms Nanodegree! (Udacity paid Nanodegree)](https://www.udacity.com/course/data-structures-and-algorithms-nanodegree--nd256):
         - Kry praktiese ervaring met oor 'n 100 datastrukture en algoritmiese oefeninge en leiding van 'n toegewyde mentor om jou te help voorberei vir onderhoude en on-the-job scenarios.
     - [Grokking the Behavioral Interview (Educative free course)](https://www.educative.io/courses/grokking-the-behavioral-interview):
-        - Baie kere is dit nie jou tegniese bevoegdheid wat jou terug hou van jou droom werk kry nie, dis hoe jy in die gedragsonderhoude voer.
\ No newline at end of file
+        - Baie kere is dit nie jou tegniese bevoegdheid wat jou terug hou van jou droom werk kry nie, dis hoe jy in die gedragsonderhoude voer.
+
+Spot Onderhoude:
+- [Gainlo.co: Mock interviewers from big companies](http://www.gainlo.co/#!/) - Ek het die gebruik en dit het my gehelp ontspan vir die foon skerm en on-site onderhoud.
+- [Pramp: Mock interviews from/with peers](https://www.pramp.com/) - peer-to-peer model van onderhoudoefeninge.
+- [interviewing.io: Practice mock interview with senior engineers](https://interviewing.io) - anoniem algoritme/system design onderoude met senior ingeneurs van FAANG anoniem.
+
+## Dink aan vir wanneer die onderhoud kom
+
+Dink oor sowat 20 onderhoud vrae wat jy sal kry, in die rigting van dié hieronder. Hê ten minste een antwoord vir elkeen.
+Hê ook 'n storie, nie net data, oor iets wat jy bereik het.
+
+- Hoekom soek jy hierdie werk?
+- Wat is 'n taai probleem wat jy opgelos het?
+- Grootste uitdagings wat jy in die gesig gestaar het?
+- Beste/slegste ontwerpe wat jy al gesien het?
+- Idees om 'n produk te verbeter?
+- Hoe werk jy beste as 'n individu en as deel van 'n span?
+- Watse vernufte of ondervinding van jou sal 'n bate in die rol wees en hoekom?
+- Wat het jy die meeste geniet by [werk x / projek y]?
+- Wat was die grootste uitdaging wat jy in die gesig gestaar het by [werk x / pojek y]?
+- Wat was die moeilikste gogga wat jy moes oplos by [werk x / projek y]?
+- Wat het jy geleer by [werk x / projek y]?
+- Wat sou jy beter gedoen het by [werk x / projek y]?
\ No newline at end of file

From 50ea363451ec176051baee882e3402e46912c6ea Mon Sep 17 00:00:00 2001
From: Anri Lombard <anri.m.lombard@gmail.com>
Date: Tue, 19 Jul 2022 21:08:04 +0200
Subject: [PATCH 117/127] Lines 1290/1996

---
 translations/README-af.md | 15 ++++++++++++++-
 1 file changed, 14 insertions(+), 1 deletion(-)

diff --git a/translations/README-af.md b/translations/README-af.md
index 131ee1d..ecabbf1 100644
--- a/translations/README-af.md
+++ b/translations/README-af.md
@@ -1278,4 +1278,17 @@ Hê ook 'n storie, nie net data, oor iets wat jy bereik het.
 - Wat was die grootste uitdaging wat jy in die gesig gestaar het by [werk x / pojek y]?
 - Wat was die moeilikste gogga wat jy moes oplos by [werk x / projek y]?
 - Wat het jy geleer by [werk x / projek y]?
-- Wat sou jy beter gedoen het by [werk x / projek y]?
\ No newline at end of file
+- Wat sou jy beter gedoen het by [werk x / projek y]?
+
+- As jy dit moelik vind om met goeie antwoorde op te kom vir hierdie vrae is hier 'n paar idees:
+    - [General Interview Questions and their Answers](https://ayedot.com/119/MiniBlog/General-Interview-Questions-and-their-Answers-for-Tech-Jobs)
+
+## Hê vrae vir die onderhoudvoerder
+
+'n Paar van meine (Ek ken moontlik al klaar die antwoorde, maar wil hulle opinie of span perspektief hé):
+
+- How groot is jou span?
+- Hoe lyk jou dev cycle? Doen julle waterfall/sprints/agile?
+- Is dit algemeen om na die sperdatum te jaag? Of is daar buigsaamheid?
+- Hoe word besluite geneem op jou span?
+- Hoeveel vergaderings het julle per week?
\ No newline at end of file

From d00ca6fe884bdefad2d2b655804eb64daba58498 Mon Sep 17 00:00:00 2001
From: Anri Lombard <anri.m.lombard@gmail.com>
Date: Tue, 19 Jul 2022 21:11:01 +0200
Subject: [PATCH 118/127] Lines 1300/1996

---
 translations/README-af.md | 14 +++++++++++++-
 1 file changed, 13 insertions(+), 1 deletion(-)

diff --git a/translations/README-af.md b/translations/README-af.md
index ecabbf1..42e07cc 100644
--- a/translations/README-af.md
+++ b/translations/README-af.md
@@ -1291,4 +1291,16 @@ Hê ook 'n storie, nie net data, oor iets wat jy bereik het.
 - Hoe lyk jou dev cycle? Doen julle waterfall/sprints/agile?
 - Is dit algemeen om na die sperdatum te jaag? Of is daar buigsaamheid?
 - Hoe word besluite geneem op jou span?
-- Hoeveel vergaderings het julle per week?
\ No newline at end of file
+- Hoeveel vergaderings het julle per week?
+- Voel jy die omgewing help jou fokus?
+- Wat werk jy aan?
+- Wat hou jy van dit?
+- Hoe is die werk lewe?
+- Hoe is die werk/lewe belaans?
+
+## Sodra Jy Die Werk Het
+
+Geluk!
+
+Hou aan leer.
+

From d8a8293ecbbf5f518c3a65e61e25adeb6a9d100e Mon Sep 17 00:00:00 2001
From: Anri Lombard <anri.m.lombard@gmail.com>
Date: Tue, 19 Jul 2022 21:14:26 +0200
Subject: [PATCH 119/127] Lines 1320/1996

---
 translations/README-af.md | 15 +++++++++++++++
 1 file changed, 15 insertions(+)

diff --git a/translations/README-af.md b/translations/README-af.md
index 42e07cc..46648d1 100644
--- a/translations/README-af.md
+++ b/translations/README-af.md
@@ -1304,3 +1304,18 @@ Geluk!
 
 Hou aan leer.
 
+Jy is nooit regtig klaar nie.
+
+---
+
+    *****************************************************************************************************
+    *****************************************************************************************************
+
+    Alles hieronder is opsioneel. Dit is NIE nodig vir 'n intreevlak ingeneur nie.
+    Alhowel, deur om dit te studeer sal jy meer blootstelling kry met CS konsepte, en sal beter voorbereid wees vir
+    enige sagteware ingeneur werk. Jy sal 'n veel meer afgeronde sagteware ingeneur wees.
+
+    *****************************************************************************************************
+    *****************************************************************************************************
+
+---
\ No newline at end of file

From 82f9441c2702f86f238b6fa750b45b0c02d77672 Mon Sep 17 00:00:00 2001
From: Anri Lombard <anri.m.lombard@gmail.com>
Date: Tue, 19 Jul 2022 21:16:54 +0200
Subject: [PATCH 120/127] Lines 1330/1996

---
 translations/README-af.md | 14 +++++++++++++-
 1 file changed, 13 insertions(+), 1 deletion(-)

diff --git a/translations/README-af.md b/translations/README-af.md
index 46648d1..7dd1113 100644
--- a/translations/README-af.md
+++ b/translations/README-af.md
@@ -1318,4 +1318,16 @@ Jy is nooit regtig klaar nie.
     *****************************************************************************************************
     *****************************************************************************************************
 
----
\ No newline at end of file
+---
+
+## Bykomende Boeke
+
+    Hierdie is hier sodat jy kan delf in 'n onderwerp wat jy interessant vind.
+
+- [The Unix Programming Environment](https://www.amazon.com/dp/013937681X)
+    - An oue maar goeie
+- [The Linux Command Line: A Complete Introduction](https://www.amazon.com/dp/1593273894/)
+    - 'n Moderne opsie
+- [TCP/IP Illustrated Series](https://en.wikipedia.org/wiki/TCP/IP_Illustrated)
+- [Head First Design Patterns](https://www.amazon.com/gp/product/0596007124/)
+    - 'n Sagte inleiding na ontwerp patrone

From e9ccdbcfa9c5dcbd8444458a954ff9891cf6606d Mon Sep 17 00:00:00 2001
From: Anri Lombard <anri.m.lombard@gmail.com>
Date: Tue, 19 Jul 2022 21:23:01 +0200
Subject: [PATCH 121/127] Lines 1340/1996

---
 translations/README-af.md | 7 +++++++
 1 file changed, 7 insertions(+)

diff --git a/translations/README-af.md b/translations/README-af.md
index 7dd1113..c907517 100644
--- a/translations/README-af.md
+++ b/translations/README-af.md
@@ -1331,3 +1331,10 @@ Jy is nooit regtig klaar nie.
 - [TCP/IP Illustrated Series](https://en.wikipedia.org/wiki/TCP/IP_Illustrated)
 - [Head First Design Patterns](https://www.amazon.com/gp/product/0596007124/)
     - 'n Sagte inleiding na ontwerp patrone
+- [Design Patterns: Elements of Reusable Object-Oriente​d Software](https://www.amazon.com/Design-Patterns-Elements-Reusable-Object-Oriented/dp/0201633612)
+    - AKA die "Gang Of Four" boek, of GOF
+    - Die kanoniese ontwerp patrone boek
+- [Algorithm Design Manual](http://www.amazon.com/Algorithm-Design-Manual-Steven-Skiena/dp/1849967202) (Skiena)
+    - As 'n revisie en probleem herkening
+    - Die algoritme katalogus porsie is ver buite die omvang van probleme wat jy in die onderhoud sal kry
+    - Die bok het 2 dele:
\ No newline at end of file

From 253fedd78d8d1d81396ad0b5528db67b3f839873 Mon Sep 17 00:00:00 2001
From: Anri Lombard <anri.m.lombard@gmail.com>
Date: Tue, 19 Jul 2022 21:29:47 +0200
Subject: [PATCH 122/127] Lines 1350/1996

---
 translations/README-af.md | 12 +++++++++++-
 1 file changed, 11 insertions(+), 1 deletion(-)

diff --git a/translations/README-af.md b/translations/README-af.md
index c907517..fbe3175 100644
--- a/translations/README-af.md
+++ b/translations/README-af.md
@@ -1337,4 +1337,14 @@ Jy is nooit regtig klaar nie.
 - [Algorithm Design Manual](http://www.amazon.com/Algorithm-Design-Manual-Steven-Skiena/dp/1849967202) (Skiena)
     - As 'n revisie en probleem herkening
     - Die algoritme katalogus porsie is ver buite die omvang van probleme wat jy in die onderhoud sal kry
-    - Die bok het 2 dele:
\ No newline at end of file
+    - Die bok het 2 dele:
+        - Klass teksboek oor datastrukture en algoritmes
+            - Pros:
+                - Is so goed 'n revisie soos enige teksboek sal wees
+                - Goeie stories van sy ondervinding met probleme oplos in die bedryf en akademie
+                - Kode voorbeelde in C
+            - Cons:
+                - Kan so dig en ondeurdringbaar soos CLRS wees, en in sommige gevalle, kan CLRS 'n beter alternatief wees vir sekere onderwerpe
+                - Hoofstukke 7, 8, 9 kan pynlik wees om te probeer volg, omdat sommige items nie goed verduidelik word nie en bonodig meer brain wat ek nie het nie
+                - Moenie my misverstaan nie: Ek hou van Skiena, sy onderrig style, en manerismes, maar ek mag dalk nie Stony Brook materiaal wees nie
+            
\ No newline at end of file

From ce4db8559c6ed82dc13ce5b73b3961c99adea57a Mon Sep 17 00:00:00 2001
From: Anri Lombard <anri.m.lombard@gmail.com>
Date: Tue, 19 Jul 2022 21:38:05 +0200
Subject: [PATCH 123/127] Lines 1360/1996

---
 translations/README-af.md | 12 +++++++++++-
 1 file changed, 11 insertions(+), 1 deletion(-)

diff --git a/translations/README-af.md b/translations/README-af.md
index fbe3175..ea19e42 100644
--- a/translations/README-af.md
+++ b/translations/README-af.md
@@ -1347,4 +1347,14 @@ Jy is nooit regtig klaar nie.
                 - Kan so dig en ondeurdringbaar soos CLRS wees, en in sommige gevalle, kan CLRS 'n beter alternatief wees vir sekere onderwerpe
                 - Hoofstukke 7, 8, 9 kan pynlik wees om te probeer volg, omdat sommige items nie goed verduidelik word nie en bonodig meer brain wat ek nie het nie
                 - Moenie my misverstaan nie: Ek hou van Skiena, sy onderrig style, en manerismes, maar ek mag dalk nie Stony Brook materiaal wees nie
-            
\ No newline at end of file
+        - Algorime katalogus:
+            - Die is die egte rede hoekom jy hierdie boek koop.
+            - Die boek is beter as 'n algoritme verwysing, en nie iets wat jy lees om heel te dek nie.
+    - Kan op Kindle huur
+    - Antwoorde
+        - [Solutions](https://web.archive.org/web/20150404194210/http://www.algorithm.cs.sunysb.edu/algowiki/index.php/The_Algorithms_Design_Manual_(Second_Edition))
+    - [Errata](http://www3.cs.stonybrook.edu/~skiena/algorist/book/errata)
+- [Write Great Code: Volume 1: Understanding the Machine](https://www.amazon.com/Write-Great-Code-Understanding-Machine/dp/1593270038)
+    - Die boek was gepubliseer in 2004, en is sowat verouderd, maar dis 'n geweldige hulpbron om 'n rekenaar in kort te verstaan
+    - Die outeur het [HLA](https://en.wikipedia.org/wiki/High_Level_Assembly) uitgeving, so vat noemings en voorbeelde in HLA met 'n graan sout. Nie wyd gebruik nie, maar goeie voorbeelde van hoe assembly lyk
+    -
\ No newline at end of file

From 9d22c361522e9b4e68a72fc3151038c5577ee2ca Mon Sep 17 00:00:00 2001
From: Anri Lombard <anri.m.lombard@gmail.com>
Date: Tue, 19 Jul 2022 21:39:32 +0200
Subject: [PATCH 124/127] Lines 1370/1996

---
 translations/README-af.md | 11 ++++++++++-
 1 file changed, 10 insertions(+), 1 deletion(-)

diff --git a/translations/README-af.md b/translations/README-af.md
index ea19e42..562bae4 100644
--- a/translations/README-af.md
+++ b/translations/README-af.md
@@ -1357,4 +1357,13 @@ Jy is nooit regtig klaar nie.
 - [Write Great Code: Volume 1: Understanding the Machine](https://www.amazon.com/Write-Great-Code-Understanding-Machine/dp/1593270038)
     - Die boek was gepubliseer in 2004, en is sowat verouderd, maar dis 'n geweldige hulpbron om 'n rekenaar in kort te verstaan
     - Die outeur het [HLA](https://en.wikipedia.org/wiki/High_Level_Assembly) uitgeving, so vat noemings en voorbeelde in HLA met 'n graan sout. Nie wyd gebruik nie, maar goeie voorbeelde van hoe assembly lyk
-    -
\ No newline at end of file
+    - Hierdie hoofstukke is die moeite werk om te lees vir 'n goeie fondament:
+        - Hoofstuk 2 - Numeric Representation
+        - Hoofstuk 3 - Binary Arithmetic and Bit Operations
+        - Hoofstuk 4 - Floating-Point Representation
+        - Hoofstuk 5 - Character Representation
+        - Hoofstuk 6 - Memory Organization and Access
+        - Hoofstuk 7 - Composite Data Types and Memory Objects
+        - Hoofstuk 9 - CPU Architecture
+        - Hoofstuk 10 - Instruction Set Architecture
+        - Hoofstuk 11 - Memory Architecture and Organization
\ No newline at end of file

From a94f0f365005502486c7129f0e5470385e7d0da8 Mon Sep 17 00:00:00 2001
From: Anri Lombard <anri.m.lombard@gmail.com>
Date: Tue, 19 Jul 2022 21:45:45 +0200
Subject: [PATCH 125/127] Lines 1380/1996

---
 translations/README-af.md | 13 ++++++++++++-
 1 file changed, 12 insertions(+), 1 deletion(-)

diff --git a/translations/README-af.md b/translations/README-af.md
index 562bae4..8afa331 100644
--- a/translations/README-af.md
+++ b/translations/README-af.md
@@ -1366,4 +1366,15 @@ Jy is nooit regtig klaar nie.
         - Hoofstuk 7 - Composite Data Types and Memory Objects
         - Hoofstuk 9 - CPU Architecture
         - Hoofstuk 10 - Instruction Set Architecture
-        - Hoofstuk 11 - Memory Architecture and Organization
\ No newline at end of file
+        - Hoofstuk 11 - Memory Architecture and Organization
+- [Introduction to Algorithms](https://www.amazon.com/Introduction-Algorithms-fourth-Thomas-Cormen/dp/026204630X)
+    - **Belangrik:** Om hierdie boek te lees sal beperkte waarde hê. Die boek is 'n goeie revisie van algoritmes en datastrukture, maar sal jou nie leer hoe om goeie kode te skryf nie. Jy moet in staat wees om goeie, effektiewe oplossings te programeer
+    - AKA CLR, soms CLRS, omdat Stein laat saamgekom het
+- [Computer Architecture, Sixth Edition: A Quantitative Approach](https://www.amazon.com/dp/0128119055)
+    - Vir 'n ryker, meer geopdateerde (2017), maar langer behandeling
+
+## System Design, Scalability, Data Handling
+
+**Jy kan 'n paar ondtwerp vrae verwag as jy 4+ jare ondervinding het.**
+
+- 
\ No newline at end of file

From 6262fde21673eb8d65be6700f1311455c2096a95 Mon Sep 17 00:00:00 2001
From: Anri Lombard <anri.m.lombard@gmail.com>
Date: Tue, 19 Jul 2022 21:51:59 +0200
Subject: [PATCH 126/127] Lines 1390/1996

---
 translations/README-af.md | 17 ++++++++++++++++-
 1 file changed, 16 insertions(+), 1 deletion(-)

diff --git a/translations/README-af.md b/translations/README-af.md
index 8afa331..e96609c 100644
--- a/translations/README-af.md
+++ b/translations/README-af.md
@@ -1377,4 +1377,19 @@ Jy is nooit regtig klaar nie.
 
 **Jy kan 'n paar ondtwerp vrae verwag as jy 4+ jare ondervinding het.**
 
-- 
\ No newline at end of file
+- Scalability en System Design is beide baie groot onderwerpe met onderwerpe en hulpbronne, omdat
+      daar baie is om te oorweeg wanneer 'n sagtewaar/hardewaar sisteem wat kan skaal geontwerp word.
+      Verwag om nogals 'n bikie tyd hierop te spandeer
+- Oorwegings:
+    - Scalability:
+        - Distileer grood data stelle na 'n enkele waarde
+        - Transformeer een data stel na 'n ander een
+        - Hantering van baie groot bedrae van data
+    - System design
+        - features sets
+        - interfaces
+        - class hierarchies
+        - ontwerp van 'n sisteem onder sekere beperkings
+        - eenvoud en robuustheid
+        - tradeoffs
+        - performance analysis and optimization
\ No newline at end of file

From 37190f2dd6267b6f23e3634b073e58ac407ffa6b Mon Sep 17 00:00:00 2001
From: Anri Lombard <anri.m.lombard@gmail.com>
Date: Tue, 19 Jul 2022 21:54:02 +0200
Subject: [PATCH 127/127] Lines 1400/1996

---
 translations/README-af.md | 14 +++++++++++++-
 1 file changed, 13 insertions(+), 1 deletion(-)

diff --git a/translations/README-af.md b/translations/README-af.md
index e96609c..313037a 100644
--- a/translations/README-af.md
+++ b/translations/README-af.md
@@ -1392,4 +1392,16 @@ Jy is nooit regtig klaar nie.
         - ontwerp van 'n sisteem onder sekere beperkings
         - eenvoud en robuustheid
         - tradeoffs
-        - performance analysis and optimization
\ No newline at end of file
+        - performance analysis and optimization
+- [ ] **BEGIN HIER**: [The System Design Primer](https://github.com/donnemartin/system-design-primer)
+- [ ] [System Design from HiredInTech](http://www.hiredintech.com/system-design/)
+- [ ] [How Do I Prepare To Answer Design Questions In A Technical Interview?](https://www.quora.com/How-do-I-prepare-to-answer-design-questions-in-a-technical-interview?redirected_qid=1500023)
+- [ ] [8 Things You Need to Know Before a System Design Interview](http://blog.gainlo.co/index.php/2015/10/22/8-things-you-need-to-know-before-system-design-interviews/)
+- [ ] [Database Normalization - 1NF, 2NF, 3NF and 4NF (video)](https://www.youtube.com/watch?v=UrYLYV7WSHM)
+- [ ] [System Design Interview](https://github.com/checkcheckzz/system-design-interview) - Daar is baie hulpbronne in hierdie een. Look deur die artikels en voorbeelde. Ek wys 'n paar hieronder
+- [ ] [How to ace a systems design interview](https://web.archive.org/web/20120716060051/http://www.palantir.com/2011/10/how-to-rock-a-systems-design-interview/)
+- [ ] [Numbers Everyone Should Know](http://everythingisdata.wordpress.com/2009/10/17/numbers-everyone-should-know/)
+- [ ] [How long does it take to make a context switch?](http://blog.tsunanet.net/2010/11/how-long-does-it-take-to-make-context.html)
+- [ ] [Transactions Across Datacenters (video)](https://www.youtube.com/watch?v=srOgpXECblk)
+- [ ] [A plain English introduction to CAP Theorem](http://ksat.me/a-plain-english-introduction-to-cap-theorem)
+- [ ] [MIT 6.824: Distributed Systems, Spring 2020 (20 videos)](https://www.youtube.com/watch?v=cQP8WApzIQQ&list=PLrw6a1wE39_tb2fErI4-WkMbsvGQk9_UB)
\ No newline at end of file