Skip to content

Commit bb4aed6

Browse files
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
File renamed without changes.
File renamed without changes.

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

Lines changed: 4 additions & 4 deletions
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/q-group-anagram.md renamed to Python/0049-group-anagram/question.md

Lines changed: 3 additions & 3 deletions
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/q-contains-duplicate.md renamed to Python/0217-contains-duplicate/question.md

Lines changed: 3 additions & 3 deletions
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/q-product-of-array-except-self.md renamed to Python/0238-product-of-array-except-self/question.md

Lines changed: 3 additions & 3 deletions
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) |

0 commit comments

Comments
 (0)