update 2.0

Tamrakar182 · Nov 20, 2023 · 1aff235 · 1aff235
1 parent 58f6616
commit 1aff235
Show file tree

Hide file tree

Showing 15 changed files with 36 additions and 30 deletions.
diff --git a/...ode 75/Day 1 Merge Strings Alternately.md → ...ode 75/Day 1 Merge Strings Alternately.md b/...ode 75/Day 1 Merge Strings Alternately.md → ...ode 75/Day 1 Merge Strings Alternately.md
diff --git a/docs/LeetCode 75/Day 10 Move Zeroes.md → ...ttempts/LeetCode 75/Day 10 Move Zeroes.md b/docs/LeetCode 75/Day 10 Move Zeroes.md → ...ttempts/LeetCode 75/Day 10 Move Zeroes.md
diff --git a/docs/LeetCode 75/Day 11 Is Subsequence.md → ...mpts/LeetCode 75/Day 11 Is Subsequence.md b/docs/LeetCode 75/Day 11 Is Subsequence.md → ...mpts/LeetCode 75/Day 11 Is Subsequence.md
diff --git a/...de 75/Day 12 Container With Most Water.md → ...de 75/Day 12 Container With Most Water.md b/...de 75/Day 12 Container With Most Water.md → ...de 75/Day 12 Container With Most Water.md
diff --git a/...de 75/Day 13 Max Number of K-Sum Pairs.md → ...de 75/Day 13 Max Number of K-Sum Pairs.md b/...de 75/Day 13 Max Number of K-Sum Pairs.md → ...de 75/Day 13 Max Number of K-Sum Pairs.md
diff --git a/...y 2 Greatest Common Divisor of Strings.md → ...y 2 Greatest Common Divisor of Strings.md b/...y 2 Greatest Common Divisor of Strings.md → ...y 2 Greatest Common Divisor of Strings.md
diff --git a/...ids with the Greates Number of Candies.md → ...ids with the Greates Number of Candies.md b/...ids with the Greates Number of Candies.md → ...ids with the Greates Number of Candies.md
diff --git a/docs/LeetCode 75/Day 4 Can Place Flowers.md → ...ts/LeetCode 75/Day 4 Can Place Flowers.md b/docs/LeetCode 75/Day 4 Can Place Flowers.md → ...ts/LeetCode 75/Day 4 Can Place Flowers.md
diff --git a/...de 75/Day 5 Reverse Vowels of a String.md → ...de 75/Day 5 Reverse Vowels of a String.md b/...de 75/Day 5 Reverse Vowels of a String.md → ...de 75/Day 5 Reverse Vowels of a String.md
diff --git a/...ode 75/Day 6 Reverse Words in a String.md → ...ode 75/Day 6 Reverse Words in a String.md b/...ode 75/Day 6 Reverse Words in a String.md → ...ode 75/Day 6 Reverse Words in a String.md
diff --git a/... 75/Day 7 Product of Array Except Self.md → ... 75/Day 7 Product of Array Except Self.md b/... 75/Day 7 Product of Array Except Self.md → ... 75/Day 7 Product of Array Except Self.md
diff --git a/...5/Day 8 Increasing Triplet Subsequence.md → ...5/Day 8 Increasing Triplet Subsequence.md b/...5/Day 8 Increasing Triplet Subsequence.md → ...5/Day 8 Increasing Triplet Subsequence.md
diff --git a/docs/LeetCode 75/Day 9 String Compression.md → ...s/LeetCode 75/Day 9 String Compression.md b/docs/LeetCode 75/Day 9 String Compression.md → ...s/LeetCode 75/Day 9 String Compression.md
diff --git a/docs/Previous Attempts/index.md b/docs/Previous Attempts/index.md
@@ -0,0 +1,34 @@
+# LeetCode Daily Challenge
+
+## Introduction
+~~This is my attempt to do the LeetCode Daily Challenge. I will be using Obsidian to take notes and publish them with MkDocs.
+Started from the 1st of July to 12th July~~
+Failed Attempt 1, wasn't able to follow through due to disinterest.
+## LeetCode 75
+These are my notes for the ["Ace Coding Interview with 75 Qs"](https://leetcode.com/studyplan/leetcode-75/?fbclid=IwAR2kMaXgEN6U9xL2uorN1S6WynOcS4QvVCf0_uVm1L1lSpUAnb5qVFu_gVo).
+
+- [[Day 1 Merge Strings Alternately]]
+
+- [[Day 2 Greatest Common Divisor of Strings]]
+
+- [[Day 3 Kids with the Greates Number of Candies]]
+
+- [[Day 4 Can Place Flowers]]
+
+- [[Day 5 Reverse Vowels of a String]]
+
+- [[Day 6 Reverse Words in a String]]
+
+- [[Day 7 Product of Array Except Self]]
+
+- [[Day 8 Increasing Triplet Subsequence]]
+
+- [[Day 9 String Compression]]
+
+- [[Day 10 Move Zeroes]]
+
+- [[Day 11 Is Subsequence]]
+
+- [[Day 12 Container With Most Water]]
+
+- [[Day 13 Max Number of K-Sum Pairs]]
diff --git a/docs/index.md b/docs/index.md
@@ -1,35 +1,7 @@
 # LeetCode Daily Challenge
 
 ## Introduction
-This is my attempt to do the LeetCode Daily Challenge. I will be using Obsidian to take notes and publish them with MkDocs.
+This is my second attempt to do the LeetCode Daily Challenge. I will be using Obsidian to take notes and publish them with MkDocs.
 
-Started from the 1st of July to Present
+Check my previous Attempt [[Previous Attempts/index|here]]
 
-## LeetCode 75
-These are my notes for the ["Ace Coding Interview with 75 Qs"](https://leetcode.com/studyplan/leetcode-75/?fbclid=IwAR2kMaXgEN6U9xL2uorN1S6WynOcS4QvVCf0_uVm1L1lSpUAnb5qVFu_gVo).
-
-- [[Day 1 Merge Strings Alternately]]
-
-- [[Day 2 Greatest Common Divisor of Strings]]
-
-- [[Day 3 Kids with the Greates Number of Candies]]
-
-- [[Day 4 Can Place Flowers]]
-
-- [[Day 5 Reverse Vowels of a String]]
-
-- [[Day 6 Reverse Words in a String]]
-
-- [[Day 7 Product of Array Except Self]]
-
-- [[Day 8 Increasing Triplet Subsequence]]
-
-- [[Day 9 String Compression]]
-
-- [[Day 10 Move Zeroes]]
-
-- [[Day 11 Is Subsequence]]
-
-- [[Day 12 Container With Most Water]]
-
-- [[Day 13 Max Number of K-Sum Pairs]]