Категории задач по тегам¶
Info
Сорян, но Mkdocs Tags не умеет сам собирать теги и исключает всю страницу, если использовать exclude
- поэтому собирал вручную и мог что-то потерять или забыть :с
Array¶
- 01 Matrix
- 3Sum
- Best Time to Buy and Sell Stock
- Binary Search
- Coin Change
- Contains Duplicate
- Flood Fill
- Insert Interval
- K Closest Points to Origin
- Longest Subarray of 1's After Deleting One Element
- Majority Element
- Max Consecutive Ones
- Maximum Subarray
- Number of Islands
- Rotting Oranges
- Two Sum
Binary Search¶
Binary Search Tree¶
Binary Tree¶
- Balanced Binary Tree
- Binary Tree Level Order Traversal
- Diameter of Binary Tree
- Invert Binary Tree
- Lowest Common Ancestor of a Binary Search Tree
- Maximum Depth of Binary Tree
- Validate Binary Search Tree
Bit Manipulation¶
Breadth-First Search¶
- 01 Matrix
- Binary Tree Level Order Traversal
- Coin Change
- Flood Fill
- Invert Binary Tree
- Maximum Depth of Binary Tree
- Number of Islands
- Rotting Oranges
Counting¶
Depth-First Search¶
- Balanced Binary Tree
- Diameter of Binary Tree
- Flood Fill
- Invert Binary Tree
- Lowest Common Ancestor of a Binary Search Tree
- Maximum Depth of Binary Tree
- Number of Islands
- Validate Binary Search Tree
Design¶
Divide and Conquer¶
Dynamic Programming¶
- 01 Matrix
- Best Time to Buy and Sell Stock
- Climbing Stairs
- Coin Change
- Longest Subarray of 1's After Deleting One Element
- Maximum Subarray
Greedy¶
Hash Table¶
- Contains Duplicate
- Linked List Cycle
- Longest Palindrome
- Longest Substring Without Repeating Characters
- Majority Element
- Ransom Note
- Two Sum
- Valid Anagram
Interactive¶
Linked List¶
Math¶
Matrix¶
Memoization¶
Queue¶
Recursion¶
Simulation¶
Sliding Window¶
Sorting¶
Stack¶
String¶
- Add Binary
- Longest Palindrome
- Longest Substring Without Repeating Characters
- Ransom Note
- Valid Anagram
- Valid Palindrome
- Valid Parentheses
Tree¶
- Balanced Binary Tree
- Binary Tree Level Order Traversal
- Diameter of Binary Tree
- Invert Binary Tree
- Lowest Common Ancestor of a Binary Search Tree
- Maximum Depth of Binary Tree
- Validate Binary Search Tree
Two Pointers¶
Union Find¶
Metadata
- git_revision_date_localized: 5 июля 2025 г.
- git_revision_date_localized_hash: f6ac458ea7f3485fe36c4b8c8f7c610ae2d995e7
- git_revision_date_localized_tag:
- git_revision_date_localized_raw_date: 5 июля 2025 г.
- git_revision_date_localized_raw_datetime: 5 июля 2025 г. 19:32:08
- git_revision_date_localized_raw_datetime-timezone: 5 июля 2025 г. 19:32:08 UTC
- git_revision_date_localized_raw_iso_date: 2025-07-05
- git_revision_date_localized_raw_iso_datetime: 2025-07-05 19:32:08
- git_revision_date_localized_raw_timeago:
- git_revision_date_localized_raw_custom: 05. июля 2025
- git_site_revision_date_localized_hash: f6ac458ea7f3485fe36c4b8c8f7c610ae2d995e7
- git_site_revision_date_localized_tag:
- git_site_revision_date_localized: 5 июля 2025 г.
- git_site_revision_date_localized_raw_date: 5 июля 2025 г.
- git_site_revision_date_localized_raw_datetime: 5 июля 2025 г. 19:32:08
- git_site_revision_date_localized_raw_datetime-timezone: 5 июля 2025 г. 19:32:08 UTC
- git_site_revision_date_localized_raw_iso_date: 2025-07-05
- git_site_revision_date_localized_raw_iso_datetime: 2025-07-05 19:32:08
- git_site_revision_date_localized_raw_timeago:
- git_site_revision_date_localized_raw_custom: 05. июля 2025