From 775b43b58b0b4360f4850e1d86ffa070dbebacd7 Mon Sep 17 00:00:00 2001
From: juan <juancloudcomputing@protonmail.com>
Date: Thu, 14 Jul 2022 10:36:52 +0800
Subject: [PATCH] vault backup: 2022-07-14 10:36:52

---
 ...-Substring-Without-Repeating-Characters.md |  7 +--
 .../pages/Leetcode Permutation-In-String.md   | 58 +++++++++++++++++++
 OJ notes/pages/Leetcode.md                    |  0
 3 files changed, 60 insertions(+), 5 deletions(-)
 create mode 100644 OJ notes/pages/Leetcode Permutation-In-String.md
 delete mode 100644 OJ notes/pages/Leetcode.md

diff --git a/OJ notes/pages/Leetcode Longest-Substring-Without-Repeating-Characters.md b/OJ notes/pages/Leetcode Longest-Substring-Without-Repeating-Characters.md
index ceab974..605e31f 100644
--- a/OJ notes/pages/Leetcode Longest-Substring-Without-Repeating-Characters.md	
+++ b/OJ notes/pages/Leetcode Longest-Substring-Without-Repeating-Characters.md	
@@ -3,7 +3,7 @@
 #### 2022-07-14 09:33
 
 > ##### Algorithms:
-> #algorithm #Kadane_s_algorithm 
+> #algorithm #Kadane_s_algorithm  #sliding_window 
 > ##### Data structures:
 > #DS #string 
 > ##### Difficulty:
@@ -15,13 +15,10 @@
 
 ##### Related topics:
 ```expander
-tag:#Kadane_s_algorithm
+tag:#Kadane_s_algorithm  OR tag:#sliding_window 
 ```
 
 
-
-
-
 ##### Links:
 - [Link to problem](https://leetcode.com/problems/longest-substring-without-repeating-characters/)
 ___
diff --git a/OJ notes/pages/Leetcode Permutation-In-String.md b/OJ notes/pages/Leetcode Permutation-In-String.md
new file mode 100644
index 0000000..f8d4fce
--- /dev/null
+++ b/OJ notes/pages/Leetcode Permutation-In-String.md	
@@ -0,0 +1,58 @@
+# Leetcode Permutation-In-String
+
+#### 2022-07-14 10:29
+
+> ##### Algorithms:
+> #algorithm #sliding_window
+> ##### Data structures:
+> #DS #string
+> ##### Difficulty:
+> #coding_problem #difficulty-medium
+> ##### Additional tags:
+> #leetcode #CS_list_need_understanding 
+> ##### Revisions:
+> N/A
+
+##### Related topics:
+```expander
+tag:#sliding_window
+```
+
+
+##### Links:
+- [Link to problem](https://leetcode.com/problems/permutation-in-string/)
+___
+### Problem
+
+Given two strings `s1` and `s2`, return `true` _if_ `s2` _contains a permutation of_ `s1`_, or_ `false` _otherwise_.
+
+In other words, return `true` if one of `s1`'s permutations is the substring of `s2`.
+
+#### Examples
+
+**Example 1:**
+
+**Input:** s1 = "ab", s2 = "eidbaooo"
+**Output:** true
+**Explanation:** s2 contains one permutation of s1 ("ba").
+
+**Example 2:**
+
+**Input:** s1 = "ab", s2 = "eidboaoo"
+**Output:** false
+
+#### Constraints
+
+-   `1 <= s1.length, s2.length <= 104`
+-   `s1` and `s2` consist of lowercase English letters.
+
+### Thoughts
+
+> [!summary]
+> This is a #sliding_window problem.
+
+I tried to use kadane's algorithm, but the problem is a premature string, not set. So I gave up.
+
+
+
+### Solution
diff --git a/OJ notes/pages/Leetcode.md b/OJ notes/pages/Leetcode.md
deleted file mode 100644
index e69de29..0000000