vault backup: 2022-09-06 20:22:48
This commit is contained in:
parent
99e9f02118
commit
8f8ff15ddb
.obsidian
OJ notes/pages
Binary Search Algorithm.mdBit-Manipulation count true trick.mdBreadth First Search.mdFloyd's Cycle Finding Algorithm.mdKadane's Algorithm.mdLeetcode 01-Matrix.mdLeetcode Add-Strings.mdLeetcode Average-Salary-Excluding-the-Minimum-and-Maximum-Salary.mdLeetcode Best-Time-To-Buy-And-Sell-Stock.mdLeetcode Binary-Search.mdLeetcode Binary-Tree-Inorder-Traversal.mdLeetcode Binary-Tree-Level-Order-Traversal.mdLeetcode Binary-Tree-Postorder-Traversal.mdLeetcode Binary-Tree-Preorder-Traversal.mdLeetcode Check-If-It-Is-a-Straight-Line.mdLeetcode Climbing-Chairs.mdLeetcode Combinations.mdLeetcode Count-Odd-Numbers-in-an-Interval-Range.mdLeetcode Design-Hash.mdLeetcode First-Bad-Version.mdLeetcode First-Unique-Character-In-a-String.mdLeetcode Flood-Fill.mdLeetcode Group-Anagrams.mdLeetcode Happy-Number.mdLeetcode House-Robber.mdLeetcode Implement-Queue-Using-Stacks.mdLeetcode Increasing-Triplet-Subsequence.mdLeetcode Insert-Into-a-Binary-Search-Tree.mdLeetcode Intersection-of-Two-Arrays-II.mdLeetcode Invert-Binary-Tree.mdLeetcode Largest-Perimeter-Triangle.mdLeetcode Letter-Case-Combination.mdLeetcode Linked-List-Cycle.mdLeetcode Longest-Palindrome.mdLeetcode Longest-Substring-Without-Repeating-Characters.mdLeetcode Lowest-Common-Ancestor-Of-a-Binary-Search-Tree.mdLeetcode Max-Area-of-Island.mdLeetcode Maximum-Depth-Of-Binary-Tree.mdLeetcode Maximum-Difference-Between-Increasing-Elements.mdLeetcode Maxinum-subarray.mdLeetcode Merge-Intervals.mdLeetcode Merge-Sorted-Array.mdLeetcode Merge-Two-Binary-Trees.mdLeetcode Merge-Two-Sorted-Lists.mdLeetcode Middle-of-the-Linked-List.mdLeetcode Move-Zeroes.mdLeetcode Next-Greater-Element-I.mdLeetcode Non-Overlapping-Intervals.mdLeetcode Number-of-1-Bits.mdLeetcode Partition-Labels.mdLeetcode Pascal's-Triangle-II.mdLeetcode Pascal's-Triangle.mdLeetcode Path-Sum.mdLeetcode Permutation-In-String.mdLeetcode Permutations.mdLeetcode Populating-Next-Right-Pointers-In-Each-Node.mdLeetcode Power-of-Two.mdLeetcode Product-of-Array-Except-Self.mdLeetcode Ransom-Note.mdLeetcode Remove-Duplicates-From-Sorted-List.mdLeetcode Remove-Linked-List-Elements.mdLeetcode Remove-Nth-Node-From-End-of-List.mdLeetcode Repeated-DNA-Sequences.mdLeetcode Reshape-The-Matrix.mdLeetcode Reverse-Bits.mdLeetcode Reverse-Linked-List.mdLeetcode Reverse-String.mdLeetcode Reverse-Words-In-a-String.mdLeetcode Rotate-Array.mdLeetcode Rotate-Image.mdLeetcode Rotting-Oranges.mdLeetcode Search-A-2D-Matrix-II.mdLeetcode Search-In-a-Binary-Tree.mdLeetcode Search-Insert-Position.mdLeetcode Search-a-2D-Matrix.mdLeetcode Single-Number.mdLeetcode Sort-Colors.mdLeetcode Squares-of-a-Sorted-Array.mdLeetcode Subarray-Sum-Equals-K.mdLeetcode Subsets.mdLeetcode Symmetric-Tree.mdLeetcode Triangle.mdLeetcode Two-Sum-II-Input-Array-Is-Sorted.mdLeetcode Two-Sum-IV-Input-Is-a-BST.mdLeetcode Two-Sum.mdLeetcode Valid-Anagram.mdLeetcode Valid-Parentheses.mdLeetcode Valid-Sudoku.mdLeetcode Validate-Binary-Search-Tree.mdLeetcode Word-Pattern.mdcpp_Range_based_for_loop.mdcpp_std_multiset.mdcpp_std_sort.mdcpp_std_unordered_map.md
2
.obsidian/appearance.json
vendored
2
.obsidian/appearance.json
vendored
|
@ -1,5 +1,5 @@
|
||||||
{
|
{
|
||||||
"theme": "moonstone",
|
"theme": "obsidian",
|
||||||
"translucency": true,
|
"translucency": true,
|
||||||
"cssTheme": "Prism",
|
"cssTheme": "Prism",
|
||||||
"interfaceFontFamily": "IBM Plex Sans",
|
"interfaceFontFamily": "IBM Plex Sans",
|
||||||
|
|
14
.obsidian/graph.json
vendored
14
.obsidian/graph.json
vendored
|
@ -30,15 +30,15 @@
|
||||||
}
|
}
|
||||||
],
|
],
|
||||||
"collapse-display": false,
|
"collapse-display": false,
|
||||||
"showArrow": false,
|
"showArrow": true,
|
||||||
"textFadeMultiplier": 0,
|
"textFadeMultiplier": 0,
|
||||||
"nodeSizeMultiplier": 1,
|
"nodeSizeMultiplier": 1,
|
||||||
"lineSizeMultiplier": 1,
|
"lineSizeMultiplier": 1,
|
||||||
"collapse-forces": false,
|
"collapse-forces": false,
|
||||||
"centerStrength": 0.518713248970312,
|
"centerStrength": 0.5,
|
||||||
"repelStrength": 10,
|
"repelStrength": 10.5952380952381,
|
||||||
"linkStrength": 1,
|
"linkStrength": 0.505952380952381,
|
||||||
"linkDistance": 250,
|
"linkDistance": 259,
|
||||||
"scale": 0.9747267101258579,
|
"scale": 0.34081054256054544,
|
||||||
"close": true
|
"close": false
|
||||||
}
|
}
|
|
@ -14,7 +14,7 @@
|
||||||
|
|
||||||
##### Difficulty:
|
##### Difficulty:
|
||||||
|
|
||||||
#CS_analysis #difficulty-easy
|
#CS_analysis #difficulty_easy
|
||||||
|
|
||||||
##### Related problems:
|
##### Related problems:
|
||||||
|
|
||||||
|
|
|
@ -12,7 +12,7 @@
|
||||||
>
|
>
|
||||||
> ##### Difficulty:
|
> ##### Difficulty:
|
||||||
>
|
>
|
||||||
> #CS_analysis #difficulty-easy
|
> #CS_analysis #difficulty_easy
|
||||||
>
|
>
|
||||||
> ##### Additional tags:
|
> ##### Additional tags:
|
||||||
|
|
||||||
|
|
|
@ -12,7 +12,7 @@
|
||||||
>
|
>
|
||||||
> ##### Difficulty:
|
> ##### Difficulty:
|
||||||
>
|
>
|
||||||
> #CS_analysis #difficulty-
|
> #CS_analysis #difficulty_
|
||||||
>
|
>
|
||||||
> ##### Additional tags:
|
> ##### Additional tags:
|
||||||
|
|
||||||
|
|
|
@ -14,7 +14,7 @@
|
||||||
|
|
||||||
##### Difficulty:
|
##### Difficulty:
|
||||||
|
|
||||||
#CS_analysis #difficulty-easy
|
#CS_analysis #difficulty_easy
|
||||||
|
|
||||||
##### Related problems:
|
##### Related problems:
|
||||||
|
|
||||||
|
|
|
@ -14,7 +14,7 @@
|
||||||
|
|
||||||
##### Difficulty:
|
##### Difficulty:
|
||||||
|
|
||||||
#CS_analysis #difficulty-easy
|
#CS_analysis #difficulty_easy
|
||||||
|
|
||||||
##### Time complexity:
|
##### Time complexity:
|
||||||
|
|
||||||
|
|
|
@ -12,7 +12,7 @@
|
||||||
>
|
>
|
||||||
> ##### Difficulty:
|
> ##### Difficulty:
|
||||||
>
|
>
|
||||||
> #coding_problem #difficulty-medium
|
> #coding_problem #difficulty_medium
|
||||||
>
|
>
|
||||||
> ##### Additional tags:
|
> ##### Additional tags:
|
||||||
>
|
>
|
||||||
|
|
|
@ -8,7 +8,7 @@
|
||||||
>
|
>
|
||||||
> ##### Difficulty:
|
> ##### Difficulty:
|
||||||
>
|
>
|
||||||
> #coding_problem #difficulty-easy
|
> #coding_problem #difficulty_easy
|
||||||
>
|
>
|
||||||
> ##### Additional tags:
|
> ##### Additional tags:
|
||||||
>
|
>
|
||||||
|
|
|
@ -4,7 +4,7 @@
|
||||||
|
|
||||||
> ##### Difficulty:
|
> ##### Difficulty:
|
||||||
>
|
>
|
||||||
> #coding_problem #difficulty-easy
|
> #coding_problem #difficulty_easy
|
||||||
>
|
>
|
||||||
> ##### Additional tags:
|
> ##### Additional tags:
|
||||||
>
|
>
|
||||||
|
|
|
@ -14,7 +14,7 @@
|
||||||
|
|
||||||
##### Difficulty:
|
##### Difficulty:
|
||||||
|
|
||||||
#leetcode #coding_problem #difficulty-easy
|
#leetcode #coding_problem #difficulty_easy
|
||||||
|
|
||||||
##### Related topics:
|
##### Related topics:
|
||||||
|
|
||||||
|
|
|
@ -12,7 +12,7 @@
|
||||||
>
|
>
|
||||||
> ##### Difficulty:
|
> ##### Difficulty:
|
||||||
>
|
>
|
||||||
> #coding_problem #difficulty-easy
|
> #coding_problem #difficulty_easy
|
||||||
>
|
>
|
||||||
> ##### Additional tags:
|
> ##### Additional tags:
|
||||||
>
|
>
|
||||||
|
|
|
@ -12,7 +12,7 @@
|
||||||
>
|
>
|
||||||
> ##### Difficulty:
|
> ##### Difficulty:
|
||||||
>
|
>
|
||||||
> #coding_problem #difficulty-easy
|
> #coding_problem #difficulty_easy
|
||||||
>
|
>
|
||||||
> ##### Additional tags:
|
> ##### Additional tags:
|
||||||
>
|
>
|
||||||
|
|
|
@ -12,7 +12,7 @@
|
||||||
>
|
>
|
||||||
> ##### Difficulty:
|
> ##### Difficulty:
|
||||||
>
|
>
|
||||||
> #coding_problem #difficulty-medium
|
> #coding_problem #difficulty_medium
|
||||||
>
|
>
|
||||||
> ##### Additional tags:
|
> ##### Additional tags:
|
||||||
>
|
>
|
||||||
|
|
|
@ -12,7 +12,7 @@
|
||||||
>
|
>
|
||||||
> ##### Difficulty:
|
> ##### Difficulty:
|
||||||
>
|
>
|
||||||
> #coding_problem #difficulty-
|
> #coding_problem #difficulty_
|
||||||
>
|
>
|
||||||
> ##### Additional tags:
|
> ##### Additional tags:
|
||||||
>
|
>
|
||||||
|
|
|
@ -12,7 +12,7 @@
|
||||||
>
|
>
|
||||||
> ##### Difficulty:
|
> ##### Difficulty:
|
||||||
>
|
>
|
||||||
> #coding_problem #difficulty-easy
|
> #coding_problem #difficulty_easy
|
||||||
>
|
>
|
||||||
> ##### Additional tags:
|
> ##### Additional tags:
|
||||||
>
|
>
|
||||||
|
|
|
@ -8,7 +8,7 @@
|
||||||
>
|
>
|
||||||
> ##### Difficulty:
|
> ##### Difficulty:
|
||||||
>
|
>
|
||||||
> #coding_problem #difficulty-easy
|
> #coding_problem #difficulty_easy
|
||||||
>
|
>
|
||||||
> ##### Additional tags:
|
> ##### Additional tags:
|
||||||
>
|
>
|
||||||
|
|
|
@ -8,7 +8,7 @@
|
||||||
>
|
>
|
||||||
> ##### Difficulty:
|
> ##### Difficulty:
|
||||||
>
|
>
|
||||||
> #coding_problem #difficulty-easy
|
> #coding_problem #difficulty_easy
|
||||||
>
|
>
|
||||||
> ##### Additional tags:
|
> ##### Additional tags:
|
||||||
>
|
>
|
||||||
|
|
|
@ -8,7 +8,7 @@
|
||||||
>
|
>
|
||||||
> ##### Difficulty:
|
> ##### Difficulty:
|
||||||
>
|
>
|
||||||
> #coding_problem #difficulty-medium
|
> #coding_problem #difficulty_medium
|
||||||
>
|
>
|
||||||
> ##### Additional tags:
|
> ##### Additional tags:
|
||||||
>
|
>
|
||||||
|
|
|
@ -8,7 +8,7 @@
|
||||||
>
|
>
|
||||||
> ##### Difficulty:
|
> ##### Difficulty:
|
||||||
>
|
>
|
||||||
> #coding_problem #difficulty-easy
|
> #coding_problem #difficulty_easy
|
||||||
>
|
>
|
||||||
> ##### Additional tags:
|
> ##### Additional tags:
|
||||||
>
|
>
|
||||||
|
|
|
@ -8,7 +8,7 @@
|
||||||
>
|
>
|
||||||
> ##### Difficulty:
|
> ##### Difficulty:
|
||||||
>
|
>
|
||||||
> #coding_problem #difficulty-easy
|
> #coding_problem #difficulty_easy
|
||||||
>
|
>
|
||||||
> ##### Additional tags:
|
> ##### Additional tags:
|
||||||
>
|
>
|
||||||
|
|
|
@ -12,7 +12,7 @@
|
||||||
>
|
>
|
||||||
> ##### Difficulty:
|
> ##### Difficulty:
|
||||||
>
|
>
|
||||||
> #coding_problem #difficulty-easy
|
> #coding_problem #difficulty_easy
|
||||||
>
|
>
|
||||||
> ##### Additional tags:
|
> ##### Additional tags:
|
||||||
>
|
>
|
||||||
|
|
|
@ -14,7 +14,7 @@
|
||||||
|
|
||||||
##### Difficulty:
|
##### Difficulty:
|
||||||
|
|
||||||
#leetcode #coding_problem #difficulty-easy
|
#leetcode #coding_problem #difficulty_easy
|
||||||
|
|
||||||
##### Related topics:
|
##### Related topics:
|
||||||
|
|
||||||
|
|
|
@ -12,7 +12,7 @@
|
||||||
>
|
>
|
||||||
> ##### Difficulty:
|
> ##### Difficulty:
|
||||||
>
|
>
|
||||||
> #coding_problem #difficulty-easy
|
> #coding_problem #difficulty_easy
|
||||||
>
|
>
|
||||||
> ##### Additional tags:
|
> ##### Additional tags:
|
||||||
>
|
>
|
||||||
|
|
|
@ -8,7 +8,7 @@
|
||||||
>
|
>
|
||||||
> ##### Difficulty:
|
> ##### Difficulty:
|
||||||
>
|
>
|
||||||
> #coding_problem #difficulty-medium
|
> #coding_problem #difficulty_medium
|
||||||
>
|
>
|
||||||
> ##### Additional tags:
|
> ##### Additional tags:
|
||||||
>
|
>
|
||||||
|
@ -68,6 +68,7 @@ An **Anagram** is a word or phrase formed by rearranging the letters of a differ
|
||||||
|
|
||||||
This one can be solved simply using two-way hash tables,
|
This one can be solved simply using two-way hash tables,
|
||||||
consisting of two hash tables:
|
consisting of two hash tables:
|
||||||
|
|
||||||
- ana2id: turn anagram into an id
|
- ana2id: turn anagram into an id
|
||||||
- id2str: turn id into strings that has the anagrams
|
- id2str: turn id into strings that has the anagrams
|
||||||
|
|
||||||
|
@ -76,6 +77,7 @@ CPP-style initialization of C's array.
|
||||||
|
|
||||||
> [!tip]
|
> [!tip]
|
||||||
> CPP-style initialization of C array #tip
|
> CPP-style initialization of C array #tip
|
||||||
|
>
|
||||||
> ```cpp
|
> ```cpp
|
||||||
> array<int, 26> ana = {};
|
> array<int, 26> ana = {};
|
||||||
> ```
|
> ```
|
||||||
|
|
|
@ -8,7 +8,7 @@
|
||||||
>
|
>
|
||||||
> ##### Difficulty:
|
> ##### Difficulty:
|
||||||
>
|
>
|
||||||
> #coding_problem #difficulty-easy
|
> #coding_problem #difficulty_easy
|
||||||
>
|
>
|
||||||
> ##### Additional tags:
|
> ##### Additional tags:
|
||||||
>
|
>
|
||||||
|
|
|
@ -8,7 +8,7 @@
|
||||||
>
|
>
|
||||||
> ##### Difficulty:
|
> ##### Difficulty:
|
||||||
>
|
>
|
||||||
> #coding_problem #difficulty-medium
|
> #coding_problem #difficulty_medium
|
||||||
>
|
>
|
||||||
> ##### Additional tags:
|
> ##### Additional tags:
|
||||||
>
|
>
|
||||||
|
|
|
@ -8,7 +8,7 @@
|
||||||
>
|
>
|
||||||
> ##### Difficulty:
|
> ##### Difficulty:
|
||||||
>
|
>
|
||||||
> #coding_problem #difficulty-easy
|
> #coding_problem #difficulty_easy
|
||||||
>
|
>
|
||||||
> ##### Additional tags:
|
> ##### Additional tags:
|
||||||
>
|
>
|
||||||
|
|
|
@ -12,7 +12,7 @@
|
||||||
>
|
>
|
||||||
> ##### Difficulty:
|
> ##### Difficulty:
|
||||||
>
|
>
|
||||||
> #coding_problem #difficulty-medium
|
> #coding_problem #difficulty_medium
|
||||||
>
|
>
|
||||||
> ##### Additional tags:
|
> ##### Additional tags:
|
||||||
>
|
>
|
||||||
|
|
|
@ -12,7 +12,7 @@
|
||||||
>
|
>
|
||||||
> ##### Difficulty:
|
> ##### Difficulty:
|
||||||
>
|
>
|
||||||
> #coding_problem #difficulty-medium
|
> #coding_problem #difficulty_medium
|
||||||
>
|
>
|
||||||
> ##### Additional tags:
|
> ##### Additional tags:
|
||||||
>
|
>
|
||||||
|
|
|
@ -16,7 +16,7 @@
|
||||||
|
|
||||||
##### Difficulty:
|
##### Difficulty:
|
||||||
|
|
||||||
#leetcode #coding_problem #difficulty-easy
|
#leetcode #coding_problem #difficulty_easy
|
||||||
|
|
||||||
##### Related topics:
|
##### Related topics:
|
||||||
|
|
||||||
|
|
|
@ -12,7 +12,7 @@
|
||||||
>
|
>
|
||||||
> ##### Difficulty:
|
> ##### Difficulty:
|
||||||
>
|
>
|
||||||
> #coding_problem #difficulty-easy
|
> #coding_problem #difficulty_easy
|
||||||
>
|
>
|
||||||
> ##### Additional tags:
|
> ##### Additional tags:
|
||||||
>
|
>
|
||||||
|
|
|
@ -8,7 +8,7 @@
|
||||||
>
|
>
|
||||||
> ##### Difficulty:
|
> ##### Difficulty:
|
||||||
>
|
>
|
||||||
> #coding_problem #difficulty-easy
|
> #coding_problem #difficulty_easy
|
||||||
>
|
>
|
||||||
> ##### Additional tags:
|
> ##### Additional tags:
|
||||||
>
|
>
|
||||||
|
|
|
@ -8,7 +8,7 @@
|
||||||
>
|
>
|
||||||
> ##### Difficulty:
|
> ##### Difficulty:
|
||||||
>
|
>
|
||||||
> #coding_problem #difficulty-medium
|
> #coding_problem #difficulty_medium
|
||||||
>
|
>
|
||||||
> ##### Additional tags:
|
> ##### Additional tags:
|
||||||
>
|
>
|
||||||
|
|
|
@ -14,7 +14,7 @@
|
||||||
|
|
||||||
##### Difficulty:
|
##### Difficulty:
|
||||||
|
|
||||||
#leetcode #coding_problem #difficulty-easy
|
#leetcode #coding_problem #difficulty_easy
|
||||||
|
|
||||||
##### Related topics:
|
##### Related topics:
|
||||||
|
|
||||||
|
|
|
@ -12,7 +12,7 @@
|
||||||
>
|
>
|
||||||
> ##### Difficulty:
|
> ##### Difficulty:
|
||||||
>
|
>
|
||||||
> #coding_problem #difficulty-easy
|
> #coding_problem #difficulty_easy
|
||||||
>
|
>
|
||||||
> ##### Additional tags:
|
> ##### Additional tags:
|
||||||
>
|
>
|
||||||
|
@ -30,7 +30,7 @@
|
||||||
|
|
||||||
### Problem
|
### Problem
|
||||||
|
|
||||||
Given a string `s` which consists of lowercase or uppercase letters, return _the length of the **longest palindrome**_ that can be built with those letters.
|
Given a string `s` which consists of lowercase or uppercase letters, return *the length of the **longest palindrome*** that can be built with those letters.
|
||||||
|
|
||||||
Letters are **case sensitive**, for example, `"Aa"` is not considered a palindrome here.
|
Letters are **case sensitive**, for example, `"Aa"` is not considered a palindrome here.
|
||||||
|
|
||||||
|
@ -61,6 +61,7 @@ Letters are **case sensitive**, for example, `"Aa"` is not considered a palindr
|
||||||
The solution is simple: count the apperances, sort it using
|
The solution is simple: count the apperances, sort it using
|
||||||
std::greater<int>(), and select all even number, for odd
|
std::greater<int>(), and select all even number, for odd
|
||||||
number `i`:
|
number `i`:
|
||||||
|
|
||||||
- if odd numbers has been used: `ans += i - 1` (make it
|
- if odd numbers has been used: `ans += i - 1` (make it
|
||||||
even)
|
even)
|
||||||
- if not: `ans += i`, and mark odd number used
|
- if not: `ans += i`, and mark odd number used
|
||||||
|
|
|
@ -12,7 +12,7 @@
|
||||||
>
|
>
|
||||||
> ##### Difficulty:
|
> ##### Difficulty:
|
||||||
>
|
>
|
||||||
> #coding_problem #difficulty-medium
|
> #coding_problem #difficulty_medium
|
||||||
>
|
>
|
||||||
> ##### Additional tags:
|
> ##### Additional tags:
|
||||||
>
|
>
|
||||||
|
|
|
@ -12,7 +12,7 @@
|
||||||
>
|
>
|
||||||
> ##### Difficulty:
|
> ##### Difficulty:
|
||||||
>
|
>
|
||||||
> #coding_problem #difficulty-easy
|
> #coding_problem #difficulty_easy
|
||||||
>
|
>
|
||||||
> ##### Additional tags:
|
> ##### Additional tags:
|
||||||
>
|
>
|
||||||
|
|
|
@ -12,7 +12,7 @@
|
||||||
>
|
>
|
||||||
> ##### Difficulty:
|
> ##### Difficulty:
|
||||||
>
|
>
|
||||||
> #coding_problem #difficulty-medium
|
> #coding_problem #difficulty_medium
|
||||||
>
|
>
|
||||||
> ##### Additional tags:
|
> ##### Additional tags:
|
||||||
>
|
>
|
||||||
|
|
|
@ -12,7 +12,7 @@
|
||||||
>
|
>
|
||||||
> ##### Difficulty:
|
> ##### Difficulty:
|
||||||
>
|
>
|
||||||
> #coding_problem #difficulty-easy
|
> #coding_problem #difficulty_easy
|
||||||
>
|
>
|
||||||
> ##### Additional tags:
|
> ##### Additional tags:
|
||||||
>
|
>
|
||||||
|
|
|
@ -8,7 +8,7 @@
|
||||||
>
|
>
|
||||||
> ##### Difficulty:
|
> ##### Difficulty:
|
||||||
>
|
>
|
||||||
> #coding_problem #difficulty-easy
|
> #coding_problem #difficulty_easy
|
||||||
>
|
>
|
||||||
> ##### Additional tags:
|
> ##### Additional tags:
|
||||||
>
|
>
|
||||||
|
|
|
@ -14,7 +14,7 @@
|
||||||
|
|
||||||
##### Difficulty:
|
##### Difficulty:
|
||||||
|
|
||||||
#leetcode #coding_problem #difficulty-easy
|
#leetcode #coding_problem #difficulty_easy
|
||||||
|
|
||||||
##### Links:
|
##### Links:
|
||||||
|
|
||||||
|
|
|
@ -12,7 +12,7 @@
|
||||||
>
|
>
|
||||||
> ##### Difficulty:
|
> ##### Difficulty:
|
||||||
>
|
>
|
||||||
> #coding_problem #difficulty-medium
|
> #coding_problem #difficulty_medium
|
||||||
>
|
>
|
||||||
> ##### Additional tags:
|
> ##### Additional tags:
|
||||||
>
|
>
|
||||||
|
|
|
@ -14,7 +14,7 @@
|
||||||
|
|
||||||
##### Difficulty:
|
##### Difficulty:
|
||||||
|
|
||||||
#leetcode #coding_problem #difficulty-easy
|
#leetcode #coding_problem #difficulty_easy
|
||||||
|
|
||||||
##### Related topics:
|
##### Related topics:
|
||||||
|
|
||||||
|
|
|
@ -12,7 +12,7 @@
|
||||||
>
|
>
|
||||||
> ##### Difficulty:
|
> ##### Difficulty:
|
||||||
>
|
>
|
||||||
> #coding_problem #difficulty-easy
|
> #coding_problem #difficulty_easy
|
||||||
>
|
>
|
||||||
> ##### Additional tags:
|
> ##### Additional tags:
|
||||||
>
|
>
|
||||||
|
|
|
@ -14,7 +14,7 @@
|
||||||
|
|
||||||
##### Difficulty:
|
##### Difficulty:
|
||||||
|
|
||||||
#leetcode #coding_problem #difficulty-easy
|
#leetcode #coding_problem #difficulty_easy
|
||||||
|
|
||||||
##### Related topics:
|
##### Related topics:
|
||||||
|
|
||||||
|
|
|
@ -12,7 +12,7 @@
|
||||||
>
|
>
|
||||||
> ##### Difficulty:
|
> ##### Difficulty:
|
||||||
>
|
>
|
||||||
> #coding_problem #difficulty-easy
|
> #coding_problem #difficulty_easy
|
||||||
>
|
>
|
||||||
> ##### Additional tags:
|
> ##### Additional tags:
|
||||||
>
|
>
|
||||||
|
|
|
@ -12,7 +12,7 @@
|
||||||
>
|
>
|
||||||
> ##### Difficulty:
|
> ##### Difficulty:
|
||||||
>
|
>
|
||||||
> #coding_problem #difficulty-easy
|
> #coding_problem #difficulty_easy
|
||||||
>
|
>
|
||||||
> ##### Additional tags:
|
> ##### Additional tags:
|
||||||
>
|
>
|
||||||
|
|
|
@ -8,7 +8,7 @@
|
||||||
>
|
>
|
||||||
> ##### Difficulty:
|
> ##### Difficulty:
|
||||||
>
|
>
|
||||||
> #coding_problem #difficulty-easy
|
> #coding_problem #difficulty_easy
|
||||||
>
|
>
|
||||||
> ##### Additional tags:
|
> ##### Additional tags:
|
||||||
>
|
>
|
||||||
|
|
|
@ -12,7 +12,7 @@
|
||||||
>
|
>
|
||||||
> ##### Difficulty:
|
> ##### Difficulty:
|
||||||
>
|
>
|
||||||
> #coding_problem #difficulty-medium
|
> #coding_problem #difficulty_medium
|
||||||
>
|
>
|
||||||
> ##### Additional tags:
|
> ##### Additional tags:
|
||||||
>
|
>
|
||||||
|
|
|
@ -12,7 +12,7 @@
|
||||||
>
|
>
|
||||||
> ##### Difficulty:
|
> ##### Difficulty:
|
||||||
>
|
>
|
||||||
> #coding_problem #difficulty-easy
|
> #coding_problem #difficulty_easy
|
||||||
>
|
>
|
||||||
> ##### Additional tags:
|
> ##### Additional tags:
|
||||||
>
|
>
|
||||||
|
|
|
@ -12,7 +12,7 @@
|
||||||
>
|
>
|
||||||
> ##### Difficulty:
|
> ##### Difficulty:
|
||||||
>
|
>
|
||||||
> #coding_problem #difficulty-medium
|
> #coding_problem #difficulty_medium
|
||||||
>
|
>
|
||||||
> ##### Additional tags:
|
> ##### Additional tags:
|
||||||
>
|
>
|
||||||
|
@ -62,6 +62,7 @@ A partition like "ababcbacadefegde", "hijhklij" is incorrect, because it splits
|
||||||
#### Why is it a greedy problem?
|
#### Why is it a greedy problem?
|
||||||
|
|
||||||
Consider this situation:
|
Consider this situation:
|
||||||
|
|
||||||
```
|
```
|
||||||
s: ababc
|
s: ababc
|
||||||
partition: abab|c
|
partition: abab|c
|
||||||
|
|
|
@ -12,7 +12,7 @@
|
||||||
>
|
>
|
||||||
> ##### Difficulty:
|
> ##### Difficulty:
|
||||||
>
|
>
|
||||||
> #coding_problem #difficulty-easy
|
> #coding_problem #difficulty_easy
|
||||||
>
|
>
|
||||||
> ##### Additional tags:
|
> ##### Additional tags:
|
||||||
>
|
>
|
||||||
|
|
|
@ -14,7 +14,7 @@
|
||||||
|
|
||||||
##### Difficulty:
|
##### Difficulty:
|
||||||
|
|
||||||
#leetcode #coding_problem #difficulty-easy
|
#leetcode #coding_problem #difficulty_easy
|
||||||
|
|
||||||
##### Related topics:
|
##### Related topics:
|
||||||
|
|
||||||
|
|
|
@ -12,7 +12,7 @@
|
||||||
>
|
>
|
||||||
> ##### Difficulty:
|
> ##### Difficulty:
|
||||||
>
|
>
|
||||||
> #coding_problem #difficulty-easy
|
> #coding_problem #difficulty_easy
|
||||||
>
|
>
|
||||||
> ##### Additional tags:
|
> ##### Additional tags:
|
||||||
>
|
>
|
||||||
|
|
|
@ -12,7 +12,7 @@
|
||||||
>
|
>
|
||||||
> ##### Difficulty:
|
> ##### Difficulty:
|
||||||
>
|
>
|
||||||
> #coding_problem #difficulty-medium
|
> #coding_problem #difficulty_medium
|
||||||
>
|
>
|
||||||
> ##### Additional tags:
|
> ##### Additional tags:
|
||||||
>
|
>
|
||||||
|
|
|
@ -8,7 +8,7 @@
|
||||||
>
|
>
|
||||||
> ##### Difficulty:
|
> ##### Difficulty:
|
||||||
>
|
>
|
||||||
> #coding_problem #difficulty-medium
|
> #coding_problem #difficulty_medium
|
||||||
>
|
>
|
||||||
> ##### Additional tags:
|
> ##### Additional tags:
|
||||||
>
|
>
|
||||||
|
|
|
@ -12,7 +12,7 @@
|
||||||
>
|
>
|
||||||
> ##### Difficulty:
|
> ##### Difficulty:
|
||||||
>
|
>
|
||||||
> #coding_problem #difficulty-medium
|
> #coding_problem #difficulty_medium
|
||||||
>
|
>
|
||||||
> ##### Additional tags:
|
> ##### Additional tags:
|
||||||
>
|
>
|
||||||
|
|
|
@ -12,7 +12,7 @@
|
||||||
>
|
>
|
||||||
> ##### Difficulty:
|
> ##### Difficulty:
|
||||||
>
|
>
|
||||||
> #coding_problem #difficulty-medium
|
> #coding_problem #difficulty_medium
|
||||||
>
|
>
|
||||||
> ##### Additional tags:
|
> ##### Additional tags:
|
||||||
>
|
>
|
||||||
|
|
|
@ -12,7 +12,7 @@
|
||||||
>
|
>
|
||||||
> ##### Difficulty:
|
> ##### Difficulty:
|
||||||
>
|
>
|
||||||
> #coding_problem #difficulty-medium
|
> #coding_problem #difficulty_medium
|
||||||
>
|
>
|
||||||
> ##### Additional tags:
|
> ##### Additional tags:
|
||||||
>
|
>
|
||||||
|
@ -25,7 +25,7 @@
|
||||||
##### Links:
|
##### Links:
|
||||||
|
|
||||||
- [Link to problem](https://leetcode.com/problems/product-of-array-except-self/)
|
- [Link to problem](https://leetcode.com/problems/product-of-array-except-self/)
|
||||||
- [Solution with explanation](https://leetcode.com/problems/product-of-array-except-self/discuss/1597994/C%2B%2BPython-4-Simple-Solutions-w-Explanation-or-Prefix-and-Suffix-product-O(1)-space-approach)
|
- [Solution with explanation](<https://leetcode.com/problems/product-of-array-except-self/discuss/1597994/C%2B%2BPython-4-Simple-Solutions-w-Explanation-or-Prefix-and-Suffix-product-O(1)-space-approach>)
|
||||||
|
|
||||||
---
|
---
|
||||||
|
|
||||||
|
@ -148,6 +148,7 @@ public:
|
||||||
```
|
```
|
||||||
|
|
||||||
First iteration:
|
First iteration:
|
||||||
|
|
||||||
```cpp
|
```cpp
|
||||||
class Solution {
|
class Solution {
|
||||||
public:
|
public:
|
||||||
|
|
|
@ -14,7 +14,7 @@
|
||||||
|
|
||||||
##### Difficulty:
|
##### Difficulty:
|
||||||
|
|
||||||
#leetcode #coding_problem #difficulty-easy
|
#leetcode #coding_problem #difficulty_easy
|
||||||
|
|
||||||
##### Related topics:
|
##### Related topics:
|
||||||
|
|
||||||
|
|
|
@ -8,7 +8,7 @@
|
||||||
>
|
>
|
||||||
> ##### Difficulty:
|
> ##### Difficulty:
|
||||||
>
|
>
|
||||||
> #coding_problem #difficulty-easy
|
> #coding_problem #difficulty_easy
|
||||||
>
|
>
|
||||||
> ##### Additional tags:
|
> ##### Additional tags:
|
||||||
>
|
>
|
||||||
|
|
|
@ -10,7 +10,7 @@
|
||||||
|
|
||||||
##### Difficulty:
|
##### Difficulty:
|
||||||
|
|
||||||
#leetcode #coding_problem #difficulty-easy
|
#leetcode #coding_problem #difficulty_easy
|
||||||
|
|
||||||
##### Related topics:
|
##### Related topics:
|
||||||
|
|
||||||
|
|
|
@ -12,7 +12,7 @@
|
||||||
>
|
>
|
||||||
> ##### Difficulty:
|
> ##### Difficulty:
|
||||||
>
|
>
|
||||||
> #coding_problem #difficulty-medium
|
> #coding_problem #difficulty_medium
|
||||||
>
|
>
|
||||||
> ##### Additional tags:
|
> ##### Additional tags:
|
||||||
>
|
>
|
||||||
|
|
|
@ -8,7 +8,7 @@
|
||||||
>
|
>
|
||||||
> ##### Difficulty:
|
> ##### Difficulty:
|
||||||
>
|
>
|
||||||
> #coding_problem #difficulty-medium
|
> #coding_problem #difficulty_medium
|
||||||
>
|
>
|
||||||
> ##### Additional tags:
|
> ##### Additional tags:
|
||||||
>
|
>
|
||||||
|
@ -57,18 +57,21 @@ The question ask for an answer, and the substrings can
|
||||||
overlap. So, using a map is prefered(Why?)
|
overlap. So, using a map is prefered(Why?)
|
||||||
|
|
||||||
Two reasons:
|
Two reasons:
|
||||||
|
|
||||||
- Easy way to know if a array is a duplicate (set, map can
|
- Easy way to know if a array is a duplicate (set, map can
|
||||||
suffice.)
|
suffice.)
|
||||||
- Keep information on how many duplicates found, so we only
|
- Keep information on how many duplicates found, so we only
|
||||||
append it to the answer the first time we meet it.
|
append it to the answer the first time we meet it.
|
||||||
|
|
||||||
One trip-over hole: in the for loop, upper bound should be:
|
One trip-over hole: in the for loop, upper bound should be:
|
||||||
|
|
||||||
```cpp
|
```cpp
|
||||||
for (int i = 0, top = s.size() - 9; i < top; i++)
|
for (int i = 0, top = s.size() - 9; i < top; i++)
|
||||||
^^^
|
^^^
|
||||||
```
|
```
|
||||||
|
|
||||||
Minus 9, because 9 is the extended length for an subarray starting with i.
|
Minus 9, because 9 is the extended length for an subarray starting with i.
|
||||||
|
|
||||||
```
|
```
|
||||||
1234567890
|
1234567890
|
||||||
^ ^
|
^ ^
|
||||||
|
|
|
@ -10,7 +10,7 @@
|
||||||
|
|
||||||
##### Difficulty:
|
##### Difficulty:
|
||||||
|
|
||||||
#leetcode #coding_problem #difficulty-easy
|
#leetcode #coding_problem #difficulty_easy
|
||||||
|
|
||||||
##### Related topics:
|
##### Related topics:
|
||||||
|
|
||||||
|
|
|
@ -12,7 +12,7 @@
|
||||||
>
|
>
|
||||||
> ##### Difficulty:
|
> ##### Difficulty:
|
||||||
>
|
>
|
||||||
> #coding_problem #difficulty-easy
|
> #coding_problem #difficulty_easy
|
||||||
>
|
>
|
||||||
> ##### Additional tags:
|
> ##### Additional tags:
|
||||||
>
|
>
|
||||||
|
|
|
@ -14,7 +14,7 @@
|
||||||
|
|
||||||
##### Difficulty:
|
##### Difficulty:
|
||||||
|
|
||||||
#leetcode #coding_problem #difficulty-medium
|
#leetcode #coding_problem #difficulty_medium
|
||||||
|
|
||||||
##### Lists:
|
##### Lists:
|
||||||
|
|
||||||
|
|
|
@ -12,7 +12,7 @@
|
||||||
>
|
>
|
||||||
> ##### Difficulty:
|
> ##### Difficulty:
|
||||||
>
|
>
|
||||||
> #coding_problem #difficulty-easy
|
> #coding_problem #difficulty_easy
|
||||||
>
|
>
|
||||||
> ##### Additional tags:
|
> ##### Additional tags:
|
||||||
>
|
>
|
||||||
|
|
|
@ -12,7 +12,7 @@
|
||||||
>
|
>
|
||||||
> ##### Difficulty:
|
> ##### Difficulty:
|
||||||
>
|
>
|
||||||
> #coding_problem #difficulty-easy
|
> #coding_problem #difficulty_easy
|
||||||
>
|
>
|
||||||
> ##### Additional tags:
|
> ##### Additional tags:
|
||||||
>
|
>
|
||||||
|
|
|
@ -12,7 +12,7 @@
|
||||||
>
|
>
|
||||||
> ##### Difficulty:
|
> ##### Difficulty:
|
||||||
>
|
>
|
||||||
> #coding_problem #difficulty-medium
|
> #coding_problem #difficulty_medium
|
||||||
>
|
>
|
||||||
> ##### Additional tags:
|
> ##### Additional tags:
|
||||||
>
|
>
|
||||||
|
|
|
@ -12,7 +12,7 @@
|
||||||
>
|
>
|
||||||
> ##### Difficulty:
|
> ##### Difficulty:
|
||||||
>
|
>
|
||||||
> #coding_problem #difficulty-medium
|
> #coding_problem #difficulty_medium
|
||||||
>
|
>
|
||||||
> ##### Additional tags:
|
> ##### Additional tags:
|
||||||
>
|
>
|
||||||
|
|
|
@ -12,7 +12,7 @@
|
||||||
>
|
>
|
||||||
> ##### Difficulty:
|
> ##### Difficulty:
|
||||||
>
|
>
|
||||||
> #coding_problem #difficulty-medium
|
> #coding_problem #difficulty_medium
|
||||||
>
|
>
|
||||||
> ##### Additional tags:
|
> ##### Additional tags:
|
||||||
>
|
>
|
||||||
|
|
|
@ -12,7 +12,7 @@
|
||||||
>
|
>
|
||||||
> ##### Difficulty:
|
> ##### Difficulty:
|
||||||
>
|
>
|
||||||
> #coding_problem #difficulty-medium
|
> #coding_problem #difficulty_medium
|
||||||
>
|
>
|
||||||
> ##### Additional tags:
|
> ##### Additional tags:
|
||||||
>
|
>
|
||||||
|
|
|
@ -12,7 +12,7 @@
|
||||||
>
|
>
|
||||||
> ##### Difficulty:
|
> ##### Difficulty:
|
||||||
>
|
>
|
||||||
> #coding_problem #difficulty-easy
|
> #coding_problem #difficulty_easy
|
||||||
>
|
>
|
||||||
> ##### Additional tags:
|
> ##### Additional tags:
|
||||||
>
|
>
|
||||||
|
|
|
@ -12,7 +12,7 @@
|
||||||
>
|
>
|
||||||
> ##### Difficulty:
|
> ##### Difficulty:
|
||||||
>
|
>
|
||||||
> #coding_problem #difficulty-easy
|
> #coding_problem #difficulty_easy
|
||||||
>
|
>
|
||||||
> ##### Additional tags:
|
> ##### Additional tags:
|
||||||
>
|
>
|
||||||
|
|
|
@ -14,7 +14,7 @@
|
||||||
|
|
||||||
##### Difficulty:
|
##### Difficulty:
|
||||||
|
|
||||||
#leetcode #coding_problem #difficulty-easy
|
#leetcode #coding_problem #difficulty_easy
|
||||||
|
|
||||||
##### Related topics:
|
##### Related topics:
|
||||||
|
|
||||||
|
|
|
@ -12,7 +12,7 @@
|
||||||
>
|
>
|
||||||
> ##### Difficulty:
|
> ##### Difficulty:
|
||||||
>
|
>
|
||||||
> #coding_problem #difficulty-easy
|
> #coding_problem #difficulty_easy
|
||||||
>
|
>
|
||||||
> ##### Additional tags:
|
> ##### Additional tags:
|
||||||
>
|
>
|
||||||
|
|
|
@ -12,7 +12,7 @@
|
||||||
>
|
>
|
||||||
> ##### Difficulty:
|
> ##### Difficulty:
|
||||||
>
|
>
|
||||||
> #coding_problem #difficulty-medium
|
> #coding_problem #difficulty_medium
|
||||||
>
|
>
|
||||||
> ##### Additional tags:
|
> ##### Additional tags:
|
||||||
>
|
>
|
||||||
|
|
|
@ -12,7 +12,7 @@
|
||||||
>
|
>
|
||||||
> ##### Difficulty:
|
> ##### Difficulty:
|
||||||
>
|
>
|
||||||
> #coding_problem #difficulty-easy
|
> #coding_problem #difficulty_easy
|
||||||
>
|
>
|
||||||
> ##### Additional tags:
|
> ##### Additional tags:
|
||||||
>
|
>
|
||||||
|
|
|
@ -12,7 +12,7 @@
|
||||||
>
|
>
|
||||||
> ##### Difficulty:
|
> ##### Difficulty:
|
||||||
>
|
>
|
||||||
> #coding_problem #difficulty-medium
|
> #coding_problem #difficulty_medium
|
||||||
>
|
>
|
||||||
> ##### Additional tags:
|
> ##### Additional tags:
|
||||||
>
|
>
|
||||||
|
@ -111,6 +111,7 @@ public:
|
||||||
```
|
```
|
||||||
|
|
||||||
TLE, brute force
|
TLE, brute force
|
||||||
|
|
||||||
```cpp
|
```cpp
|
||||||
class Solution {
|
class Solution {
|
||||||
public:
|
public:
|
||||||
|
|
|
@ -12,7 +12,7 @@
|
||||||
>
|
>
|
||||||
> ##### Difficulty:
|
> ##### Difficulty:
|
||||||
>
|
>
|
||||||
> #coding_problem #difficulty-medium
|
> #coding_problem #difficulty_medium
|
||||||
>
|
>
|
||||||
> ##### Additional tags:
|
> ##### Additional tags:
|
||||||
>
|
>
|
||||||
|
|
|
@ -12,7 +12,7 @@
|
||||||
>
|
>
|
||||||
> ##### Difficulty:
|
> ##### Difficulty:
|
||||||
>
|
>
|
||||||
> #coding_problem #difficulty-easy
|
> #coding_problem #difficulty_easy
|
||||||
>
|
>
|
||||||
> ##### Additional tags:
|
> ##### Additional tags:
|
||||||
>
|
>
|
||||||
|
|
|
@ -8,7 +8,7 @@
|
||||||
>
|
>
|
||||||
> ##### Difficulty:
|
> ##### Difficulty:
|
||||||
>
|
>
|
||||||
> #coding_problem #difficulty-medium
|
> #coding_problem #difficulty_medium
|
||||||
>
|
>
|
||||||
> ##### Additional tags:
|
> ##### Additional tags:
|
||||||
>
|
>
|
||||||
|
|
|
@ -12,7 +12,7 @@
|
||||||
>
|
>
|
||||||
> ##### Difficulty:
|
> ##### Difficulty:
|
||||||
>
|
>
|
||||||
> #coding_problem #difficulty-easy
|
> #coding_problem #difficulty_easy
|
||||||
>
|
>
|
||||||
> ##### Additional tags:
|
> ##### Additional tags:
|
||||||
>
|
>
|
||||||
|
|
|
@ -12,7 +12,7 @@
|
||||||
>
|
>
|
||||||
> ##### Difficulty:
|
> ##### Difficulty:
|
||||||
>
|
>
|
||||||
> #coding_problem #difficulty-easy
|
> #coding_problem #difficulty_easy
|
||||||
>
|
>
|
||||||
> ##### Additional tags:
|
> ##### Additional tags:
|
||||||
>
|
>
|
||||||
|
|
|
@ -14,7 +14,7 @@
|
||||||
|
|
||||||
##### Difficulty:
|
##### Difficulty:
|
||||||
|
|
||||||
#coding_problem #leetcode #difficulty-easy
|
#coding_problem #leetcode #difficulty_easy
|
||||||
|
|
||||||
##### Related topics:
|
##### Related topics:
|
||||||
|
|
||||||
|
|
|
@ -14,7 +14,7 @@
|
||||||
|
|
||||||
##### Difficulty:
|
##### Difficulty:
|
||||||
|
|
||||||
#leetcode #coding_problem #difficulty-easy
|
#leetcode #coding_problem #difficulty_easy
|
||||||
|
|
||||||
##### Related topics:
|
##### Related topics:
|
||||||
|
|
||||||
|
|
|
@ -8,7 +8,7 @@
|
||||||
>
|
>
|
||||||
> ##### Difficulty:
|
> ##### Difficulty:
|
||||||
>
|
>
|
||||||
> #coding_problem #difficulty-easy
|
> #coding_problem #difficulty_easy
|
||||||
>
|
>
|
||||||
> ##### Additional tags:
|
> ##### Additional tags:
|
||||||
>
|
>
|
||||||
|
|
|
@ -10,7 +10,7 @@
|
||||||
|
|
||||||
##### Difficulty:
|
##### Difficulty:
|
||||||
|
|
||||||
#leetcode #coding_problem #difficulty-easy
|
#leetcode #coding_problem #difficulty_easy
|
||||||
|
|
||||||
##### Related topics:
|
##### Related topics:
|
||||||
|
|
||||||
|
|
|
@ -12,7 +12,7 @@
|
||||||
>
|
>
|
||||||
> ##### Difficulty:
|
> ##### Difficulty:
|
||||||
>
|
>
|
||||||
> #coding_problem #difficulty-medium
|
> #coding_problem #difficulty_medium
|
||||||
>
|
>
|
||||||
> ##### Additional tags:
|
> ##### Additional tags:
|
||||||
>
|
>
|
||||||
|
|
|
@ -8,7 +8,7 @@
|
||||||
>
|
>
|
||||||
> ##### Difficulty:
|
> ##### Difficulty:
|
||||||
>
|
>
|
||||||
> #coding_problem #difficulty-easy
|
> #coding_problem #difficulty_easy
|
||||||
>
|
>
|
||||||
> ##### Additional tags:
|
> ##### Additional tags:
|
||||||
>
|
>
|
||||||
|
@ -65,6 +65,7 @@ The main part is using two hash tables, to check for
|
||||||
mismatches, and using `istringstream` to read from string
|
mismatches, and using `istringstream` to read from string
|
||||||
|
|
||||||
Two hash tables:
|
Two hash tables:
|
||||||
|
|
||||||
- One is used to check for s has one and only bound word
|
- One is used to check for s has one and only bound word
|
||||||
- The other is used to check that the word is only stored
|
- The other is used to check that the word is only stored
|
||||||
once
|
once
|
||||||
|
|
|
@ -10,7 +10,7 @@
|
||||||
|
|
||||||
##### Difficulty:
|
##### Difficulty:
|
||||||
|
|
||||||
#CS_analysis #difficulty-easy
|
#CS_analysis #difficulty_easy
|
||||||
|
|
||||||
##### Related problems:
|
##### Related problems:
|
||||||
|
|
||||||
|
|
|
@ -10,7 +10,7 @@
|
||||||
|
|
||||||
##### Difficulty:
|
##### Difficulty:
|
||||||
|
|
||||||
#CS_analysis #difficulty-easy
|
#CS_analysis #difficulty_easy
|
||||||
|
|
||||||
##### Related problems:
|
##### Related problems:
|
||||||
|
|
||||||
|
|
|
@ -10,7 +10,7 @@
|
||||||
|
|
||||||
##### Difficulty:
|
##### Difficulty:
|
||||||
|
|
||||||
#CS_analysis #difficulty-easy
|
#CS_analysis #difficulty_easy
|
||||||
|
|
||||||
##### Related problems:
|
##### Related problems:
|
||||||
|
|
||||||
|
|
|
@ -10,7 +10,7 @@
|
||||||
|
|
||||||
##### Difficulty:
|
##### Difficulty:
|
||||||
|
|
||||||
#CS_analysis #difficulty-easy
|
#CS_analysis #difficulty_easy
|
||||||
|
|
||||||
##### Related problems:
|
##### Related problems:
|
||||||
|
|
||||||
|
|
Loading…
Reference in a new issue