From d20a1823aacb2d3d6d6ed8c3bebdced8cf1667a1 Mon Sep 17 00:00:00 2001
From: Ozlem <95313700+OzPol@users.noreply.github.com>
Date: Wed, 25 Sep 2024 15:00:43 -0400
Subject: [PATCH 1/2] Update README.md : Organized Data Structures and Extra
sections
Refactor: Organized Data Structures and Extra sections alphabetically in the README for improved clarity and ease of navigation.
---
README.md | 506 +++++++++++++++++++++++++++---------------------------
1 file changed, 253 insertions(+), 253 deletions(-)
diff --git a/README.md b/README.md
index 13402b67..9cb1522e 100644
--- a/README.md
+++ b/README.md
@@ -1691,24 +1691,24 @@ In order to achieve greater coverage and encourage more people to contribute to
- Binary Tree |
+ Binary Search Tree |
-
+
|
-
+
|
-
+
|
-
+
|
@@ -1718,13 +1718,13 @@ In order to achieve greater coverage and encourage more people to contribute to
-
+
|
-
-
+
+
|
@@ -1749,24 +1749,24 @@ In order to achieve greater coverage and encourage more people to contribute to
|
- Binary Search Tree |
+ Binary Tree |
-
+
|
-
+
|
-
+
|
-
+
|
@@ -1776,13 +1776,13 @@ In order to achieve greater coverage and encourage more people to contribute to
-
+
|
-
-
+
+
|
@@ -1807,10 +1807,10 @@ In order to achieve greater coverage and encourage more people to contribute to
|
- Double-ended Queue |
+ Circular Linked List |
-
-
+
+
|
@@ -1824,33 +1824,33 @@ In order to achieve greater coverage and encourage more people to contribute to
|
-
+
|
-
-
+
+
|
-
-
+
+
|
-
-
+
+
|
-
-
+
+
|
-
-
+
+
|
@@ -1865,10 +1865,10 @@ In order to achieve greater coverage and encourage more people to contribute to
|
- Queue |
+ Double-ended Queue |
-
-
+
+
|
@@ -1877,43 +1877,43 @@ In order to achieve greater coverage and encourage more people to contribute to
|
-
-
+
+
|
-
+
|
-
-
+
+
|
-
+
|
-
+
|
-
+
|
-
+
|
-
-
+
+
|
@@ -1981,15 +1981,15 @@ In order to achieve greater coverage and encourage more people to contribute to
|
- Graph |
+ Dynamic Stack |
-
+
|
-
-
+
+
|
@@ -1998,8 +1998,8 @@ In order to achieve greater coverage and encourage more people to contribute to
|
-
-
+
+
|
@@ -2023,8 +2023,8 @@ In order to achieve greater coverage and encourage more people to contribute to
|
-
-
+
+
|
@@ -2039,40 +2039,40 @@ In order to achieve greater coverage and encourage more people to contribute to
|
- Circular Linked List |
+ Doubly Linked List |
-
+
|
-
-
+
+
|
-
-
+
+
|
-
+
|
-
-
+
+
|
-
-
+
+
|
-
-
+
+
|
@@ -2081,8 +2081,8 @@ In order to achieve greater coverage and encourage more people to contribute to
|
-
-
+
+
|
@@ -2096,16 +2096,16 @@ In order to achieve greater coverage and encourage more people to contribute to
|
-
- Singly Linked List |
+
+ Graph |
-
+
|
-
-
+
+
|
@@ -2114,32 +2114,32 @@ In order to achieve greater coverage and encourage more people to contribute to
|
-
-
+
+
|
-
-
+
+
|
-
-
+
+
|
-
-
+
+
|
-
-
+
+
|
-
+
|
@@ -2155,40 +2155,40 @@ In order to achieve greater coverage and encourage more people to contribute to
- Doubly Linked List |
+ Hash Table |
-
-
+
+
|
-
-
+
+
|
-
-
+
+
|
-
+
|
-
-
+
+
|
-
+
|
-
-
+
+
|
@@ -2197,8 +2197,8 @@ In order to achieve greater coverage and encourage more people to contribute to
|
-
-
+
+
|
@@ -2213,9 +2213,9 @@ In order to achieve greater coverage and encourage more people to contribute to
|
- Unordered Linked List |
+ Queue |
-
+
|
@@ -2225,43 +2225,43 @@ In order to achieve greater coverage and encourage more people to contribute to
-
-
+
+
|
-
+
|
-
-
+
+
|
-
-
+
+
|
-
-
+
+
|
-
-
+
+
|
-
-
+
+
|
-
-
+
+
|
@@ -2271,10 +2271,10 @@ In order to achieve greater coverage and encourage more people to contribute to
|
- Sorted Linked List |
+ Ring Buffer |
-
-
+
+
|
@@ -2288,13 +2288,13 @@ In order to achieve greater coverage and encourage more people to contribute to
|
-
+
|
-
-
+
+
|
@@ -2329,15 +2329,15 @@ In order to achieve greater coverage and encourage more people to contribute to
|
- Skip List |
+ Singly Linked List |
-
-
+
+
|
-
-
+
+
|
@@ -2346,33 +2346,33 @@ In order to achieve greater coverage and encourage more people to contribute to
|
-
+
|
-
-
+
+
|
-
-
+
+
|
-
-
+
+
|
-
-
+
+
|
-
-
+
+
|
@@ -2387,55 +2387,55 @@ In order to achieve greater coverage and encourage more people to contribute to
|
- Stack |
+ Skip List |
-
-
+
+
|
-
-
+
+
|
-
-
+
+
|
-
+
|
-
-
+
+
|
-
-
+
+
|
-
-
+
+
|
-
-
+
+
|
-
-
+
+
|
-
-
+
+
|
@@ -2445,15 +2445,15 @@ In order to achieve greater coverage and encourage more people to contribute to
|
- Dynamic Stack |
+ Sorted Linked List |
-
+
|
-
-
+
+
|
@@ -2462,13 +2462,13 @@ In order to achieve greater coverage and encourage more people to contribute to
|
-
+
|
-
-
+
+
|
@@ -2503,55 +2503,55 @@ In order to achieve greater coverage and encourage more people to contribute to
|
- Ring Buffer |
+ Stack |
-
-
+
+
|
-
-
+
+
|
-
-
+
+
|
-
+
|
-
-
+
+
|
-
-
+
+
|
-
-
+
+
|
-
-
+
+
|
-
-
+
+
|
-
-
+
+
|
@@ -2561,10 +2561,10 @@ In order to achieve greater coverage and encourage more people to contribute to
|
- Hash Table |
+ Unordered Linked List |
-
-
+
+
|
@@ -2578,18 +2578,18 @@ In order to achieve greater coverage and encourage more people to contribute to
|
-
+
|
-
-
+
+
|
-
-
+
+
|
@@ -3609,15 +3609,15 @@ In order to achieve greater coverage and encourage more people to contribute to
|
- Queue using Stacks |
+ Find Distinct Subsets |
|
-
-
+
+
|
@@ -3626,8 +3626,8 @@ In order to achieve greater coverage and encourage more people to contribute to
|
-
-
+
+
|
@@ -3667,30 +3667,30 @@ In order to achieve greater coverage and encourage more people to contribute to
|
- Two-Sum Problem |
+ Isogram |
-
-
+
+
|
-
-
+
+
|
-
-
+
+
|
-
-
+
+
|
-
-
+
+
|
@@ -3709,8 +3709,8 @@ In order to achieve greater coverage and encourage more people to contribute to
|
-
-
+
+
|
@@ -3725,55 +3725,55 @@ In order to achieve greater coverage and encourage more people to contribute to
|
- Palindrome |
+ Leibniz Formula for Pi |
-
+
|
-
+
|
-
+
|
-
+
|
-
-
+
+
|
-
+
|
-
+
|
-
+
|
-
+
|
-
-
+
+
|
@@ -3783,7 +3783,7 @@ In order to achieve greater coverage and encourage more people to contribute to
|
- Isogram |
+ Maze-Solving Algorithm |
@@ -3800,13 +3800,13 @@ In order to achieve greater coverage and encourage more people to contribute to
|
-
-
+
+
|
-
-
+
+
|
@@ -3841,55 +3841,55 @@ In order to achieve greater coverage and encourage more people to contribute to
|
- Leibniz Formula for Pi |
+ Palindrome |
-
+
|
-
+
|
-
+
|
-
+
|
-
-
+
+
|
-
+
|
-
+
|
-
+
|
-
+
|
-
-
+
+
|
@@ -3899,7 +3899,7 @@ In order to achieve greater coverage and encourage more people to contribute to
|
- Maze-Solving Algorithm |
+ Queue using Stacks |
@@ -3916,7 +3916,7 @@ In order to achieve greater coverage and encourage more people to contribute to
|
-
+
|
@@ -4015,25 +4015,25 @@ In order to achieve greater coverage and encourage more people to contribute to
- Find Distinct Subsets |
+ Two-Sum Problem |
-
-
+
+
|
-
+
|
-
-
+
+
|
-
-
+
+
|
@@ -4057,8 +4057,8 @@ In order to achieve greater coverage and encourage more people to contribute to
|
-
-
+
+
|
From 96585cd5c7c19979dc13410684f5d1889764795a Mon Sep 17 00:00:00 2001
From: Ozlem <95313700+OzPol@users.noreply.github.com>
Date: Wed, 25 Sep 2024 15:17:59 -0400
Subject: [PATCH 2/2] Fixing Lint check failed case
Corrected file path for 'CalculatePi.cpp' in the README (Line 3735) and removed extra tab causing whitespace issue on line 2099.
---
README.md | 4 ++--
1 file changed, 2 insertions(+), 2 deletions(-)
diff --git a/README.md b/README.md
index 9cb1522e..4e7dd6b8 100644
--- a/README.md
+++ b/README.md
@@ -2096,7 +2096,7 @@ In order to achieve greater coverage and encourage more people to contribute to
|
-
+
Graph |
@@ -3732,7 +3732,7 @@ In order to achieve greater coverage and encourage more people to contribute to
|
-
+
|