diff --git a/README.md b/README.md
index 19499966..18c38b1b 100644
--- a/README.md
+++ b/README.md
@@ -1,4 +1,4 @@
-# **[LeetCode Records](https://leetcode.com/u/Zanger/)** (396 solved)
+# **[LeetCode Records](https://leetcode.com/u/Zanger/)** (400 solved)
 
 > My LeetCode Profile: [Zanger](https://leetcode.com/u/Zanger/)
 
@@ -28,7 +28,7 @@ This repo is a collection of my LeetCode solutions, primarily written in Python,
 
 ------
 
-[Array](<markdowns/by_topic/Array.md>), [Hash Table](<markdowns/by_topic/Hash Table.md>), [String](<markdowns/by_topic/String.md>), [Depth-First Search](<markdowns/by_topic/Depth-First Search.md>), [Tree](<markdowns/by_topic/Tree.md>), [Binary Tree](<markdowns/by_topic/Binary Tree.md>), [Sorting](<markdowns/by_topic/Sorting.md>), [Math](<markdowns/by_topic/Math.md>), [Breadth-First Search](<markdowns/by_topic/Breadth-First Search.md>), [Two Pointers](<markdowns/by_topic/Two Pointers.md>), [Linked List](<markdowns/by_topic/Linked List.md>), [Stack](<markdowns/by_topic/Stack.md>), [Greedy](<markdowns/by_topic/Greedy.md>), [Matrix](<markdowns/by_topic/Matrix.md>), [Simulation](<markdowns/by_topic/Simulation.md>), [Bit Manipulation](<markdowns/by_topic/Bit Manipulation.md>), [Design](<markdowns/by_topic/Design.md>), [Dynamic Programming](<markdowns/by_topic/Dynamic Programming.md>), [Database](<markdowns/by_topic/Database.md>), [Binary Search](<markdowns/by_topic/Binary Search.md>), [Trie](<markdowns/by_topic/Trie.md>), [Heap (Priority Queue)](<markdowns/by_topic/Heap (Priority Queue).md>), [Counting](<markdowns/by_topic/Counting.md>), [Recursion](<markdowns/by_topic/Recursion.md>), [Backtracking](<markdowns/by_topic/Backtracking.md>), [Binary Search Tree](<markdowns/by_topic/Binary Search Tree.md>), [Sliding Window](<markdowns/by_topic/Sliding Window.md>), [Prefix Sum](<markdowns/by_topic/Prefix Sum.md>), [Monotonic Stack](<markdowns/by_topic/Monotonic Stack.md>), [Queue](<markdowns/by_topic/Queue.md>), [Union Find](<markdowns/by_topic/Union Find.md>), [Divide and Conquer](<markdowns/by_topic/Divide and Conquer.md>), [String Matching](<markdowns/by_topic/String Matching.md>), [Graph](<markdowns/by_topic/Graph.md>), [Hash Function](<markdowns/by_topic/Hash Function.md>), [Combinatorics](<markdowns/by_topic/Combinatorics.md>), [Randomized](<markdowns/by_topic/Randomized.md>), [Monotonic Queue](<markdowns/by_topic/Monotonic Queue.md>), [Iterator](<markdowns/by_topic/Iterator.md>), [Bucket Sort](<markdowns/by_topic/Bucket Sort.md>), [Geometry](<markdowns/by_topic/Geometry.md>), [Counting Sort](<markdowns/by_topic/Counting Sort.md>), [Brainteaser](<markdowns/by_topic/Brainteaser.md>), [Game Theory](<markdowns/by_topic/Game Theory.md>), [Interactive](<markdowns/by_topic/Interactive.md>), [Memoization](<markdowns/by_topic/Memoization.md>), [Rolling Hash](<markdowns/by_topic/Rolling Hash.md>), [Quickselect](<markdowns/by_topic/Quickselect.md>), [Doubly-Linked List](<markdowns/by_topic/Doubly-Linked List.md>), [Data Stream](<markdowns/by_topic/Data Stream.md>), [Bitmask](<markdowns/by_topic/Bitmask.md>), [Merge Sort](<markdowns/by_topic/Merge Sort.md>), [Ordered Set](<markdowns/by_topic/Ordered Set.md>), [Suffix Array](<markdowns/by_topic/Suffix Array.md>), [Topological Sort](<markdowns/by_topic/Topological Sort.md>), [Shortest Path](<markdowns/by_topic/Shortest Path.md>), [Number Theory](<markdowns/by_topic/Number Theory.md>), [Reservoir Sampling](<markdowns/by_topic/Reservoir Sampling.md>)
+[Array](<markdowns/by_topic/Array.md>), [Hash Table](<markdowns/by_topic/Hash Table.md>), [String](<markdowns/by_topic/String.md>), [Depth-First Search](<markdowns/by_topic/Depth-First Search.md>), [Tree](<markdowns/by_topic/Tree.md>), [Binary Tree](<markdowns/by_topic/Binary Tree.md>), [Sorting](<markdowns/by_topic/Sorting.md>), [Math](<markdowns/by_topic/Math.md>), [Breadth-First Search](<markdowns/by_topic/Breadth-First Search.md>), [Two Pointers](<markdowns/by_topic/Two Pointers.md>), [Linked List](<markdowns/by_topic/Linked List.md>), [Stack](<markdowns/by_topic/Stack.md>), [Greedy](<markdowns/by_topic/Greedy.md>), [Matrix](<markdowns/by_topic/Matrix.md>), [Simulation](<markdowns/by_topic/Simulation.md>), [Design](<markdowns/by_topic/Design.md>), [Bit Manipulation](<markdowns/by_topic/Bit Manipulation.md>), [Dynamic Programming](<markdowns/by_topic/Dynamic Programming.md>), [Database](<markdowns/by_topic/Database.md>), [Binary Search](<markdowns/by_topic/Binary Search.md>), [Trie](<markdowns/by_topic/Trie.md>), [Heap (Priority Queue)](<markdowns/by_topic/Heap (Priority Queue).md>), [Counting](<markdowns/by_topic/Counting.md>), [Recursion](<markdowns/by_topic/Recursion.md>), [Backtracking](<markdowns/by_topic/Backtracking.md>), [Binary Search Tree](<markdowns/by_topic/Binary Search Tree.md>), [Sliding Window](<markdowns/by_topic/Sliding Window.md>), [Prefix Sum](<markdowns/by_topic/Prefix Sum.md>), [Queue](<markdowns/by_topic/Queue.md>), [Monotonic Stack](<markdowns/by_topic/Monotonic Stack.md>), [Union Find](<markdowns/by_topic/Union Find.md>), [Divide and Conquer](<markdowns/by_topic/Divide and Conquer.md>), [String Matching](<markdowns/by_topic/String Matching.md>), [Graph](<markdowns/by_topic/Graph.md>), [Hash Function](<markdowns/by_topic/Hash Function.md>), [Combinatorics](<markdowns/by_topic/Combinatorics.md>), [Randomized](<markdowns/by_topic/Randomized.md>), [Monotonic Queue](<markdowns/by_topic/Monotonic Queue.md>), [Doubly-Linked List](<markdowns/by_topic/Doubly-Linked List.md>), [Iterator](<markdowns/by_topic/Iterator.md>), [Bucket Sort](<markdowns/by_topic/Bucket Sort.md>), [Geometry](<markdowns/by_topic/Geometry.md>), [Counting Sort](<markdowns/by_topic/Counting Sort.md>), [Brainteaser](<markdowns/by_topic/Brainteaser.md>), [Game Theory](<markdowns/by_topic/Game Theory.md>), [Interactive](<markdowns/by_topic/Interactive.md>), [Memoization](<markdowns/by_topic/Memoization.md>), [Data Stream](<markdowns/by_topic/Data Stream.md>), [Rolling Hash](<markdowns/by_topic/Rolling Hash.md>), [Quickselect](<markdowns/by_topic/Quickselect.md>), [Bitmask](<markdowns/by_topic/Bitmask.md>), [Merge Sort](<markdowns/by_topic/Merge Sort.md>), [Ordered Set](<markdowns/by_topic/Ordered Set.md>), [Suffix Array](<markdowns/by_topic/Suffix Array.md>), [Topological Sort](<markdowns/by_topic/Topological Sort.md>), [Shortest Path](<markdowns/by_topic/Shortest Path.md>), [Number Theory](<markdowns/by_topic/Number Theory.md>), [Reservoir Sampling](<markdowns/by_topic/Reservoir Sampling.md>)
 
 ------
 
@@ -183,6 +183,7 @@ This repo is a collection of my LeetCode solutions, primarily written in Python,
 |  542 | [01 Matrix](<https://leetcode.com/problems/01-matrix>)                                                                                                                                   | Medium  |                | [solution](<markdowns/_542. 01 Matrix.md>)                                                                   | py                               |
 |  543 | [Diameter of Binary Tree](<https://leetcode.com/problems/diameter-of-binary-tree>)                                                                                                       | Easy    | N150           | [solution](<markdowns/_543. Diameter of Binary Tree.md>)                                                     | py, java, c                      |
 |  565 | [Array Nesting](<https://leetcode.com/problems/array-nesting>)                                                                                                                           | Medium  |                | [solution](<markdowns/_565. Array Nesting.md>)                                                               | py                               |
+|  567 | [Permutation in String](<https://leetcode.com/problems/permutation-in-string>)                                                                                                           | Medium  | N150           | [solution](<markdowns/_567. Permutation in String.md>)                                                       | py                               |
 |  572 | [Subtree of Another Tree](<https://leetcode.com/problems/subtree-of-another-tree>)                                                                                                       | Easy    | N150, B75      | [solution](<markdowns/_572. Subtree of Another Tree.md>)                                                     | py                               |
 |  577 | [Employee Bonus](<https://leetcode.com/problems/employee-bonus>)                                                                                                                         | Easy    |                | [solution](<markdowns/_577. Employee Bonus.md>)                                                              | sql                              |
 |  584 | [Find Customer Referee](<https://leetcode.com/problems/find-customer-referee>)                                                                                                           | Easy    |                | [solution](<markdowns/_584. Find Customer Referee.md>)                                                       | sql                              |
@@ -193,6 +194,7 @@ This repo is a collection of my LeetCode solutions, primarily written in Python,
 |  611 | [Valid Triangle Number](<https://leetcode.com/problems/valid-triangle-number>)                                                                                                           | Medium  |                | [solution](<markdowns/_611. Valid Triangle Number.md>)                                                       | py                               |
 |  616 | [Add Bold Tag in String](<https://leetcode.com/problems/add-bold-tag-in-string>)                                                                                                         | Medium  |                | [solution](<markdowns/_616. Add Bold Tag in String.md>)                                                      | py                               |
 |  619 | [Biggest Single Number](<https://leetcode.com/problems/biggest-single-number>)                                                                                                           | Easy    |                | [solution](<markdowns/_619. Biggest Single Number.md>)                                                       | sql                              |
+|  622 | [Design Circular Queue](<https://leetcode.com/problems/design-circular-queue>)                                                                                                           | Medium  |                | [solution](<markdowns/_622. Design Circular Queue.md>)                                                       | py                               |
 |  637 | [Average of Levels in Binary Tree](<https://leetcode.com/problems/average-of-levels-in-binary-tree>)                                                                                     | Easy    |                | [solution](<markdowns/_637. Average of Levels in Binary Tree.md>)                                            | py                               |
 |  645 | [Set Mismatch](<https://leetcode.com/problems/set-mismatch>)                                                                                                                             | Easy    |                | [solution](<markdowns/_645. Set Mismatch.md>)                                                                | py, java                         |
 |  647 | [Palindromic Substrings](<https://leetcode.com/problems/palindromic-substrings>)                                                                                                         | Medium  | N150, B75      | [solution](<markdowns/_647. Palindromic Substrings.md>)                                                      | py                               |
@@ -287,6 +289,7 @@ This repo is a collection of my LeetCode solutions, primarily written in Python,
 | 1317 | [Convert Integer to the Sum of Two No-Zero Integers](<https://leetcode.com/problems/convert-integer-to-the-sum-of-two-no-zero-integers>)                                                 | Easy    |                | [solution](<markdowns/_1317. Convert Integer to the Sum of Two No-Zero Integers.md>)                         | c                                |
 | 1351 | [Count Negative Numbers in a Sorted Matrix](<https://leetcode.com/problems/count-negative-numbers-in-a-sorted-matrix>)                                                                   | Easy    |                | [solution](<markdowns/_1351. Count Negative Numbers in a Sorted Matrix.md>)                                  | py, java                         |
 | 1372 | [Longest ZigZag Path in a Binary Tree](<https://leetcode.com/problems/longest-zigzag-path-in-a-binary-tree>)                                                                             | Medium  |                | [solution](<markdowns/_1372. Longest ZigZag Path in a Binary Tree.md>)                                       | py                               |
+| 1381 | [Design a Stack With Increment Operation](<https://leetcode.com/problems/design-a-stack-with-increment-operation>)                                                                       | Medium  |                | [solution](<markdowns/_1381. Design a Stack With Increment Operation.md>)                                    | py                               |
 | 1382 | [Balance a Binary Search Tree](<https://leetcode.com/problems/balance-a-binary-search-tree>)                                                                                             | Medium  | Daily          | [solution](<markdowns/_1382. Balance a Binary Search Tree.md>)                                               | py                               |
 | 1404 | [Number of Steps to Reduce a Number in Binary Representation to One](<https://leetcode.com/problems/number-of-steps-to-reduce-a-number-in-binary-representation-to-one>)                 | Medium  | Daily          | [solution](<markdowns/_1404. Number of Steps to Reduce a Number in Binary Representation to One.md>)         | py                               |
 | 1426 | [Counting Elements](<https://leetcode.com/problems/counting-elements>)                                                                                                                   | Easy    |                | [solution](<markdowns/_1426. Counting Elements.md>)                                                          | c                                |
@@ -298,6 +301,7 @@ This repo is a collection of my LeetCode solutions, primarily written in Python,
 | 1457 | [Pseudo-Palindromic Paths in a Binary Tree](<https://leetcode.com/problems/pseudo-palindromic-paths-in-a-binary-tree>)                                                                   | Medium  |                | [solution](<markdowns/_1457. Pseudo-Palindromic Paths in a Binary Tree.md>)                                  | py                               |
 | 1460 | [Make Two Arrays Equal by Reversing Subarrays](<https://leetcode.com/problems/make-two-arrays-equal-by-reversing-subarrays>)                                                             | Easy    |                | [solution](<markdowns/_1460. Make Two Arrays Equal by Reversing Subarrays.md>)                               | c                                |
 | 1470 | [Shuffle the Array](<https://leetcode.com/problems/shuffle-the-array>)                                                                                                                   | Easy    |                | [solution](<markdowns/_1470. Shuffle the Array.md>)                                                          | c                                |
+| 1472 | [Design Browser History](<https://leetcode.com/problems/design-browser-history>)                                                                                                         | Medium  |                | [solution](<markdowns/_1472. Design Browser History.md>)                                                     | py                               |
 | 1474 | [Delete N Nodes After M Nodes of a Linked List](<https://leetcode.com/problems/delete-n-nodes-after-m-nodes-of-a-linked-list>)                                                           | Easy    |                | [solution](<markdowns/_1474. Delete N Nodes After M Nodes of a Linked List.md>)                              | java, c                          |
 | 1481 | [Least Number of Unique Integers after K Removals](<https://leetcode.com/problems/least-number-of-unique-integers-after-k-removals>)                                                     | Medium  |                | [solution](<markdowns/_1481. Least Number of Unique Integers after K Removals.md>)                           | py                               |
 | 1482 | [Minimum Number of Days to Make m Bouquets](<https://leetcode.com/problems/minimum-number-of-days-to-make-m-bouquets>)                                                                   | Medium  |                | [solution](<markdowns/_1482. Minimum Number of Days to Make m Bouquets.md>)                                  | py                               |
diff --git a/markdowns/Questions_By_Code_Length.md b/markdowns/Questions_By_Code_Length.md
index c169180d..79bdd060 100644
--- a/markdowns/Questions_By_Code_Length.md
+++ b/markdowns/Questions_By_Code_Length.md
@@ -108,6 +108,7 @@ Calculations are based on the code files's byte sizes.
 |  771 | [Jewels and Stones](<https://leetcode.com/problems/jewels-and-stones>)                                                                                                                   | Easy    |                | [solution](<_771. Jewels and Stones.md>)                                                           | py, java                         | Jun 02, 2024    |
 |  863 | [All Nodes Distance K in Binary Tree](<https://leetcode.com/problems/all-nodes-distance-k-in-binary-tree>)                                                                               | Medium  |                | [solution](<_863. All Nodes Distance K in Binary Tree.md>)                                         | py                               | Jun 26, 2024    |
 | 1122 | [Relative Sort Array](<https://leetcode.com/problems/relative-sort-array>)                                                                                                               | Easy    | Daily          | [solution](<_1122. Relative Sort Array.md>)                                                        | py, java                         | Jun 10, 2024    |
+|  567 | [Permutation in String](<https://leetcode.com/problems/permutation-in-string>)                                                                                                           | Medium  | N150           | [solution](<_567. Permutation in String.md>)                                                       | py                               | Jul 05, 2024    |
 | 1209 | [Remove All Adjacent Duplicates in String II](<https://leetcode.com/problems/remove-all-adjacent-duplicates-in-string-ii>)                                                               | Medium  |                | [solution](<_1209. Remove All Adjacent Duplicates in String II.md>)                                | py                               | Jun 17, 2024    |
 | 1171 | [Remove Zero Sum Consecutive Nodes from Linked List](<https://leetcode.com/problems/remove-zero-sum-consecutive-nodes-from-linked-list>)                                                 | Medium  |                | [solution](<_1171. Remove Zero Sum Consecutive Nodes from Linked List.md>)                         | py                               | Jun 15, 2024    |
 |  791 | [Custom Sort String](<https://leetcode.com/problems/custom-sort-string>)                                                                                                                 | Medium  |                | [solution](<_791. Custom Sort String.md>)                                                          | java                             | Jun 24, 2024    |
@@ -120,6 +121,7 @@ Calculations are based on the code files's byte sizes.
 |  919 | [Complete Binary Tree Inserter](<https://leetcode.com/problems/complete-binary-tree-inserter>)                                                                                           | Medium  |                | [solution](<_919. Complete Binary Tree Inserter.md>)                                               | py                               | Jul 05, 2024    |
 |  271 | [Encode and Decode Strings](<https://leetcode.com/problems/encode-and-decode-strings>)                                                                                                   | Medium  | N150, B75      | [solution](<_271. Encode and Decode Strings.md>)                                                   | py                               | Jun 12, 2024    |
 |   24 | [Swap Nodes in Pairs](<https://leetcode.com/problems/swap-nodes-in-pairs>)                                                                                                               | Medium  |                | [solution](<_24. Swap Nodes in Pairs.md>)                                                          | c                                | Jun 06, 2024    |
+|  622 | [Design Circular Queue](<https://leetcode.com/problems/design-circular-queue>)                                                                                                           | Medium  |                | [solution](<_622. Design Circular Queue.md>)                                                       | py                               | Jul 05, 2024    |
 |    1 | [Two Sum](<https://leetcode.com/problems/two-sum>)                                                                                                                                       | Easy    | N150, B75      | [solution](<_1. Two Sum.md>)                                                                       | py, java                         | May 22, 2024    |
 | 1268 | [Search Suggestions System](<https://leetcode.com/problems/search-suggestions-system>)                                                                                                   | Medium  |                | [solution](<_1268. Search Suggestions System.md>)                                                  | py                               | Jun 28, 2024    |
 |   20 | [Valid Parentheses](<https://leetcode.com/problems/valid-parentheses>)                                                                                                                   | Easy    | N150, B75      | [solution](<_20. Valid Parentheses.md>)                                                            | java                             | May 22, 2024    |
@@ -236,6 +238,7 @@ Calculations are based on the code files's byte sizes.
 |  807 | [Max Increase to Keep City Skyline](<https://leetcode.com/problems/max-increase-to-keep-city-skyline>)                                                                                   | Medium  |                | [solution](<_807. Max Increase to Keep City Skyline.md>)                                           | java                             | Jun 22, 2024    |
 | 3174 | bw contest 132 - q1                                                                                                                                                                      | Easy    | Contest        | [solution](<_3174. bw contest 132 - q.md>)                                                         | py                               | Jun 08, 2024    |
 |   49 | [Group Anagrams](<https://leetcode.com/problems/group-anagrams>)                                                                                                                         | Medium  | N150, B75      | [solution](<_49. Group Anagrams.md>)                                                               | py                               | Jun 12, 2024    |
+| 1472 | [Design Browser History](<https://leetcode.com/problems/design-browser-history>)                                                                                                         | Medium  |                | [solution](<_1472. Design Browser History.md>)                                                     | py                               | Jul 05, 2024    |
 |  720 | [Longest Word in Dictionary](<https://leetcode.com/problems/longest-word-in-dictionary>)                                                                                                 | Medium  |                | [solution](<_720. Longest Word in Dictionary.md>)                                                  | py                               | Jun 27, 2024    |
 | 1858 | [Longest Word With All Prefixes](<https://leetcode.com/problems/longest-word-with-all-prefixes>)                                                                                         | Medium  |                | [solution](<_1858. Longest Word With All Prefixes.md>)                                             | py                               | Jun 29, 2024    |
 | 1455 | [Check If a Word Occurs As a Prefix of Any Word in a Sentence](<https://leetcode.com/problems/check-if-a-word-occurs-as-a-prefix-of-any-word-in-a-sentence>)                             | Easy    |                | [solution](<_1455. Check If a Word Occurs As a Prefix of Any Word in a Sentence.md>)               | py                               | Jun 01, 2024    |
@@ -288,6 +291,7 @@ Calculations are based on the code files's byte sizes.
 | 1669 | [Merge In Between Linked Lists](<https://leetcode.com/problems/merge-in-between-linked-lists>)                                                                                           | Medium  |                | [solution](<_1669. Merge In Between Linked Lists.md>)                                              | c                                | Jun 24, 2024    |
 |   14 | [Longest Common Prefix](<https://leetcode.com/problems/longest-common-prefix>)                                                                                                           | Easy    |                | [solution](<_14. Longest Common Prefix.md>)                                                        | java                             | May 22, 2024    |
 | 3043 | [Find the Length of the Longest Common Prefix](<https://leetcode.com/problems/find-the-length-of-the-longest-common-prefix>)                                                             | Medium  |                | [solution](<_3043. Find the Length of the Longest Common Prefix.md>)                               | py                               | Jun 27, 2024    |
+| 1381 | [Design a Stack With Increment Operation](<https://leetcode.com/problems/design-a-stack-with-increment-operation>)                                                                       | Medium  |                | [solution](<_1381. Design a Stack With Increment Operation.md>)                                    | py                               | Jul 05, 2024    |
 | 1002 | [Find Common Characters](<https://leetcode.com/problems/find-common-characters>)                                                                                                         | Easy    | Daily          | [solution](<_1002. Find Common Characters.md>)                                                     | py                               | Jun 04, 2024    |
 |  206 | [Reverse Linked List](<https://leetcode.com/problems/reverse-linked-list>)                                                                                                               | Easy    | N150, B75      | [solution](<_206. Reverse Linked List.md>)                                                         | java                             | Jun 27, 2024    |
 | 2083 | [Substrings That Begin and End With the Same Letter](<https://leetcode.com/problems/substrings-that-begin-and-end-with-the-same-letter>)                                                 | Medium  | Weekly Premium | [solution](<_2083. Substrings That Begin and End With the Same Letter.md>)                         | py, c                            | Jun 10, 2024    |
diff --git a/markdowns/Questions_By_Recent.md b/markdowns/Questions_By_Recent.md
index e60dc220..a4a75c1c 100644
--- a/markdowns/Questions_By_Recent.md
+++ b/markdowns/Questions_By_Recent.md
@@ -6,6 +6,10 @@ Calculations are based on the date of the first solve.
 
 |    # | Title                                                                                                                                                                                    | Level   | Cats           | Solution                                                                                           | Languages                        | Date Complete   |
 |-----:|:-----------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|:--------|:---------------|:---------------------------------------------------------------------------------------------------|:---------------------------------|:----------------|
+| 1381 | [Design a Stack With Increment Operation](<https://leetcode.com/problems/design-a-stack-with-increment-operation>)                                                                       | Medium  |                | [solution](<_1381. Design a Stack With Increment Operation.md>)                                    | py                               | Jul 05, 2024    |
+| 1472 | [Design Browser History](<https://leetcode.com/problems/design-browser-history>)                                                                                                         | Medium  |                | [solution](<_1472. Design Browser History.md>)                                                     | py                               | Jul 05, 2024    |
+|  622 | [Design Circular Queue](<https://leetcode.com/problems/design-circular-queue>)                                                                                                           | Medium  |                | [solution](<_622. Design Circular Queue.md>)                                                       | py                               | Jul 05, 2024    |
+|  567 | [Permutation in String](<https://leetcode.com/problems/permutation-in-string>)                                                                                                           | Medium  | N150           | [solution](<_567. Permutation in String.md>)                                                       | py                               | Jul 05, 2024    |
 |  380 | [Insert Delete GetRandom O(1)](<https://leetcode.com/problems/insert-delete-getrandom-o1>)                                                                                               | Medium  |                | [solution](<_380. Insert Delete GetRandom O(1).md>)                                                | java                             | Jul 05, 2024    |
 |  381 | [Insert Delete GetRandom O(1) - Duplicates allowed](<https://leetcode.com/problems/insert-delete-getrandom-o1-duplicates-allowed>)                                                       | Hard    |                | [solution](<_381. Insert Delete GetRandom O(1) - Duplicates allowed.md>)                           | java                             | Jul 05, 2024    |
 | 2582 | [Pass the Pillow](<https://leetcode.com/problems/pass-the-pillow>)                                                                                                                       | Easy    | Daily          | [solution](<_2582. Pass the Pillow.md>)                                                            | py, java, cs, js, cpp, c         | Jul 05, 2024    |
diff --git a/markdowns/Topics.md b/markdowns/Topics.md
index a87620bd..4a0ab54b 100644
--- a/markdowns/Topics.md
+++ b/markdowns/Topics.md
@@ -4,23 +4,23 @@
 
 ------
 
-- [Array](<by_topic/Array.md>) (178 completed)
-- [Hash Table](<by_topic/Hash Table.md>) (88 completed)
-- [String](<by_topic/String.md>) (87 completed)
+- [Array](<by_topic/Array.md>) (181 completed)
+- [Hash Table](<by_topic/Hash Table.md>) (89 completed)
+- [String](<by_topic/String.md>) (88 completed)
 - [Depth-First Search](<by_topic/Depth-First Search.md>) (68 completed)
 - [Tree](<by_topic/Tree.md>) (66 completed)
 - [Binary Tree](<by_topic/Binary Tree.md>) (61 completed)
 - [Sorting](<by_topic/Sorting.md>) (55 completed)
 - [Math](<by_topic/Math.md>) (49 completed)
 - [Breadth-First Search](<by_topic/Breadth-First Search.md>) (47 completed)
-- [Two Pointers](<by_topic/Two Pointers.md>) (43 completed)
-- [Linked List](<by_topic/Linked List.md>) (38 completed)
-- [Stack](<by_topic/Stack.md>) (35 completed)
+- [Two Pointers](<by_topic/Two Pointers.md>) (44 completed)
+- [Linked List](<by_topic/Linked List.md>) (40 completed)
+- [Stack](<by_topic/Stack.md>) (37 completed)
 - [Greedy](<by_topic/Greedy.md>) (31 completed)
 - [Matrix](<by_topic/Matrix.md>) (30 completed)
 - [Simulation](<by_topic/Simulation.md>) (26 completed)
+- [Design](<by_topic/Design.md>) (25 completed)
 - [Bit Manipulation](<by_topic/Bit Manipulation.md>) (24 completed)
-- [Design](<by_topic/Design.md>) (22 completed)
 - [Dynamic Programming](<by_topic/Dynamic Programming.md>) (20 completed)
 - [Database](<by_topic/Database.md>) (18 completed)
 - [Binary Search](<by_topic/Binary Search.md>) (18 completed)
@@ -30,10 +30,10 @@
 - [Recursion](<by_topic/Recursion.md>) (14 completed)
 - [Backtracking](<by_topic/Backtracking.md>) (13 completed)
 - [Binary Search Tree](<by_topic/Binary Search Tree.md>) (13 completed)
-- [Sliding Window](<by_topic/Sliding Window.md>) (11 completed)
+- [Sliding Window](<by_topic/Sliding Window.md>) (12 completed)
 - [Prefix Sum](<by_topic/Prefix Sum.md>) (10 completed)
+- [Queue](<by_topic/Queue.md>) (9 completed)
 - [Monotonic Stack](<by_topic/Monotonic Stack.md>) (9 completed)
-- [Queue](<by_topic/Queue.md>) (8 completed)
 - [Union Find](<by_topic/Union Find.md>) (8 completed)
 - [Divide and Conquer](<by_topic/Divide and Conquer.md>) (6 completed)
 - [String Matching](<by_topic/String Matching.md>) (6 completed)
@@ -42,6 +42,7 @@
 - [Combinatorics](<by_topic/Combinatorics.md>) (4 completed)
 - [Randomized](<by_topic/Randomized.md>) (4 completed)
 - [Monotonic Queue](<by_topic/Monotonic Queue.md>) (3 completed)
+- [Doubly-Linked List](<by_topic/Doubly-Linked List.md>) (3 completed)
 - [Iterator](<by_topic/Iterator.md>) (3 completed)
 - [Bucket Sort](<by_topic/Bucket Sort.md>) (3 completed)
 - [Geometry](<by_topic/Geometry.md>) (2 completed)
@@ -50,10 +51,9 @@
 - [Game Theory](<by_topic/Game Theory.md>) (2 completed)
 - [Interactive](<by_topic/Interactive.md>) (2 completed)
 - [Memoization](<by_topic/Memoization.md>) (2 completed)
+- [Data Stream](<by_topic/Data Stream.md>) (2 completed)
 - [Rolling Hash](<by_topic/Rolling Hash.md>) (2 completed)
 - [Quickselect](<by_topic/Quickselect.md>) (2 completed)
-- [Doubly-Linked List](<by_topic/Doubly-Linked List.md>) (2 completed)
-- [Data Stream](<by_topic/Data Stream.md>) (1 completed)
 - [Bitmask](<by_topic/Bitmask.md>) (1 completed)
 - [Merge Sort](<by_topic/Merge Sort.md>) (1 completed)
 - [Ordered Set](<by_topic/Ordered Set.md>) (1 completed)
diff --git a/markdowns/_1381. Design a Stack With Increment Operation.md b/markdowns/_1381. Design a Stack With Increment Operation.md
new file mode 100644
index 00000000..98fcb064
--- /dev/null
+++ b/markdowns/_1381. Design a Stack With Increment Operation.md	
@@ -0,0 +1,62 @@
+# 1381. [Design a Stack With Increment Operation](<https://leetcode.com/problems/design-a-stack-with-increment-operation>)
+
+*[Back to top](<../README.md>)*
+
+------
+
+> *First completed : July 05, 2024*
+>
+> *Last updated : July 05, 2024*
+
+
+------
+
+> **Related Topics** : **[Array](<by_topic/Array.md>), [Stack](<by_topic/Stack.md>), [Design](<by_topic/Design.md>)**
+>
+> **Acceptance Rate** : **77.091 %**
+
+
+------
+
+*To see the question prompt, click the title.*
+
+> ## This question has the honour of being my 400th question on LeetCode.
+> 
+> **On Day 39 of my grind, 8:35PM PST, this question was done. Simple one to end off this sprint. :)**
+
+------
+
+## Solutions
+
+- [m1381.py](<../my-submissions/m1381.py>)
+### Python
+#### [m1381.py](<../my-submissions/m1381.py>)
+```Python
+class CustomStack:
+
+    def __init__(self, maxSize: int):
+        self.stk = []
+        self.maxx = maxSize
+
+    def push(self, x: int) -> None:
+        if len(self.stk) >= self.maxx :
+            return
+        self.stk.append(x)
+
+    def pop(self) -> int:
+        if not self.stk :
+            return -1
+        return self.stk.pop()
+
+    def increment(self, k: int, val: int) -> None:
+        for i in range(min(k, len(self.stk))) :
+            self.stk[i] += val
+
+
+# Your CustomStack object will be instantiated and called as such:
+# obj = CustomStack(maxSize)
+# obj.push(x)
+# param_2 = obj.pop()
+# obj.increment(k,val)
+```
+
diff --git a/markdowns/_1472. Design Browser History.md b/markdowns/_1472. Design Browser History.md
new file mode 100644
index 00000000..a3b83a36
--- /dev/null
+++ b/markdowns/_1472. Design Browser History.md	
@@ -0,0 +1,56 @@
+# 1472. [Design Browser History](<https://leetcode.com/problems/design-browser-history>)
+
+*[Back to top](<../README.md>)*
+
+------
+
+> *First completed : July 05, 2024*
+>
+> *Last updated : July 05, 2024*
+
+
+------
+
+> **Related Topics** : **[Array](<by_topic/Array.md>), [Linked List](<by_topic/Linked List.md>), [Stack](<by_topic/Stack.md>), [Design](<by_topic/Design.md>), [Doubly-Linked List](<by_topic/Doubly-Linked List.md>), [Data Stream](<by_topic/Data Stream.md>)**
+>
+> **Acceptance Rate** : **77.568 %**
+
+
+------
+
+*To see the question prompt, click the title.*
+
+## Solutions
+
+- [m1472.py](<../my-submissions/m1472.py>)
+### Python
+#### [m1472.py](<../my-submissions/m1472.py>)
+```Python
+class BrowserHistory:
+
+    def __init__(self, homepage: str):
+        self.history = [homepage]
+        self.spot = 0
+
+    def visit(self, url: str) -> None:
+        self.spot += 1
+        if self.spot < len(self.history) :
+            self.history = self.history[:self.spot]
+        self.history.append(url)
+
+    def back(self, steps: int) -> str:
+        self.spot = max(0, self.spot - steps)
+        return self.history[self.spot]
+
+    def forward(self, steps: int) -> str:
+        self.spot = min(len(self.history) - 1, self.spot + steps)
+        return self.history[self.spot]
+
+
+# Your BrowserHistory object will be instantiated and called as such:
+# obj = BrowserHistory(homepage)
+# obj.visit(url)
+# param_2 = obj.back(steps)
+# param_3 = obj.forward(steps)
+```
+
diff --git a/markdowns/_567. Permutation in String.md b/markdowns/_567. Permutation in String.md
new file mode 100644
index 00000000..eb316a4d
--- /dev/null
+++ b/markdowns/_567. Permutation in String.md	
@@ -0,0 +1,124 @@
+# 567. [Permutation in String](<https://leetcode.com/problems/permutation-in-string>)
+
+*[Back to top](<../README.md>)*
+
+------
+
+> *First completed : July 05, 2024*
+>
+> *Last updated : July 05, 2024*
+
+
+------
+
+> **Related Topics** : **[Hash Table](<by_topic/Hash Table.md>), [Two Pointers](<by_topic/Two Pointers.md>), [String](<by_topic/String.md>), [Sliding Window](<by_topic/Sliding Window.md>)**
+>
+> **Acceptance Rate** : **44.454 %**
+
+
+------
+
+*To see the question prompt, click the title.*
+
+> 
+> #### Version 1
+> 
+> In version 1, I just went with a straightforward counter approach. 
+> Since `Python` `Counter` objects have a built-in comparing method, 
+> I decided to simply use that. It's still technically $O(n)$ in total 
+> since the counter size will be at most 26 (since it's only counting) 
+> letters, but it's still less than ideal.
+> 
+> #### Version 2
+> 
+> In version 2, I swapped over to, while still using a counter, only 
+> committing a comparison for the values that are being updated. That is,
+> the values at the front of the window being added and the values
+> are the end of the window that are being dropped. We have to find a case 
+> where all values line up, so we iterate initially for the first `len(s1)` 
+> letters then proceed with only incremental updates from that point onwards.
+> 
+> 
+> #### Fun Testcase
+> 
+> When creating version 2, I encountered a very fun test case:
+> ```
+> s1 = "trinitrophenylmethylnitramine"
+> s2 = "dinitrophenylhydrazinetrinitrophenylmethylnitramine"
+> ```
+> Clearly, `s1` matches the ending of `s2` exactly, but my original 
+> code for version 2 (the incomplete `v2`) was resulting in `False`. 
+> Eventually, I realized that the cause was that during addings and 
+> subtractions of the same letter, it would **cause match to increment by 2** 
+> due to the the "new values" equallying the expected values in `s1`'s counter. 
+> This would only happen when the values where originally the correct 
+> value when it occured.
+> 
+> I added the `if cL == cR : continue` check and that was resolved quickly 
+> (as a if the previous wasn't a solution and didn't return, then this clearly 
+> wouldn't be a solution either since it's equal in the letter counts).
+
+------
+
+## Solutions
+
+- [m567 v1 Counter Equivalence.py](<../my-submissions/m567 v1 Counter Equivalence.py>)
+- [m567 v2 Running Counter.py](<../my-submissions/m567 v2 Running Counter.py>)
+### Python
+#### [m567 v1 Counter Equivalence.py](<../my-submissions/m567 v1 Counter Equivalence.py>)
+```Python
+class Solution:
+    def checkInclusion(self, s1: str, s2: str) -> bool:
+        cnt1 = Counter(s1)
+        cnt2 = Counter(s2[:len(s1) - 1])
+
+        for cL, cR in zip(s2, s2[len(s1) - 1 : len(s2)]) :
+            cnt2[cR] += 1
+            if cnt1 == cnt2 :
+                return True
+            cnt2[cL] -= 1
+
+        return False
+```
+
+#### [m567 v2 Running Counter.py](<../my-submissions/m567 v2 Running Counter.py>)
+```Python
+class Solution:
+    def checkInclusion(self, s1: str, s2: str) -> bool:
+        cnt1 = [0] * 26
+        cnt2 = [0] * 26
+
+        if len(s1) > len(s2) :
+            return False
+
+        for c1, c2 in zip(s1, s2) :
+            cnt1[ord(c1) - ord('a')] += 1
+            cnt2[ord(c2) - ord('a')] += 1
+
+        matches = [cnt1[x] == cnt2[x] for x in range(len(cnt1))].count(True)
+
+        if matches == 26 :
+            return True
+        for cL, cR in zip(s2, s2[len(s1):]) :
+            cnt2[ord(cL) - ord('a')] -= 1
+            cnt2[ord(cR) - ord('a')] += 1
+
+            if cL == cR :
+                continue
+
+            if cnt2[ord(cR) - ord('a')] == cnt1[ord(cR) - ord('a')] :
+                matches += 1
+            elif cnt2[ord(cR) - ord('a')] == cnt1[ord(cR) - ord('a')] + 1 :
+                matches -= 1
+
+            if cnt2[ord(cL) - ord('a')] == cnt1[ord(cL) - ord('a')] :
+                matches += 1
+            elif cnt2[ord(cL) - ord('a')] == cnt1[ord(cL) - ord('a')] - 1 :
+                matches -= 1
+
+            if matches == 26 :
+                return True
+
+        return False
+```
+
diff --git a/markdowns/_622. Design Circular Queue.md b/markdowns/_622. Design Circular Queue.md
new file mode 100644
index 00000000..03c6e82a
--- /dev/null
+++ b/markdowns/_622. Design Circular Queue.md	
@@ -0,0 +1,82 @@
+# 622. [Design Circular Queue](<https://leetcode.com/problems/design-circular-queue>)
+
+*[Back to top](<../README.md>)*
+
+------
+
+> *First completed : July 05, 2024*
+>
+> *Last updated : July 05, 2024*
+
+
+------
+
+> **Related Topics** : **[Array](<by_topic/Array.md>), [Linked List](<by_topic/Linked List.md>), [Design](<by_topic/Design.md>), [Queue](<by_topic/Queue.md>)**
+>
+> **Acceptance Rate** : **51.504 %**
+
+
+------
+
+*To see the question prompt, click the title.*
+
+## Solutions
+
+- [m622.py](<../my-submissions/m622.py>)
+### Python
+#### [m622.py](<../my-submissions/m622.py>)
+```Python
+class MyCircularQueue:
+
+    def __init__(self, k: int):
+        self.vals = [0] * k
+        self.size = 0
+        self.pop = 0
+        self.add = 0
+        self.k = k
+
+    def enQueue(self, value: int) -> bool:
+        if self.size >= self.k :
+            return False
+        if self.size == 0 :
+            self.pop = 0
+            self.add = 0
+            self.vals[0] = value
+        else :
+            self.add = (self.add + 1) % self.k
+            self.vals[self.add] = value
+        self.size += 1
+        return True
+        
+    def deQueue(self) -> bool:
+        if self.isEmpty() :
+            return False
+
+        if self.pop != self.add :
+            self.pop = (self.pop + 1) % self.k
+        self.size -= 1
+        return True
+
+    def Front(self) -> int:
+        return self.vals[self.pop] if self.size > 0 else -1
+
+    def Rear(self) -> int:
+        return self.vals[self.add] if self.size > 0 else -1
+        
+    def isEmpty(self) -> bool:
+        return self.size == 0
+
+    def isFull(self) -> bool:
+        return self.size == self.k
+
+
+# Your MyCircularQueue object will be instantiated and called as such:
+# obj = MyCircularQueue(k)
+# param_1 = obj.enQueue(value)
+# param_2 = obj.deQueue()
+# param_3 = obj.Front()
+# param_4 = obj.Rear()
+# param_5 = obj.isEmpty()
+# param_6 = obj.isFull()
+```
+
diff --git a/markdowns/by_topic/Array.md b/markdowns/by_topic/Array.md
index 2fabcbec..8a6a54ad 100644
--- a/markdowns/by_topic/Array.md
+++ b/markdowns/by_topic/Array.md
@@ -1,4 +1,4 @@
-# [Array](<https://leetcode.com/tag/Array/>) (178 completed)
+# [Array](<https://leetcode.com/tag/Array/>) (181 completed)
 
 *[Back to top](<../../README.md>)*
 
@@ -58,6 +58,7 @@
 |  565 | [Array Nesting](<https://leetcode.com/problems/array-nesting>)                                                                                                                           | Medium  |                | [solution](<../_565. Array Nesting.md>)                                                               | py               | Jul 02, 2024    |
 |  611 | [Valid Triangle Number](<https://leetcode.com/problems/valid-triangle-number>)                                                                                                           | Medium  |                | [solution](<../_611. Valid Triangle Number.md>)                                                       | py               | May 22, 2024    |
 |  616 | [Add Bold Tag in String](<https://leetcode.com/problems/add-bold-tag-in-string>)                                                                                                         | Medium  |                | [solution](<../_616. Add Bold Tag in String.md>)                                                      | py               | Jun 27, 2024    |
+|  622 | [Design Circular Queue](<https://leetcode.com/problems/design-circular-queue>)                                                                                                           | Medium  |                | [solution](<../_622. Design Circular Queue.md>)                                                       | py               | Jul 05, 2024    |
 |  645 | [Set Mismatch](<https://leetcode.com/problems/set-mismatch>)                                                                                                                             | Easy    |                | [solution](<../_645. Set Mismatch.md>)                                                                | py, java         | Jun 01, 2024    |
 |  648 | [Replace Words](<https://leetcode.com/problems/replace-words>)                                                                                                                           | Medium  | Daily          | [solution](<../_648. Replace Words.md>)                                                               | py, java         | Jun 06, 2024    |
 |  654 | [Maximum Binary Tree](<https://leetcode.com/problems/maximum-binary-tree>)                                                                                                               | Medium  |                | [solution](<../_654. Maximum Binary Tree.md>)                                                         | py               | Jun 11, 2024    |
@@ -115,12 +116,14 @@
 | 1282 | [Group the People Given the Group Size They Belong To](<https://leetcode.com/problems/group-the-people-given-the-group-size-they-belong-to>)                                             | Medium  |                | [solution](<../_1282. Group the People Given the Group Size They Belong To.md>)                       | py               | Jun 27, 2024    |
 | 1284 | [Minimum Number of Flips to Convert Binary Matrix to Zero Matrix](<https://leetcode.com/problems/minimum-number-of-flips-to-convert-binary-matrix-to-zero-matrix>)                       | Hard    |                | [solution](<../_1284. Minimum Number of Flips to Convert Binary Matrix to Zero Matrix.md>)            | py               | Jun 08, 2024    |
 | 1351 | [Count Negative Numbers in a Sorted Matrix](<https://leetcode.com/problems/count-negative-numbers-in-a-sorted-matrix>)                                                                   | Easy    |                | [solution](<../_1351. Count Negative Numbers in a Sorted Matrix.md>)                                  | py, java         | Jun 01, 2024    |
+| 1381 | [Design a Stack With Increment Operation](<https://leetcode.com/problems/design-a-stack-with-increment-operation>)                                                                       | Medium  |                | [solution](<../_1381. Design a Stack With Increment Operation.md>)                                    | py               | Jul 05, 2024    |
 | 1426 | [Counting Elements](<https://leetcode.com/problems/counting-elements>)                                                                                                                   | Easy    |                | [solution](<../_1426. Counting Elements.md>)                                                          | c                | Jun 04, 2024    |
 | 1436 | [Destination City](<https://leetcode.com/problems/destination-city>)                                                                                                                     | Easy    |                | [solution](<../_1436. Destination City.md>)                                                           | java             | Jun 01, 2024    |
 | 1438 | [Longest Continuous Subarray With Absolute Diff Less Than or Equal to Limit](<https://leetcode.com/problems/longest-continuous-subarray-with-absolute-diff-less-than-or-equal-to-limit>) | Medium  | Daily          | [solution](<../_1438. Longest Continuous Subarray With Absolute Diff Less Than or Equal to Limit.md>) | java             | Jun 22, 2024    |
 | 1442 | [Count Triplets That Can Form Two Arrays of Equal XOR](<https://leetcode.com/problems/count-triplets-that-can-form-two-arrays-of-equal-xor>)                                             | Medium  | Daily          | [solution](<../_1442. Count Triplets That Can Form Two Arrays of Equal XOR.md>)                       | py               | May 29, 2024    |
 | 1460 | [Make Two Arrays Equal by Reversing Subarrays](<https://leetcode.com/problems/make-two-arrays-equal-by-reversing-subarrays>)                                                             | Easy    |                | [solution](<../_1460. Make Two Arrays Equal by Reversing Subarrays.md>)                               | c                | Jun 04, 2024    |
 | 1470 | [Shuffle the Array](<https://leetcode.com/problems/shuffle-the-array>)                                                                                                                   | Easy    |                | [solution](<../_1470. Shuffle the Array.md>)                                                          | c                | Jun 03, 2024    |
+| 1472 | [Design Browser History](<https://leetcode.com/problems/design-browser-history>)                                                                                                         | Medium  |                | [solution](<../_1472. Design Browser History.md>)                                                     | py               | Jul 05, 2024    |
 | 1481 | [Least Number of Unique Integers after K Removals](<https://leetcode.com/problems/least-number-of-unique-integers-after-k-removals>)                                                     | Medium  |                | [solution](<../_1481. Least Number of Unique Integers after K Removals.md>)                           | py               | Jun 15, 2024    |
 | 1482 | [Minimum Number of Days to Make m Bouquets](<https://leetcode.com/problems/minimum-number-of-days-to-make-m-bouquets>)                                                                   | Medium  |                | [solution](<../_1482. Minimum Number of Days to Make m Bouquets.md>)                                  | py               | Jun 18, 2024    |
 | 1502 | [Can Make Arithmetic Progression From Sequence](<https://leetcode.com/problems/can-make-arithmetic-progression-from-sequence>)                                                           | Easy    |                | [solution](<../_1502. Can Make Arithmetic Progression From Sequence.md>)                              | py, c            | Jun 04, 2024    |
diff --git a/markdowns/by_topic/Data Stream.md b/markdowns/by_topic/Data Stream.md
index d31c0c78..26d1e409 100644
--- a/markdowns/by_topic/Data Stream.md	
+++ b/markdowns/by_topic/Data Stream.md	
@@ -1,9 +1,10 @@
-# [Data Stream](<https://leetcode.com/tag/Data-Stream/>) (1 completed)
+# [Data Stream](<https://leetcode.com/tag/Data-Stream/>) (2 completed)
 
 *[Back to top](<../../README.md>)*
 
 ------
 
-|   # | Title                                                                                              | Level   | Cats   | Solution                                                  | Languages   | Date Complete   |
-|----:|:---------------------------------------------------------------------------------------------------|:--------|:-------|:----------------------------------------------------------|:------------|:----------------|
-| 703 | [Kth Largest Element in a Stream](<https://leetcode.com/problems/kth-largest-element-in-a-stream>) | Easy    | N150   | [solution](<../_703. Kth Largest Element in a Stream.md>) | py          | Jul 04, 2024    |
\ No newline at end of file
+|    # | Title                                                                                              | Level   | Cats   | Solution                                                  | Languages   | Date Complete   |
+|-----:|:---------------------------------------------------------------------------------------------------|:--------|:-------|:----------------------------------------------------------|:------------|:----------------|
+|  703 | [Kth Largest Element in a Stream](<https://leetcode.com/problems/kth-largest-element-in-a-stream>) | Easy    | N150   | [solution](<../_703. Kth Largest Element in a Stream.md>) | py          | Jul 04, 2024    |
+| 1472 | [Design Browser History](<https://leetcode.com/problems/design-browser-history>)                   | Medium  |        | [solution](<../_1472. Design Browser History.md>)         | py          | Jul 05, 2024    |
\ No newline at end of file
diff --git a/markdowns/by_topic/Design.md b/markdowns/by_topic/Design.md
index 2fba4a7a..44ed624f 100644
--- a/markdowns/by_topic/Design.md
+++ b/markdowns/by_topic/Design.md
@@ -1,4 +1,4 @@
-# [Design](<https://leetcode.com/tag/Design/>) (22 completed)
+# [Design](<https://leetcode.com/tag/Design/>) (25 completed)
 
 *[Back to top](<../../README.md>)*
 
@@ -19,11 +19,14 @@
 |  381 | [Insert Delete GetRandom O(1) - Duplicates allowed](<https://leetcode.com/problems/insert-delete-getrandom-o1-duplicates-allowed>) | Hard    |           | [solution](<../_381. Insert Delete GetRandom O(1) - Duplicates allowed.md>) | java        | Jul 05, 2024    |
 |  431 | [Encode N-ary Tree to Binary Tree](<https://leetcode.com/problems/encode-n-ary-tree-to-binary-tree>)                               | Hard    |           | [solution](<../_431. Encode N-ary Tree to Binary Tree.md>)                  | py, java    | Jun 28, 2024    |
 |  535 | [Encode and Decode TinyURL](<https://leetcode.com/problems/encode-and-decode-tinyurl>)                                             | Medium  |           | [solution](<../_535. Encode and Decode TinyURL.md>)                         | py          | Jun 07, 2024    |
+|  622 | [Design Circular Queue](<https://leetcode.com/problems/design-circular-queue>)                                                     | Medium  |           | [solution](<../_622. Design Circular Queue.md>)                             | py          | Jul 05, 2024    |
 |  676 | [Implement Magic Dictionary](<https://leetcode.com/problems/implement-magic-dictionary>)                                           | Medium  |           | [solution](<../_676. Implement Magic Dictionary.md>)                        | py          | Jun 27, 2024    |
 |  703 | [Kth Largest Element in a Stream](<https://leetcode.com/problems/kth-largest-element-in-a-stream>)                                 | Easy    | N150      | [solution](<../_703. Kth Largest Element in a Stream.md>)                   | py          | Jul 04, 2024    |
 |  707 | [Design Linked List](<https://leetcode.com/problems/design-linked-list>)                                                           | Medium  |           | [solution](<../_707. Design Linked List.md>)                                | java        | Jun 21, 2024    |
 |  919 | [Complete Binary Tree Inserter](<https://leetcode.com/problems/complete-binary-tree-inserter>)                                     | Medium  |           | [solution](<../_919. Complete Binary Tree Inserter.md>)                     | py          | Jul 05, 2024    |
 | 1166 | [Design File System](<https://leetcode.com/problems/design-file-system>)                                                           | Medium  |           | [solution](<../_1166. Design File System.md>)                               | py          | Jun 27, 2024    |
+| 1381 | [Design a Stack With Increment Operation](<https://leetcode.com/problems/design-a-stack-with-increment-operation>)                 | Medium  |           | [solution](<../_1381. Design a Stack With Increment Operation.md>)          | py          | Jul 05, 2024    |
+| 1472 | [Design Browser History](<https://leetcode.com/problems/design-browser-history>)                                                   | Medium  |           | [solution](<../_1472. Design Browser History.md>)                           | py          | Jul 05, 2024    |
 | 1570 | [Dot Product of Two Sparse Vectors](<https://leetcode.com/problems/dot-product-of-two-sparse-vectors>)                             | Medium  |           | [solution](<../_1570. Dot Product of Two Sparse Vectors.md>)                | py, java, c | Jun 06, 2024    |
 | 1804 | [Implement Trie II (Prefix Tree)](<https://leetcode.com/problems/implement-trie-ii-prefix-tree>)                                   | Medium  |           | [solution](<../_1804. Implement Trie II (Prefix Tree).md>)                  | py          | Jun 27, 2024    |
 | 2013 | [Detect Squares](<https://leetcode.com/problems/detect-squares>)                                                                   | Medium  | N150      | [solution](<../_2013. Detect Squares.md>)                                   | py          | Jun 28, 2024    |
diff --git a/markdowns/by_topic/Doubly-Linked List.md b/markdowns/by_topic/Doubly-Linked List.md
index 189cf535..a7b23fb3 100644
--- a/markdowns/by_topic/Doubly-Linked List.md	
+++ b/markdowns/by_topic/Doubly-Linked List.md	
@@ -1,10 +1,11 @@
-# [Doubly-Linked List](<https://leetcode.com/tag/Doubly-Linked-List/>) (2 completed)
+# [Doubly-Linked List](<https://leetcode.com/tag/Doubly-Linked-List/>) (3 completed)
 
 *[Back to top](<../../README.md>)*
 
 ------
 
-|   # | Title                                                                                                                                              | Level   | Cats   | Solution                                                                          | Languages   | Date Complete   |
-|----:|:---------------------------------------------------------------------------------------------------------------------------------------------------|:--------|:-------|:----------------------------------------------------------------------------------|:------------|:----------------|
-| 426 | [Convert Binary Search Tree to Sorted Doubly Linked List](<https://leetcode.com/problems/convert-binary-search-tree-to-sorted-doubly-linked-list>) | Medium  |        | [solution](<../_426. Convert Binary Search Tree to Sorted Doubly Linked List.md>) | py          | Jun 11, 2024    |
-| 430 | [Flatten a Multilevel Doubly Linked List](<https://leetcode.com/problems/flatten-a-multilevel-doubly-linked-list>)                                 | Medium  |        | [solution](<../_430. Flatten a Multilevel Doubly Linked List.md>)                 | java, cpp   | Jun 26, 2024    |
\ No newline at end of file
+|    # | Title                                                                                                                                              | Level   | Cats   | Solution                                                                          | Languages   | Date Complete   |
+|-----:|:---------------------------------------------------------------------------------------------------------------------------------------------------|:--------|:-------|:----------------------------------------------------------------------------------|:------------|:----------------|
+|  426 | [Convert Binary Search Tree to Sorted Doubly Linked List](<https://leetcode.com/problems/convert-binary-search-tree-to-sorted-doubly-linked-list>) | Medium  |        | [solution](<../_426. Convert Binary Search Tree to Sorted Doubly Linked List.md>) | py          | Jun 11, 2024    |
+|  430 | [Flatten a Multilevel Doubly Linked List](<https://leetcode.com/problems/flatten-a-multilevel-doubly-linked-list>)                                 | Medium  |        | [solution](<../_430. Flatten a Multilevel Doubly Linked List.md>)                 | java, cpp   | Jun 26, 2024    |
+| 1472 | [Design Browser History](<https://leetcode.com/problems/design-browser-history>)                                                                   | Medium  |        | [solution](<../_1472. Design Browser History.md>)                                 | py          | Jul 05, 2024    |
\ No newline at end of file
diff --git a/markdowns/by_topic/Hash Table.md b/markdowns/by_topic/Hash Table.md
index 31e25e47..e66e968a 100644
--- a/markdowns/by_topic/Hash Table.md	
+++ b/markdowns/by_topic/Hash Table.md	
@@ -1,4 +1,4 @@
-# [Hash Table](<https://leetcode.com/tag/Hash-Table/>) (88 completed)
+# [Hash Table](<https://leetcode.com/tag/Hash-Table/>) (89 completed)
 
 *[Back to top](<../../README.md>)*
 
@@ -30,6 +30,7 @@
 |  451 | [Sort Characters By Frequency](<https://leetcode.com/problems/sort-characters-by-frequency>)                                                                       | Medium  |                | [solution](<../_451. Sort Characters By Frequency.md>)                                     | py          | Jun 17, 2024    |
 |  523 | [Continuous Subarray Sum](<https://leetcode.com/problems/continuous-subarray-sum>)                                                                                 | Medium  | Daily          | [solution](<../_523. Continuous Subarray Sum.md>)                                          | py          | Jun 08, 2024    |
 |  535 | [Encode and Decode TinyURL](<https://leetcode.com/problems/encode-and-decode-tinyurl>)                                                                             | Medium  |                | [solution](<../_535. Encode and Decode TinyURL.md>)                                        | py          | Jun 07, 2024    |
+|  567 | [Permutation in String](<https://leetcode.com/problems/permutation-in-string>)                                                                                     | Medium  | N150           | [solution](<../_567. Permutation in String.md>)                                            | py          | Jul 05, 2024    |
 |  616 | [Add Bold Tag in String](<https://leetcode.com/problems/add-bold-tag-in-string>)                                                                                   | Medium  |                | [solution](<../_616. Add Bold Tag in String.md>)                                           | py          | Jun 27, 2024    |
 |  645 | [Set Mismatch](<https://leetcode.com/problems/set-mismatch>)                                                                                                       | Easy    |                | [solution](<../_645. Set Mismatch.md>)                                                     | py, java    | Jun 01, 2024    |
 |  648 | [Replace Words](<https://leetcode.com/problems/replace-words>)                                                                                                     | Medium  | Daily          | [solution](<../_648. Replace Words.md>)                                                    | py, java    | Jun 06, 2024    |
diff --git a/markdowns/by_topic/Linked List.md b/markdowns/by_topic/Linked List.md
index c7aac228..37adfce6 100644
--- a/markdowns/by_topic/Linked List.md	
+++ b/markdowns/by_topic/Linked List.md	
@@ -1,4 +1,4 @@
-# [Linked List](<https://leetcode.com/tag/Linked-List/>) (38 completed)
+# [Linked List](<https://leetcode.com/tag/Linked-List/>) (40 completed)
 
 *[Back to top](<../../README.md>)*
 
@@ -25,6 +25,7 @@
 |  382 | [Linked List Random Node](<https://leetcode.com/problems/linked-list-random-node>)                                                                                           | Medium  |           | [solution](<../_382. Linked List Random Node.md>)                                               | py, java, c      | Jun 21, 2024    |
 |  426 | [Convert Binary Search Tree to Sorted Doubly Linked List](<https://leetcode.com/problems/convert-binary-search-tree-to-sorted-doubly-linked-list>)                           | Medium  |           | [solution](<../_426. Convert Binary Search Tree to Sorted Doubly Linked List.md>)               | py               | Jun 11, 2024    |
 |  430 | [Flatten a Multilevel Doubly Linked List](<https://leetcode.com/problems/flatten-a-multilevel-doubly-linked-list>)                                                           | Medium  |           | [solution](<../_430. Flatten a Multilevel Doubly Linked List.md>)                               | java, cpp        | Jun 26, 2024    |
+|  622 | [Design Circular Queue](<https://leetcode.com/problems/design-circular-queue>)                                                                                               | Medium  |           | [solution](<../_622. Design Circular Queue.md>)                                                 | py               | Jul 05, 2024    |
 |  707 | [Design Linked List](<https://leetcode.com/problems/design-linked-list>)                                                                                                     | Medium  |           | [solution](<../_707. Design Linked List.md>)                                                    | java             | Jun 21, 2024    |
 |  708 | [Insert into a Sorted Circular Linked List](<https://leetcode.com/problems/insert-into-a-sorted-circular-linked-list>)                                                       | Medium  |           | [solution](<../_708. Insert into a Sorted Circular Linked List.md>)                             | py               | Jun 21, 2024    |
 |  725 | [Split Linked List in Parts](<https://leetcode.com/problems/split-linked-list-in-parts>)                                                                                     | Medium  |           | [solution](<../_725. Split Linked List in Parts.md>)                                            | py               | Jun 21, 2024    |
@@ -32,6 +33,7 @@
 | 1019 | [Next Greater Node In Linked List](<https://leetcode.com/problems/next-greater-node-in-linked-list>)                                                                         | Medium  |           | [solution](<../_1019. Next Greater Node In Linked List.md>)                                     | py               | Jun 21, 2024    |
 | 1171 | [Remove Zero Sum Consecutive Nodes from Linked List](<https://leetcode.com/problems/remove-zero-sum-consecutive-nodes-from-linked-list>)                                     | Medium  |           | [solution](<../_1171. Remove Zero Sum Consecutive Nodes from Linked List.md>)                   | py               | Jun 15, 2024    |
 | 1265 | [Print Immutable Linked List in Reverse](<https://leetcode.com/problems/print-immutable-linked-list-in-reverse>)                                                             | Medium  |           | [solution](<../_1265. Print Immutable Linked List in Reverse.md>)                               | py, c            | Jun 06, 2024    |
+| 1472 | [Design Browser History](<https://leetcode.com/problems/design-browser-history>)                                                                                             | Medium  |           | [solution](<../_1472. Design Browser History.md>)                                               | py               | Jul 05, 2024    |
 | 1474 | [Delete N Nodes After M Nodes of a Linked List](<https://leetcode.com/problems/delete-n-nodes-after-m-nodes-of-a-linked-list>)                                               | Easy    |           | [solution](<../_1474. Delete N Nodes After M Nodes of a Linked List.md>)                        | java, c          | Jun 06, 2024    |
 | 1669 | [Merge In Between Linked Lists](<https://leetcode.com/problems/merge-in-between-linked-lists>)                                                                               | Medium  |           | [solution](<../_1669. Merge In Between Linked Lists.md>)                                        | c                | Jun 24, 2024    |
 | 1721 | [Swapping Nodes in a Linked List](<https://leetcode.com/problems/swapping-nodes-in-a-linked-list>)                                                                           | Medium  |           | [solution](<../_1721. Swapping Nodes in a Linked List.md>)                                      | c                | Jun 06, 2024    |
diff --git a/markdowns/by_topic/Queue.md b/markdowns/by_topic/Queue.md
index a2a30175..893cdad8 100644
--- a/markdowns/by_topic/Queue.md
+++ b/markdowns/by_topic/Queue.md
@@ -1,4 +1,4 @@
-# [Queue](<https://leetcode.com/tag/Queue/>) (8 completed)
+# [Queue](<https://leetcode.com/tag/Queue/>) (9 completed)
 
 *[Back to top](<../../README.md>)*
 
@@ -9,6 +9,7 @@
 |  239 | [Sliding Window Maximum](<https://leetcode.com/problems/sliding-window-maximum>)                                                                                                         | Hard    | N150   | [solution](<../_239. Sliding Window Maximum.md>)                                                      | py          | Jun 03, 2024    |
 |  341 | [Flatten Nested List Iterator](<https://leetcode.com/problems/flatten-nested-list-iterator>)                                                                                             | Medium  |        | [solution](<../_341. Flatten Nested List Iterator.md>)                                                | java        | Jul 02, 2024    |
 |  353 | [Design Snake Game](<https://leetcode.com/problems/design-snake-game>)                                                                                                                   | Medium  |        | [solution](<../_353. Design Snake Game.md>)                                                           | py          | Jun 28, 2024    |
+|  622 | [Design Circular Queue](<https://leetcode.com/problems/design-circular-queue>)                                                                                                           | Medium  |        | [solution](<../_622. Design Circular Queue.md>)                                                       | py          | Jul 05, 2024    |
 |  950 | [Reveal Cards In Increasing Order](<https://leetcode.com/problems/reveal-cards-in-increasing-order>)                                                                                     | Medium  |        | [solution](<../_950. Reveal Cards In Increasing Order.md>)                                            | py          | Jun 11, 2024    |
 |  995 | [Minimum Number of K Consecutive Bit Flips](<https://leetcode.com/problems/minimum-number-of-k-consecutive-bit-flips>)                                                                   | Hard    | Daily  | [solution](<../_995. Minimum Number of K Consecutive Bit Flips.md>)                                   | py, c       | Jun 23, 2024    |
 | 1438 | [Longest Continuous Subarray With Absolute Diff Less Than or Equal to Limit](<https://leetcode.com/problems/longest-continuous-subarray-with-absolute-diff-less-than-or-equal-to-limit>) | Medium  | Daily  | [solution](<../_1438. Longest Continuous Subarray With Absolute Diff Less Than or Equal to Limit.md>) | java        | Jun 22, 2024    |
diff --git a/markdowns/by_topic/Sliding Window.md b/markdowns/by_topic/Sliding Window.md
index 7b5e19eb..2474eda2 100644
--- a/markdowns/by_topic/Sliding Window.md	
+++ b/markdowns/by_topic/Sliding Window.md	
@@ -1,4 +1,4 @@
-# [Sliding Window](<https://leetcode.com/tag/Sliding-Window/>) (11 completed)
+# [Sliding Window](<https://leetcode.com/tag/Sliding-Window/>) (12 completed)
 
 *[Back to top](<../../README.md>)*
 
@@ -9,6 +9,7 @@
 |    3 | [Longest Substring Without Repeating Characters](<https://leetcode.com/problems/longest-substring-without-repeating-characters>)                                                         | Medium  | N150, B75      | [solution](<../_3. Longest Substring Without Repeating Characters.md>)                                | java        | May 22, 2024    |
 |  239 | [Sliding Window Maximum](<https://leetcode.com/problems/sliding-window-maximum>)                                                                                                         | Hard    | N150           | [solution](<../_239. Sliding Window Maximum.md>)                                                      | py          | Jun 03, 2024    |
 |  424 | [Longest Repeating Character Replacement](<https://leetcode.com/problems/longest-repeating-character-replacement>)                                                                       | Medium  | N150, B75      | [solution](<../_424. Longest Repeating Character Replacement.md>)                                     | py          | Jul 05, 2024    |
+|  567 | [Permutation in String](<https://leetcode.com/problems/permutation-in-string>)                                                                                                           | Medium  | N150           | [solution](<../_567. Permutation in String.md>)                                                       | py          | Jul 05, 2024    |
 |  713 | [Subarray Product Less Than K](<https://leetcode.com/problems/subarray-product-less-than-k>)                                                                                             | Medium  |                | [solution](<../_713. Subarray Product Less Than K.md>)                                                | py          | Jul 01, 2024    |
 |  930 | [Binary Subarrays With Sum](<https://leetcode.com/problems/binary-subarrays-with-sum>)                                                                                                   | Medium  |                | [solution](<../_930. Binary Subarrays With Sum.md>)                                                   | py          | Jun 21, 2024    |
 |  995 | [Minimum Number of K Consecutive Bit Flips](<https://leetcode.com/problems/minimum-number-of-k-consecutive-bit-flips>)                                                                   | Hard    | Daily          | [solution](<../_995. Minimum Number of K Consecutive Bit Flips.md>)                                   | py, c       | Jun 23, 2024    |
diff --git a/markdowns/by_topic/Stack.md b/markdowns/by_topic/Stack.md
index 7c8c08bd..4da33012 100644
--- a/markdowns/by_topic/Stack.md
+++ b/markdowns/by_topic/Stack.md
@@ -1,4 +1,4 @@
-# [Stack](<https://leetcode.com/tag/Stack/>) (35 completed)
+# [Stack](<https://leetcode.com/tag/Stack/>) (37 completed)
 
 *[Back to top](<../../README.md>)*
 
@@ -35,6 +35,8 @@
 | 1209 | [Remove All Adjacent Duplicates in String II](<https://leetcode.com/problems/remove-all-adjacent-duplicates-in-string-ii>)                         | Medium  |           | [solution](<../_1209. Remove All Adjacent Duplicates in String II.md>)            | py           | Jun 17, 2024    |
 | 1249 | [Minimum Remove to Make Valid Parentheses](<https://leetcode.com/problems/minimum-remove-to-make-valid-parentheses>)                               | Medium  |           | [solution](<../_1249. Minimum Remove to Make Valid Parentheses.md>)               | py           | Jun 10, 2024    |
 | 1265 | [Print Immutable Linked List in Reverse](<https://leetcode.com/problems/print-immutable-linked-list-in-reverse>)                                   | Medium  |           | [solution](<../_1265. Print Immutable Linked List in Reverse.md>)                 | py, c        | Jun 06, 2024    |
+| 1381 | [Design a Stack With Increment Operation](<https://leetcode.com/problems/design-a-stack-with-increment-operation>)                                 | Medium  |           | [solution](<../_1381. Design a Stack With Increment Operation.md>)                | py           | Jul 05, 2024    |
+| 1472 | [Design Browser History](<https://leetcode.com/problems/design-browser-history>)                                                                   | Medium  |           | [solution](<../_1472. Design Browser History.md>)                                 | py           | Jul 05, 2024    |
 | 1700 | [Number of Students Unable to Eat Lunch](<https://leetcode.com/problems/number-of-students-unable-to-eat-lunch>)                                   | Easy    |           | [solution](<../_1700. Number of Students Unable to Eat Lunch.md>)                 | py           | Jun 01, 2024    |
 | 1762 | [Buildings With an Ocean View](<https://leetcode.com/problems/buildings-with-an-ocean-view>)                                                       | Medium  |           | [solution](<../_1762. Buildings With an Ocean View.md>)                           | py           | Jun 10, 2024    |
 | 2130 | [Maximum Twin Sum of a Linked List](<https://leetcode.com/problems/maximum-twin-sum-of-a-linked-list>)                                             | Medium  |           | [solution](<../_2130. Maximum Twin Sum of a Linked List.md>)                      | py           | Jun 20, 2024    |
diff --git a/markdowns/by_topic/String.md b/markdowns/by_topic/String.md
index cd10dc2e..feb6fcd9 100644
--- a/markdowns/by_topic/String.md
+++ b/markdowns/by_topic/String.md
@@ -1,4 +1,4 @@
-# [String](<https://leetcode.com/tag/String/>) (87 completed)
+# [String](<https://leetcode.com/tag/String/>) (88 completed)
 
 *[Back to top](<../../README.md>)*
 
@@ -37,6 +37,7 @@
 |  424 | [Longest Repeating Character Replacement](<https://leetcode.com/problems/longest-repeating-character-replacement>)                                                       | Medium  | N150, B75      | [solution](<../_424. Longest Repeating Character Replacement.md>)                             | py          | Jul 05, 2024    |
 |  451 | [Sort Characters By Frequency](<https://leetcode.com/problems/sort-characters-by-frequency>)                                                                             | Medium  |                | [solution](<../_451. Sort Characters By Frequency.md>)                                        | py          | Jun 17, 2024    |
 |  535 | [Encode and Decode TinyURL](<https://leetcode.com/problems/encode-and-decode-tinyurl>)                                                                                   | Medium  |                | [solution](<../_535. Encode and Decode TinyURL.md>)                                           | py          | Jun 07, 2024    |
+|  567 | [Permutation in String](<https://leetcode.com/problems/permutation-in-string>)                                                                                           | Medium  | N150           | [solution](<../_567. Permutation in String.md>)                                               | py          | Jul 05, 2024    |
 |  616 | [Add Bold Tag in String](<https://leetcode.com/problems/add-bold-tag-in-string>)                                                                                         | Medium  |                | [solution](<../_616. Add Bold Tag in String.md>)                                              | py          | Jun 27, 2024    |
 |  647 | [Palindromic Substrings](<https://leetcode.com/problems/palindromic-substrings>)                                                                                         | Medium  | N150, B75      | [solution](<../_647. Palindromic Substrings.md>)                                              | py          | Jul 04, 2024    |
 |  648 | [Replace Words](<https://leetcode.com/problems/replace-words>)                                                                                                           | Medium  | Daily          | [solution](<../_648. Replace Words.md>)                                                       | py, java    | Jun 06, 2024    |
diff --git a/markdowns/by_topic/Two Pointers.md b/markdowns/by_topic/Two Pointers.md
index 0f4447d7..59da8fcb 100644
--- a/markdowns/by_topic/Two Pointers.md	
+++ b/markdowns/by_topic/Two Pointers.md	
@@ -1,4 +1,4 @@
-# [Two Pointers](<https://leetcode.com/tag/Two-Pointers/>) (43 completed)
+# [Two Pointers](<https://leetcode.com/tag/Two-Pointers/>) (44 completed)
 
 *[Back to top](<../../README.md>)*
 
@@ -30,6 +30,7 @@
 |  392 | [Is Subsequence](<https://leetcode.com/problems/is-subsequence>)                                                                                             | Easy    |                | [solution](<../_392. Is Subsequence.md>)                                                | java                             | Jun 21, 2024    |
 |  408 | [Valid Word Abbreviation](<https://leetcode.com/problems/valid-word-abbreviation>)                                                                           | Easy    |                | [solution](<../_408. Valid Word Abbreviation.md>)                                       | py                               | Jun 02, 2024    |
 |  475 | [Heaters](<https://leetcode.com/problems/heaters>)                                                                                                           | Medium  |                | [solution](<../_475. Heaters.md>)                                                       | py                               | Jun 07, 2024    |
+|  567 | [Permutation in String](<https://leetcode.com/problems/permutation-in-string>)                                                                               | Medium  | N150           | [solution](<../_567. Permutation in String.md>)                                         | py                               | Jul 05, 2024    |
 |  611 | [Valid Triangle Number](<https://leetcode.com/problems/valid-triangle-number>)                                                                               | Medium  |                | [solution](<../_611. Valid Triangle Number.md>)                                         | py                               | May 22, 2024    |
 |  647 | [Palindromic Substrings](<https://leetcode.com/problems/palindromic-substrings>)                                                                             | Medium  | N150, B75      | [solution](<../_647. Palindromic Substrings.md>)                                        | py                               | Jul 04, 2024    |
 |  826 | [Most Profit Assigning Work](<https://leetcode.com/problems/most-profit-assigning-work>)                                                                     | Medium  | Daily          | [solution](<../_826. Most Profit Assigning Work.md>)                                    | py                               | Jun 17, 2024    |
diff --git a/my-submissions/m1381.md b/my-submissions/m1381.md
new file mode 100644
index 00000000..208b0eab
--- /dev/null
+++ b/my-submissions/m1381.md
@@ -0,0 +1,3 @@
+## This question has the honour of being my 400th question on LeetCode.
+
+**On Day 39 of my grind, 8:35PM PST, this question was done. Simple one to end off this sprint. :)**
\ No newline at end of file
diff --git a/my-submissions/m1381.py b/my-submissions/m1381.py
new file mode 100644
index 00000000..6641c97b
--- /dev/null
+++ b/my-submissions/m1381.py
@@ -0,0 +1,26 @@
+class CustomStack:
+
+    def __init__(self, maxSize: int):
+        self.stk = []
+        self.maxx = maxSize
+
+    def push(self, x: int) -> None:
+        if len(self.stk) >= self.maxx :
+            return
+        self.stk.append(x)
+
+    def pop(self) -> int:
+        if not self.stk :
+            return -1
+        return self.stk.pop()
+
+    def increment(self, k: int, val: int) -> None:
+        for i in range(min(k, len(self.stk))) :
+            self.stk[i] += val
+
+
+# Your CustomStack object will be instantiated and called as such:
+# obj = CustomStack(maxSize)
+# obj.push(x)
+# param_2 = obj.pop()
+# obj.increment(k,val)
\ No newline at end of file
diff --git a/my-submissions/m1472.py b/my-submissions/m1472.py
new file mode 100644
index 00000000..42e0523c
--- /dev/null
+++ b/my-submissions/m1472.py
@@ -0,0 +1,26 @@
+class BrowserHistory:
+
+    def __init__(self, homepage: str):
+        self.history = [homepage]
+        self.spot = 0
+
+    def visit(self, url: str) -> None:
+        self.spot += 1
+        if self.spot < len(self.history) :
+            self.history = self.history[:self.spot]
+        self.history.append(url)
+
+    def back(self, steps: int) -> str:
+        self.spot = max(0, self.spot - steps)
+        return self.history[self.spot]
+
+    def forward(self, steps: int) -> str:
+        self.spot = min(len(self.history) - 1, self.spot + steps)
+        return self.history[self.spot]
+
+
+# Your BrowserHistory object will be instantiated and called as such:
+# obj = BrowserHistory(homepage)
+# obj.visit(url)
+# param_2 = obj.back(steps)
+# param_3 = obj.forward(steps)
\ No newline at end of file
diff --git a/my-submissions/m567 v1 Counter Equivalence.py b/my-submissions/m567 v1 Counter Equivalence.py
new file mode 100644
index 00000000..d5a6eaf4
--- /dev/null
+++ b/my-submissions/m567 v1 Counter Equivalence.py	
@@ -0,0 +1,12 @@
+class Solution:
+    def checkInclusion(self, s1: str, s2: str) -> bool:
+        cnt1 = Counter(s1)
+        cnt2 = Counter(s2[:len(s1) - 1])
+
+        for cL, cR in zip(s2, s2[len(s1) - 1 : len(s2)]) :
+            cnt2[cR] += 1
+            if cnt1 == cnt2 :
+                return True
+            cnt2[cL] -= 1
+
+        return False
\ No newline at end of file
diff --git a/my-submissions/m567 v2 Running Counter.py b/my-submissions/m567 v2 Running Counter.py
new file mode 100644
index 00000000..7bd0b113
--- /dev/null
+++ b/my-submissions/m567 v2 Running Counter.py	
@@ -0,0 +1,37 @@
+class Solution:
+    def checkInclusion(self, s1: str, s2: str) -> bool:
+        cnt1 = [0] * 26
+        cnt2 = [0] * 26
+
+        if len(s1) > len(s2) :
+            return False
+
+        for c1, c2 in zip(s1, s2) :
+            cnt1[ord(c1) - ord('a')] += 1
+            cnt2[ord(c2) - ord('a')] += 1
+
+        matches = [cnt1[x] == cnt2[x] for x in range(len(cnt1))].count(True)
+
+        if matches == 26 :
+            return True
+        for cL, cR in zip(s2, s2[len(s1):]) :
+            cnt2[ord(cL) - ord('a')] -= 1
+            cnt2[ord(cR) - ord('a')] += 1
+
+            if cL == cR :
+                continue
+
+            if cnt2[ord(cR) - ord('a')] == cnt1[ord(cR) - ord('a')] :
+                matches += 1
+            elif cnt2[ord(cR) - ord('a')] == cnt1[ord(cR) - ord('a')] + 1 :
+                matches -= 1
+
+            if cnt2[ord(cL) - ord('a')] == cnt1[ord(cL) - ord('a')] :
+                matches += 1
+            elif cnt2[ord(cL) - ord('a')] == cnt1[ord(cL) - ord('a')] - 1 :
+                matches -= 1
+
+            if matches == 26 :
+                return True
+
+        return False
\ No newline at end of file
diff --git a/my-submissions/m567.md b/my-submissions/m567.md
new file mode 100644
index 00000000..34230c6f
--- /dev/null
+++ b/my-submissions/m567.md
@@ -0,0 +1,37 @@
+
+#### Version 1
+
+In version 1, I just went with a straightforward counter approach. 
+Since `Python` `Counter` objects have a built-in comparing method, 
+I decided to simply use that. It's still technically $O(n)$ in total 
+since the counter size will be at most 26 (since it's only counting) 
+letters, but it's still less than ideal.
+
+#### Version 2
+
+In version 2, I swapped over to, while still using a counter, only 
+committing a comparison for the values that are being updated. That is,
+the values at the front of the window being added and the values
+are the end of the window that are being dropped. We have to find a case 
+where all values line up, so we iterate initially for the first `len(s1)` 
+letters then proceed with only incremental updates from that point onwards.
+
+
+#### Fun Testcase
+
+When creating version 2, I encountered a very fun test case:
+```
+s1 = "trinitrophenylmethylnitramine"
+s2 = "dinitrophenylhydrazinetrinitrophenylmethylnitramine"
+```
+Clearly, `s1` matches the ending of `s2` exactly, but my original 
+code for version 2 (the incomplete `v2`) was resulting in `False`. 
+Eventually, I realized that the cause was that during addings and 
+subtractions of the same letter, it would **cause match to increment by 2** 
+due to the the "new values" equallying the expected values in `s1`'s counter. 
+This would only happen when the values where originally the correct 
+value when it occured.
+
+I added the `if cL == cR : continue` check and that was resolved quickly 
+(as a if the previous wasn't a solution and didn't return, then this clearly 
+wouldn't be a solution either since it's equal in the letter counts).
\ No newline at end of file
diff --git a/my-submissions/m622.py b/my-submissions/m622.py
new file mode 100644
index 00000000..ae858098
--- /dev/null
+++ b/my-submissions/m622.py
@@ -0,0 +1,52 @@
+class MyCircularQueue:
+
+    def __init__(self, k: int):
+        self.vals = [0] * k
+        self.size = 0
+        self.pop = 0
+        self.add = 0
+        self.k = k
+
+    def enQueue(self, value: int) -> bool:
+        if self.size >= self.k :
+            return False
+        if self.size == 0 :
+            self.pop = 0
+            self.add = 0
+            self.vals[0] = value
+        else :
+            self.add = (self.add + 1) % self.k
+            self.vals[self.add] = value
+        self.size += 1
+        return True
+        
+    def deQueue(self) -> bool:
+        if self.isEmpty() :
+            return False
+
+        if self.pop != self.add :
+            self.pop = (self.pop + 1) % self.k
+        self.size -= 1
+        return True
+
+    def Front(self) -> int:
+        return self.vals[self.pop] if self.size > 0 else -1
+
+    def Rear(self) -> int:
+        return self.vals[self.add] if self.size > 0 else -1
+        
+    def isEmpty(self) -> bool:
+        return self.size == 0
+
+    def isFull(self) -> bool:
+        return self.size == self.k
+
+
+# Your MyCircularQueue object will be instantiated and called as such:
+# obj = MyCircularQueue(k)
+# param_1 = obj.enQueue(value)
+# param_2 = obj.deQueue()
+# param_3 = obj.Front()
+# param_4 = obj.Rear()
+# param_5 = obj.isEmpty()
+# param_6 = obj.isFull()
\ No newline at end of file