diff --git a/index.css b/index.css index 5598a0c..356022d 100644 --- a/index.css +++ b/index.css @@ -11,7 +11,7 @@ body { font-size: 1.5em; background-color: #f9f5d7; margin: 100px auto; - max-width: 650px; + max-width: 675px; scroll-behavior: smooth; overscroll-behavior-y: none; overscroll-behavior-x: none; @@ -44,7 +44,7 @@ html { white-space: nowrap; overflow: hidden; width: 0; - transition: all 0.5s ease; + transition: all 0.6s ease; display: inline-block; vertical-align: top; max-width: 0; @@ -73,3 +73,9 @@ html { color: inherit; text-decoration: none; } + +pre code.hljs { + border: 1px solid #ccc; + box-shadow: 0 2px 5px rgba(0, 0, 0, 0.1); + padding: 20px; +} diff --git a/index.html b/index.html index 49b564d..7d4931f 100644 --- a/index.html +++ b/index.html @@ -4,11 +4,11 @@ + -
Trapping Raintwaters Leetcode Problem Description
-Example: Finding the maximum sum subarray of a fixed size.
-
- - The sliding window algorithm is widely used in software development for - solving optimization problems, especially when dealing with arrays or - lists. It's useful in scenarios where you need to track a subset of data - within a larger dataset efficiently, making it a crucial tool in fields - like data analysis, machine learning, and others. -
- +Description
+