From ad7d8a854a5b8fbbf236afec97ff3e3760906908 Mon Sep 17 00:00:00 2001
From: Marco <mmicu.github00@gmail.com>
Date: Fri, 6 Jan 2023 22:01:03 +0100
Subject: [PATCH 1/5] Fix "Time complexity" link

---
 README.md | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/README.md b/README.md
index 22bd4db..2f3ab69 100755
--- a/README.md
+++ b/README.md
@@ -17,7 +17,7 @@ Additional material:
 |---|---|
 | Python DS | <https://docs.python.org/3/tutorial/datastructures.html> |
 | Python collections | <https://docs.python.org/3/library/collections.html> |
-| Time complexity | <https://docs.python.org/3/tutorial/datastructures.html> |
+| Time complexity | <https://wiki.python.org/moin/TimeComplexity> |
 
 ## Index
 

From 3d5b10fdb5dd7cf114eb67c81428d12a388fe314 Mon Sep 17 00:00:00 2001
From: Marco <mmicu.github00@gmail.com>
Date: Fri, 15 Dec 2023 15:50:41 +0100
Subject: [PATCH 2/5] Add "discard" for sets

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

diff --git a/README.md b/README.md
index 2f3ab69..55370a2 100755
--- a/README.md
+++ b/README.md
@@ -397,6 +397,7 @@ True
 >>> s
 {2, 'a'}
 >>> s.remove(1)  # `KeyError: 1`
+>>> s.discard(1)  # It won't raise `KeyError` even if the element does not exist
 >>> s.pop()  # Remove and return an arbitrary element from the set
 2
 

From 6500f8a46e132c9261b056bc10fe1eaa5a131e82 Mon Sep 17 00:00:00 2001
From: Marco <mmicu.github00@gmail.com>
Date: Thu, 2 May 2024 23:12:41 +0200
Subject: [PATCH 3/5] Minor fixes

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

diff --git a/README.md b/README.md
index 55370a2..667eafe 100755
--- a/README.md
+++ b/README.md
@@ -511,7 +511,7 @@ You can overcome this problem by applying one of the following strategies:
 
 ### collections
 
-Container datatypes ([collections package](<https://docs.python.org/3/library/collections.html>)).
+Container data types in the ([collections package](<https://docs.python.org/3/library/collections.html>)).
 
 #### collections.namedtuple
 
@@ -590,6 +590,9 @@ c 2
 
 #### collections.OrderedDict
 
+Please, notice that, since `Python` `3.6`,
+the order of items in a dictionary is guaranteed to be preserved.
+
 ```python
 >>> from collections import OrderedDict
 

From 9be6707bc04fd8a0f76c84a00e74c4e295d67e92 Mon Sep 17 00:00:00 2001
From: Marco <mmicu.github00@gmail.com>
Date: Mon, 22 Jul 2024 22:52:27 +0200
Subject: [PATCH 4/5] Add algo-ds.com

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

diff --git a/README.md b/README.md
index 667eafe..99489a9 100755
--- a/README.md
+++ b/README.md
@@ -15,6 +15,7 @@ Additional material:
 
 | **Topic** | **Link** |
 |---|---|
+| Intro to Algorithms and Data Structures | <https://algo-ds.com> |
 | Python DS | <https://docs.python.org/3/tutorial/datastructures.html> |
 | Python collections | <https://docs.python.org/3/library/collections.html> |
 | Time complexity | <https://wiki.python.org/moin/TimeComplexity> |

From 82cfebfec69c6e6c6ff9e2e487e9cefe0131b8f0 Mon Sep 17 00:00:00 2001
From: lentil32 <lentil32@icloud.com>
Date: Tue, 13 Aug 2024 17:54:45 +0900
Subject: [PATCH 5/5] fix: typo in README.md

3 - 2 == 1
---
 README.md | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/README.md b/README.md
index 99489a9..79497c9 100755
--- a/README.md
+++ b/README.md
@@ -364,7 +364,7 @@ True
 1
 
 >>> len(queue)
-2
+1
 
 >>> queue.popleft()
 2