Automated Commit 🤖

README.md

@@ -7,7 +7,7 @@
 [LeetCode](https://leetcode.com/) is a website containing many algorithm questions. Most of them are real interview questions of Google, Facebook, LinkedIn, Apple, etc. and it always help to sharp our algorithm skills. This repo shows my solutions in Python. Hit the STAR to support this repo, thank you!
 
 ### Repository Structure
-**The repository is organized into three main folders based on difficulty:***
+**The repository is organized into three main folders based on difficulty:**
 ```
 LeetCode-Solutions/
 ├── easy/
@@ -29,10 +29,10 @@ LeetCode-Solutions/
 
 ## Easy
 
-[Running Sum of 1d Array](https://leetcode.com/problems/running-sum-of-1d-array/description/) - [Solution](1480-running-sum-of-1-d-array.md)
-[Is Subsequence](https://leetcode.com/problems/is-subsequence/description/) - [Solution](392-is-subsequence.md)
-[Roman to Integer](https://leetcode.com/problems/roman-to-integer/description/) - [Solution](13-roman-to-integer.md)
-[Merge Strings Alternately](https://leetcode.com/problems/merge-strings-alternately/description/) - [Solution](1768-merge-strings-alternately.md)
-[Longest Common Prefix](https://leetcode.com/problems/longest-common-prefix/description/) - [Solution](14-longest-common-prefix.md)
-[Find Closest Number to Zero](https://leetcode.com/problems/find-closest-number-to-zero/description/) - [Solution](2239-find-closest-number-to-zero.md)
-[Number of Steps to Reduce a Number to Zero](https://leetcode.com/problems/number-of-steps-to-reduce-a-number-to-zero/description/) - [Solution](1342-number-of-steps-to-reduce-a-number-to-zero.md)
+- [Running Sum of 1d Array](https://leetcode.com/problems/running-sum-of-1d-array/description/) - [Solution](1480-running-sum-of-1-d-array.md)
+- [Is Subsequence](https://leetcode.com/problems/is-subsequence/description/) - [Solution](392-is-subsequence.md)
+- [Roman to Integer](https://leetcode.com/problems/roman-to-integer/description/) - [Solution](13-roman-to-integer.md)
+- [Merge Strings Alternately](https://leetcode.com/problems/merge-strings-alternately/description/) - [Solution](1768-merge-strings-alternately.md)
+- [Longest Common Prefix](https://leetcode.com/problems/longest-common-prefix/description/) - [Solution](14-longest-common-prefix.md)
+- [Find Closest Number to Zero](https://leetcode.com/problems/find-closest-number-to-zero/description/) - [Solution](2239-find-closest-number-to-zero.md)
+- [Number of Steps to Reduce a Number to Zero](https://leetcode.com/problems/number-of-steps-to-reduce-a-number-to-zero/description/) - [Solution](1342-number-of-steps-to-reduce-a-number-to-zero.md)

index.html

@@ -3,7 +3,7 @@ <h1>LeetCode Solutions</h1>
 <p><a href="https://leetcode.com/Mo-Shakib"><img src="https://leetcode.card.workers.dev/Mo-Shakib?theme=dark&font=baloo&extension=null&border=0.2"></a></p>
 <p><a href="https://leetcode.com/">LeetCode</a> is a website containing many algorithm questions. Most of them are real interview questions of Google, Facebook, LinkedIn, Apple, etc. and it always help to sharp our algorithm skills. This repo shows my solutions in Python. Hit the STAR to support this repo, thank you!</p>
 <h3>Repository Structure</h3>
-<p><strong>The repository is organized into three main folders based on difficulty:</strong>*
+<p><strong>The repository is organized into three main folders based on difficulty:</strong>
 <code>LeetCode-Solutions/
 ├── easy/
 │   ├── [Problem ID]-problem-name.py
@@ -19,10 +19,12 @@ <h3>Repository Structure</h3>
 |
 └── README.md</code></p>
 <h2>Easy</h2>
-<p><a href="https://leetcode.com/problems/running-sum-of-1d-array/description/">Running Sum of 1d Array</a> - <a href="1480-running-sum-of-1-d-array.md">Solution</a>
-<a href="https://leetcode.com/problems/is-subsequence/description/">Is Subsequence</a> - <a href="392-is-subsequence.md">Solution</a>
-<a href="https://leetcode.com/problems/roman-to-integer/description/">Roman to Integer</a> - <a href="13-roman-to-integer.md">Solution</a>
-<a href="https://leetcode.com/problems/merge-strings-alternately/description/">Merge Strings Alternately</a> - <a href="1768-merge-strings-alternately.md">Solution</a>
-<a href="https://leetcode.com/problems/longest-common-prefix/description/">Longest Common Prefix</a> - <a href="14-longest-common-prefix.md">Solution</a>
-<a href="https://leetcode.com/problems/find-closest-number-to-zero/description/">Find Closest Number to Zero</a> - <a href="2239-find-closest-number-to-zero.md">Solution</a>
-<a href="https://leetcode.com/problems/number-of-steps-to-reduce-a-number-to-zero/description/">Number of Steps to Reduce a Number to Zero</a> - <a href="1342-number-of-steps-to-reduce-a-number-to-zero.md">Solution</a></p>
+<ul>
+<li><a href="https://leetcode.com/problems/running-sum-of-1d-array/description/">Running Sum of 1d Array</a> - <a href="1480-running-sum-of-1-d-array.md">Solution</a></li>
+<li><a href="https://leetcode.com/problems/is-subsequence/description/">Is Subsequence</a> - <a href="392-is-subsequence.md">Solution</a></li>
+<li><a href="https://leetcode.com/problems/roman-to-integer/description/">Roman to Integer</a> - <a href="13-roman-to-integer.md">Solution</a></li>
+<li><a href="https://leetcode.com/problems/merge-strings-alternately/description/">Merge Strings Alternately</a> - <a href="1768-merge-strings-alternately.md">Solution</a></li>
+<li><a href="https://leetcode.com/problems/longest-common-prefix/description/">Longest Common Prefix</a> - <a href="14-longest-common-prefix.md">Solution</a></li>
+<li><a href="https://leetcode.com/problems/find-closest-number-to-zero/description/">Find Closest Number to Zero</a> - <a href="2239-find-closest-number-to-zero.md">Solution</a></li>
+<li><a href="https://leetcode.com/problems/number-of-steps-to-reduce-a-number-to-zero/description/">Number of Steps to Reduce a Number to Zero</a> - <a href="1342-number-of-steps-to-reduce-a-number-to-zero.md">Solution</a></li>
+</ul>