Skip to content

Commit bcb5364

Browse files
Zanger67/leetcodeZanger67/leetcode
authored andcommitted
Updated markdown files
1 parent f7cbc41 commit bcb5364

File tree

8 files changed

+45
-6
lines changed

8 files changed

+45
-6
lines changed

README.md

Lines changed: 2 additions & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,4 +1,4 @@
1-
# **[LeetCode Records](https://leetcode.com/u/Zanger/)** (523 solved)
1+
# **[LeetCode Records](https://leetcode.com/u/Zanger/)** (524 solved)
22

33
<!-- This readme was generated using [WikiLeet](<https://github.com/Zanger67/WikiLeet>) -->
44

@@ -322,6 +322,7 @@ This repo is a collection of my LeetCode solutions, primarily written in Python,
322322
| 1171 | [Remove Zero Sum Consecutive Nodes from Linked List](<https://leetcode.com/problems/remove-zero-sum-consecutive-nodes-from-linked-list>) | Medium | | [solution](<markdowns/_1171. Remove Zero Sum Consecutive Nodes from Linked List.md>) | py |
323323
| 1184 | [Distance Between Bus Stops](<https://leetcode.com/problems/distance-between-bus-stops>) | Easy | | [solution](<markdowns/_1184. Distance Between Bus Stops.md>) | py |
324324
| 1190 | [Reverse Substrings Between Each Pair of Parentheses](<https://leetcode.com/problems/reverse-substrings-between-each-pair-of-parentheses>) | Medium | Daily | [solution](<markdowns/_1190. Reverse Substrings Between Each Pair of Parentheses.md>) | py |
325+
| 1207 | [Unique Number of Occurrences](<https://leetcode.com/problems/unique-number-of-occurrences>) | Easy | | [solution](<markdowns/_1207. Unique Number of Occurrences.md>) | py |
325326
| 1209 | [Remove All Adjacent Duplicates in String II](<https://leetcode.com/problems/remove-all-adjacent-duplicates-in-string-ii>) | Medium | | [solution](<markdowns/_1209. Remove All Adjacent Duplicates in String II.md>) | py |
326327
| 1218 | [Longest Arithmetic Subsequence of Given Difference](<https://leetcode.com/problems/longest-arithmetic-subsequence-of-given-difference>) | Medium | | [solution](<markdowns/_1218. Longest Arithmetic Subsequence of Given Difference.md>) | py |
327328
| 1229 | [Meeting Scheduler](<https://leetcode.com/problems/meeting-scheduler>) | Medium | Weekly Premium | [solution](<markdowns/_1229. Meeting Scheduler.md>) | py |

markdowns/Easy.md

Lines changed: 2 additions & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,4 +1,4 @@
1-
# Easy Questions (157)
1+
# Easy Questions (158)
22

33
*[Back to top](<../README.md>)*
44

@@ -91,6 +91,7 @@
9191
| 1122 | [Relative Sort Array](<https://leetcode.com/problems/relative-sort-array>) | Easy | Daily | [solution](<_1122. Relative Sort Array.md>) | java, py | Jun 11, 2024 |
9292
| 1160 | [Find Words That Can Be Formed by Characters](<https://leetcode.com/problems/find-words-that-can-be-formed-by-characters>) | Easy | | [solution](<_1160. Find Words That Can Be Formed by Characters.md>) | py | Sep 24, 2024 |
9393
| 1184 | [Distance Between Bus Stops](<https://leetcode.com/problems/distance-between-bus-stops>) | Easy | | [solution](<_1184. Distance Between Bus Stops.md>) | py | May 31, 2024 |
94+
| 1207 | [Unique Number of Occurrences](<https://leetcode.com/problems/unique-number-of-occurrences>) | Easy | | [solution](<_1207. Unique Number of Occurrences.md>) | py | Sep 25, 2024 |
9495
| 1252 | [Cells with Odd Values in a Matrix](<https://leetcode.com/problems/cells-with-odd-values-in-a-matrix>) | Easy | | [solution](<_1252. Cells with Odd Values in a Matrix.md>) | c | Jun 04, 2024 |
9596
| 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](<_1317. Convert Integer to the Sum of Two No-Zero Integers.md>) | c | Jun 04, 2024 |
9697
| 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>) | java, py | Jun 01, 2024 |

markdowns/Questions_By_Code_Length.md

Lines changed: 1 addition & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -515,6 +515,7 @@ Calculations are based on the code files's byte sizes.
515515
| 69 | [Sqrt(x)](<https://leetcode.com/problems/sqrtx>) | Easy | | [solution](<_69. Sqrt(x).md>) | py | Jun 07, 2024 |
516516
| 176 | [Second Highest Salary](<https://leetcode.com/problems/second-highest-salary>) | Medium | | [solution](<_176. Second Highest Salary.md>) | sql | May 22, 2024 |
517517
| 509 | [Fibonacci Number](<https://leetcode.com/problems/fibonacci-number>) | Easy | | [solution](<_509. Fibonacci Number.md>) | c | Jun 17, 2024 |
518+
| 1207 | [Unique Number of Occurrences](<https://leetcode.com/problems/unique-number-of-occurrences>) | Easy | | [solution](<_1207. Unique Number of Occurrences.md>) | py | Sep 25, 2024 |
518519
| 197 | [Rising Temperature](<https://leetcode.com/problems/rising-temperature>) | Easy | | [solution](<_197. Rising Temperature.md>) | sql | May 22, 2024 |
519520
| 2894 | [Divisible and Non-divisible Sums Difference](<https://leetcode.com/problems/divisible-and-non-divisible-sums-difference>) | Easy | | [solution](<_2894. Divisible and Non-divisible Sums Difference.md>) | py | May 22, 2024 |
520521
| 619 | [Biggest Single Number](<https://leetcode.com/problems/biggest-single-number>) | Easy | | [solution](<_619. Biggest Single Number.md>) | sql | May 22, 2024 |

markdowns/Questions_By_Recent.md

Lines changed: 1 addition & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -6,6 +6,7 @@ Calculations are based on the date of the first solve.
66

77
| # | Title | Level | Cats | Solution | Languages | Date Complete |
88
|-----:|:-------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|:--------|:---------------|:----------------------------------------------------------------------------------------------------|:--------------------------------------------|:----------------|
9+
| 1207 | [Unique Number of Occurrences](<https://leetcode.com/problems/unique-number-of-occurrences>) | Easy | | [solution](<_1207. Unique Number of Occurrences.md>) | py | Sep 25, 2024 |
910
| 1071 | [Greatest Common Divisor of Strings](<https://leetcode.com/problems/greatest-common-divisor-of-strings>) | Easy | | [solution](<_1071. Greatest Common Divisor of Strings.md>) | py | Sep 25, 2024 |
1011
| 1160 | [Find Words That Can Be Formed by Characters](<https://leetcode.com/problems/find-words-that-can-be-formed-by-characters>) | Easy | | [solution](<_1160. Find Words That Can Be Formed by Characters.md>) | py | Sep 24, 2024 |
1112
| 819 | [Most Common Word](<https://leetcode.com/problems/most-common-word>) | Easy | | [solution](<_819. Most Common Word.md>) | py | Sep 24, 2024 |

markdowns/Topics.md

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -4,9 +4,9 @@
44

55
------
66

7-
- [Array](<by_topic/Array.md>) (246 completed)
7+
- [Array](<by_topic/Array.md>) (247 completed)
88
- [String](<by_topic/String.md>) (118 completed)
9-
- [Hash Table](<by_topic/Hash Table.md>) (113 completed)
9+
- [Hash Table](<by_topic/Hash Table.md>) (114 completed)
1010
- [Depth-First Search](<by_topic/Depth-First Search.md>) (88 completed)
1111
- [Tree](<by_topic/Tree.md>) (85 completed)
1212
- [Binary Tree](<by_topic/Binary Tree.md>) (77 completed)
Lines changed: 33 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,33 @@
1+
# 1207. [Unique Number of Occurrences](<https://leetcode.com/problems/unique-number-of-occurrences>)
2+
3+
*All prompts are owned by LeetCode. To view the prompt, click the title link above.*
4+
5+
*[Back to top](<../README.md>)*
6+
7+
------
8+
9+
> *First completed : September 25, 2024*
10+
>
11+
> *Last updated : September 25, 2024*
12+
13+
------
14+
15+
> **Related Topics** : **[Array](<by_topic/Array.md>), [Hash Table](<by_topic/Hash Table.md>)**
16+
>
17+
> **Acceptance Rate** : **77.53 %**
18+
19+
------
20+
21+
## Solutions
22+
23+
- [e1207.py](<../my-submissions/e1207.py>)
24+
### Python
25+
#### [e1207.py](<../my-submissions/e1207.py>)
26+
```Python
27+
class Solution:
28+
def uniqueOccurrences(self, arr: List[int]) -> bool:
29+
cnt = Counter(arr)
30+
return len(cnt.values()) == len(set(cnt.values()))
31+
32+
```
33+

markdowns/by_topic/Array.md

Lines changed: 2 additions & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,4 +1,4 @@
1-
# [Array](<https://leetcode.com/tag/Array/>) (246 completed)
1+
# [Array](<https://leetcode.com/tag/Array/>) (247 completed)
22

33
*[Back to top](<../../README.md>)*
44

@@ -126,6 +126,7 @@
126126
| 1140 | [Stone Game II](<https://leetcode.com/problems/stone-game-ii>) | Medium | Daily | [solution](<../_1140. Stone Game II.md>) | py | Aug 20, 2024 |
127127
| 1160 | [Find Words That Can Be Formed by Characters](<https://leetcode.com/problems/find-words-that-can-be-formed-by-characters>) | Easy | | [solution](<../_1160. Find Words That Can Be Formed by Characters.md>) | py | Sep 24, 2024 |
128128
| 1184 | [Distance Between Bus Stops](<https://leetcode.com/problems/distance-between-bus-stops>) | Easy | | [solution](<../_1184. Distance Between Bus Stops.md>) | py | May 31, 2024 |
129+
| 1207 | [Unique Number of Occurrences](<https://leetcode.com/problems/unique-number-of-occurrences>) | Easy | | [solution](<../_1207. Unique Number of Occurrences.md>) | py | Sep 25, 2024 |
129130
| 1218 | [Longest Arithmetic Subsequence of Given Difference](<https://leetcode.com/problems/longest-arithmetic-subsequence-of-given-difference>) | Medium | | [solution](<../_1218. Longest Arithmetic Subsequence of Given Difference.md>) | py | May 31, 2024 |
130131
| 1229 | [Meeting Scheduler](<https://leetcode.com/problems/meeting-scheduler>) | Medium | Weekly Premium | [solution](<../_1229. Meeting Scheduler.md>) | py | Sep 10, 2024 |
131132
| 1230 | [Toss Strange Coins](<https://leetcode.com/problems/toss-strange-coins>) | Medium | Weekly Premium | [solution](<../_1230. Toss Strange Coins.md>) | c, java, py | Jul 29, 2024 |

markdowns/by_topic/Hash Table.md

Lines changed: 2 additions & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,4 +1,4 @@
1-
# [Hash Table](<https://leetcode.com/tag/Hash-Table/>) (113 completed)
1+
# [Hash Table](<https://leetcode.com/tag/Hash-Table/>) (114 completed)
22

33
*[Back to top](<../../README.md>)*
44

@@ -64,6 +64,7 @@
6464
| 1160 | [Find Words That Can Be Formed by Characters](<https://leetcode.com/problems/find-words-that-can-be-formed-by-characters>) | Easy | | [solution](<../_1160. Find Words That Can Be Formed by Characters.md>) | py | Sep 24, 2024 |
6565
| 1166 | [Design File System](<https://leetcode.com/problems/design-file-system>) | Medium | | [solution](<../_1166. Design File System.md>) | py | Jun 28, 2024 |
6666
| 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 |
67+
| 1207 | [Unique Number of Occurrences](<https://leetcode.com/problems/unique-number-of-occurrences>) | Easy | | [solution](<../_1207. Unique Number of Occurrences.md>) | py | Sep 25, 2024 |
6768
| 1218 | [Longest Arithmetic Subsequence of Given Difference](<https://leetcode.com/problems/longest-arithmetic-subsequence-of-given-difference>) | Medium | | [solution](<../_1218. Longest Arithmetic Subsequence of Given Difference.md>) | py | May 31, 2024 |
6869
| 1248 | [Count Number of Nice Subarrays](<https://leetcode.com/problems/count-number-of-nice-subarrays>) | Medium | Daily | [solution](<../_1248. Count Number of Nice Subarrays.md>) | py | Jun 22, 2024 |
6970
| 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 28, 2024 |

0 commit comments

Comments
 (0)