Skip to content

Commit bb4aed6

Browse files
muffafamuffafa
committed
project structure reorganized & some files renamed
1 parent bed21d5 commit bb4aed6

File tree

14 files changed

+29
-28
lines changed

14 files changed

+29
-28
lines changed

‎Python/0001-two-sum/two-sum.md renamed to ‎Python/0001-two-sum/1-answer.md

File renamed without changes.

‎Python/0001-two-sum/two-sum-hash.md renamed to ‎Python/0001-two-sum/2-answer.md

File renamed without changes.

‎Python/0001-two-sum/q-two-sum.md renamed to ‎Python/0001-two-sum/question.md

+4-4
Original file line numberDiff line numberDiff line change
@@ -35,7 +35,7 @@ You can return the answer in any order.
3535

3636
## 🔐 Solutions
3737

38-
| ID | METHOD | LINK |
39-
| :-- | :---------: | :--------------------------------- |
40-
| 1 | Brute Force | [two-sum.md](two-sum.md) |
41-
| 2 | Hash Table | [two-sum-hash.md](two-sum-hash.md) |
38+
| ID | METHOD |
39+
| :-- | :------------------------: |
40+
| 1 | [Brute Force](1-answer.md) |
41+
| 2 | [Hash Table](2-answer.md) |

‎Python/0049-group-anagram/group-anagram.md renamed to ‎Python/0049-group-anagram/1-answer.md

File renamed without changes.

‎Python/0049-group-anagram/q-group-anagram.md renamed to ‎Python/0049-group-anagram/question.md

+3-3
Original file line numberDiff line numberDiff line change
@@ -33,6 +33,6 @@ An **Anagram** is a word or phrase formed by rearranging the letters of a differ
3333
## 🔐 Solutions
3434
<!-- Solutions of problem and their links. -->
3535

36-
| ID | METHOD | LINK |
37-
| :-- | :--------------------: | :----------------------- |
38-
| 1 | Counts the Frequencies | [group-anagram](group-anagram.md) |
36+
| ID | METHOD |
37+
| :-- | :-----------------------------------: |
38+
| 1 | [Counts the Frequencies](1-answer.md) |

‎Python/0217-contains-duplicate/contains-duplicate.md renamed to ‎Python/0217-contains-duplicate/1-answer.md

File renamed without changes.

‎Python/0217-contains-duplicate/q-contains-duplicate.md renamed to ‎Python/0217-contains-duplicate/question.md

+3-3
Original file line numberDiff line numberDiff line change
@@ -18,6 +18,6 @@ Given an integer array `nums`, return `true` if any value appears **at least twi
1818
## 🔐 Solutions
1919
<!-- Solutions of problem and their links. -->
2020

21-
| ID | METHOD | LINK |
22-
| :-- | :------: | :--------------------------------------------- |
23-
| 1 | Hash Set | [contains-duplicate.md](contains-duplicate.md) |
21+
| ID | METHOD |
22+
| :-- | :---------------------: |
23+
| 1 | [Hash Set](1-answer.md) |

‎Python/0238-product-of-array-except-self/product-of-array-except-self.md renamed to ‎Python/0238-product-of-array-except-self/1-answer.md

File renamed without changes.

‎Python/0238-product-of-array-except-self/q-product-of-array-except-self.md renamed to ‎Python/0238-product-of-array-except-self/question.md

