vault backup: 2022-09-05 19:34:12

.obsidian/appearance.json

@@ -1,5 +1,5 @@
 {
-  "theme": "moonstone",
+  "theme": "obsidian",
   "translucency": true,
   "cssTheme": "Prism",
   "interfaceFontFamily": "IBM Plex Sans",

OJ notes/pages/Leetcode Word-Pattern.md

@@ -0,0 +1,66 @@
+# Leetcode Word-Pattern
+
+2022-09-05 19:27
+
+> ##### Data structures:
+>
+> #DS #string
+>
+> ##### Difficulty:
+>
+> #coding_problem #difficulty-easy
+>
+> ##### Additional tags:
+>
+> #leetcode 
+>
+> ##### Revisions:
+>
+> N/A
+
+##### Links:
+
+- [Link to problem]()
+
+---
+
+### Problem
+
+Given a `pattern` and a string `s`, find if `s` follows the same pattern.
+
+Here **follow** means a full match, such that there is a bijection between a letter in `pattern` and a **non-empty** word in `s`.
+
+#### Examples
+
+**Example 1:**
+
+**Input:** pattern = "abba", s = "dog cat cat dog"
+**Output:** true
+
+**Example 2:**
+
+**Input:** pattern = "abba", s = "dog cat cat fish"
+**Output:** false
+
+**Example 3:**
+
+**Input:** pattern = "aaaa", s = "dog cat cat dog"
+**Output:** false
+
+#### Constraints
+
+-   `1 <= pattern.length <= 300`
+-   `pattern` contains only lower-case English letters.
+-   `1 <= s.length <= 3000`
+-   `s` contains only lowercase English letters and spaces `' '`.
+-   `s` **does not contain** any leading or trailing spaces.
+-   All the words in `s` are separated by a **single space**.
+
+### Thoughts
+
+> [!summary]
+> This is a #string operation problem.
+
+
+
+### Solution