chore: add LeetCode daily solution

Author: TechnoBlogger14o3

Easy/2026-05-03-796-Rotate-String/explanation.md

@@ -0,0 +1,25 @@
+# Rotate String (Easy)
+
+**Problem ID:** 796  
+**Date:** 2026-05-03  
+**Link:** https://leetcode.com/problems/rotate-string/
+
+## Approach
+
+To solve the "Rotate String" problem, the key idea is to leverage the properties of string rotations. Specifically, if string `s` can be transformed into string `goal` through a series of left shifts, then `goal` must appear as a substring within the concatenated string `s + s`. 
+
+### Approach:
+
+1. **Concatenation**: Create a new string by concatenating `s` with itself (i.e., `s + s`). This new string contains all possible rotations of `s` as contiguous substrings. For example, if `s = "abcde"`, then `s + s = "abcdeabcde"` will contain all rotations: "abcde", "bcdea", "cdeab", "deabc", and "eabcd".
+
+2. **Substring Check**: Check if `goal` is a substring of the concatenated string `s + s`. If it is, then `s` can be rotated to form `goal`, and we return `true`. If not, we return `false`.
+
+### Data Structures:
+- Strings are used to hold the input and the concatenated result. No additional complex data structures are necessary for this approach.
+
+### Complexity:
+- **Time Complexity**: The solution primarily involves string concatenation and substring searching. The concatenation takes O(n) time, where n is the length of `s`. The substring search can be done in O(n) time as well, resulting in an overall time complexity of O(n).
+- **Space Complexity**: The space complexity is O(n) due to the storage of the concatenated string `s + s`.
+
+### Summary:
+This approach is efficient and straightforward, utilizing the properties of string manipulation to determine if one string can be obtained from another through rotations. By checking for the presence of `goal` in the doubled string, we can quickly conclude whether the transformation is possible.

Easy/2026-05-03-796-Rotate-String/solution.java

@@ -0,0 +1,9 @@
+class Solution {
+    public boolean rotateString(String s, String goal) {
+        if (s.length() != goal.length()) {
+            return false;
+        }
+        String concatenated = s + s;
+        return concatenated.contains(goal);
+    }
+}

Easy/2026-05-03-796-Rotate-String/solution.js

@@ -0,0 +1,4 @@
+var rotateString = function(s, goal) {
+    if (s.length !== goal.length) return false;
+    return (s + s).includes(goal);
+};

Easy/2026-05-03-796-Rotate-String/solution.py

@@ -0,0 +1,5 @@
+class Solution:
+    def rotateString(self, s: str, goal: str) -> bool:
+        if len(s) != len(goal):
+            return False
+        return goal in (s + s)

README.md

@@ -442,3 +442,4 @@ Through completing the Blind 75 and NeetCode 150, you will have mastered:
 - 2026-04-30 — [Maximum Path Score in a Grid](https://leetcode.com/problems/maximum-path-score-in-a-grid/) (Medium) → `Medium/2026-04-30-3742-Maximum-Path-Score-in-a-Grid`
 - 2026-05-01 — [Rotate Function](https://leetcode.com/problems/rotate-function/) (Medium) → `Medium/2026-05-01-396-Rotate-Function`
 - 2026-05-02 — [Rotated Digits](https://leetcode.com/problems/rotated-digits/) (Medium) → `Medium/2026-05-02-788-Rotated-Digits`
+- 2026-05-03 — [Rotate String](https://leetcode.com/problems/rotate-string/) (Easy) → `Easy/2026-05-03-796-Rotate-String`