+3-3
Original file line numberDiff line numberDiff line change
@@ -32,6 +32,6 @@ Can you solve the problem in `O(1)` extra space complexity? (The output array *
3232
## 🔐 Solutions
3333
<!-- Solutions of problem and their links. -->
3434

35-
| ID | METHOD | LINK |
36-
| :-- | :-----: | :----------------------------------------------------------------- |
37-
| 1 | example | [product-of-array-except-self.md](product-of-array-except-self.md) |
35+
| ID | METHOD |
36+
| :-- | :--------------------: |
37+
| 1 | [example](1-answer.md) |

‎Python/0242-valid-anagram/valid-anagram.md renamed to ‎Python/0242-valid-anagram/1-answer.md

File renamed without changes.

‎Python/0242-valid-anagram/q-valid-anagram.md renamed to ‎Python/0242-valid-anagram/question.md

+3-3
Original file line numberDiff line numberDiff line change
@@ -30,6 +30,6 @@ What if the inputs contain Unicode characters? How would you adapt your solution
3030
## 🔐 Solutions
3131
<!-- Solutions of problem and their links. -->
3232

33-
| ID | METHOD | LINK |
34-
| :-- | :--------------------: | :----------------------------------- |
35-
| 1 | Counts the Frequencies | [valid-anagram.md](valid-anagram.md) |
33+
| ID | METHOD |
34+
| :-- | :-----------------------------------: |
35+
| 1 | [Counts the Frequencies](1-answer.md) |

‎Python/0347-top-k-frequent-elements/top-k-frequent-elements.md renamed to ‎Python/0347-top-k-frequent-elements/1-answer.md

+2-1
Original file line numberDiff line numberDiff line change
@@ -6,9 +6,10 @@ Explain the approach
66

77
## 🔐 Code
88

9-
``` c
9+
``` python
1010
printf("Hello World");
1111
```
12+
1213
## 🧩 Complexity
1314

1415
- Time complexity:

‎Python/0347-top-k-frequent-elements/q-top-k-frequent-elements.md renamed to ‎Python/0347-top-k-frequent-elements/question.md

+3-3
Original file line numberDiff line numberDiff line change
@@ -30,6 +30,6 @@ Your algorithm's time complexity must be better than `O(n log n)`, where n is th
3030
## 🔐 Solutions
3131
<!-- Solutions of problem and their links. -->
3232

33-
| ID | METHOD | LINK |
34-
| :-- | :-----: | :------------------------------------------------------- |
35-
| 1 | example | [top-k-frequent-elements.md](top-k-frequent-elements.md) |
33+
| ID | METHOD |
34+
| :-- | :--------------------: |
35+
| 1 | [example](1-answer.md) |

‎Python/README.md

+8-8
Original file line numberDiff line numberDiff line change
@@ -36,11 +36,11 @@ Each .md file for a solution includes:
3636

3737
---
3838

39-
| ID | Leetcode ID | 👀 Question Name | 📦 Category | 🔥 Difficulty |
40-
| --- | :---------- | :-------------------------------------------------------------------------------------------------: | ---------------- | -------------- |
41-
| 1 | 0001 | [Two Sum](0001-two-sum/q-two-sum.md) | Arrays & Hashing | Easy |
42-
| 2 | 0217 | [Contains Duplicate](0217-contains-duplicate/q-contains-duplicate.md) | Arrays & Hashing | Easy |
43-
| 3 | 0242 | [Valid Anagram](0242-valid-anagram/q-valid-anagram.md) | Arrays & Hashing | Easy |
44-
| 4 | 0049 | [Group Anagram](0049-group-anagram/q-group-anagram.md) | Arrays & Hashing | Easy |
45-
| 5 | 0347 | [Top K Frequent Elements](0347-top-k-frequent-elements/q-top-k-frequent-elements.md) | Arrays & Hashing | Easy |
46-
| 6 | 0238 | [Product Of Array Except Self](0238-product-of-array-except-self/q-product-of-array-except-self.md) | Arrays & Hashing | Easy |
39+
| ID | Leetcode ID | 👀 Question Name | 📦 Category | 🔥 Difficulty |
40+
| --- | :---------- | :---------------------------------------------------------------------------: | ---------------- | -------------- |
41+
| 1 | 0001 | [Two Sum](0001-two-sum/question.md) | Arrays & Hashing | Easy |
42+
| 2 | 0217 | [Contains Duplicate](0217-contains-duplicate/question.md) | Arrays & Hashing | Easy |
43+
| 3 | 0242 | [Valid Anagram](0242-valid-anagram/question.md) | Arrays & Hashing | Easy |
44+
| 4 | 0049 | [Group Anagram](0049-group-anagram/question.md) | Arrays & Hashing | Easy |
45+
| 5 | 0347 | [Top K Frequent Elements](0347-top-k-frequent-elements/question.md) | Arrays & Hashing | Easy |
46+
| 6 | 0238 | [Product Of Array Except Self](0238-product-of-array-except-self/question.md) | Arrays & Hashing | Easy |

0 commit comments

Comments
 (0)