Skip to content

Commit 57c3d05

Browse files
committed
chore: moved files to parent dir
1 parent 55a4b1a commit 57c3d05

File tree

25 files changed

+5
-7
lines changed

25 files changed

+5
-7
lines changed
Lines changed: 1 addition & 3 deletions
Original file line numberDiff line numberDiff line change
@@ -6,20 +6,18 @@ You may assume that each input would have **exactly one solution**, and you may
66

77
You can return the answer in any order.
88

9-
### Example 1
9+
### Examples
1010
```
1111
Input: nums = [2,7,11,15], target = 9
1212
Output: [0, 1]
1313
Explanation: Because nums[0] + nums[1] == 9, we return [0, 1].
1414
```
1515

16-
### Example 2
1716
```
1817
Input: nums = [3,2,4], target = 6
1918
Output: [1,2]
2019
```
2120

22-
### Example 3
2321
```
2422
Input: nums = [3,3], target = 6
2523
Output: [0,1]
Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -60,7 +60,7 @@ const bruteForce = (nums: number[], target: number): number[] =>{
6060
};
6161

6262
exportconstTWO_SUM: LeetcodeProblem<number[]>={
63-
name: "1. Two Sum",
63+
name: "Two Sum",
6464
code: "1",
6565
tags: ["Array"],
6666
solutions: [
File renamed without changes.
File renamed without changes.
Lines changed: 3 additions & 3 deletions
Original file line numberDiff line numberDiff line change
@@ -1,7 +1,7 @@
11
importtype{InputTestData}from"shared/typings/input-data";
22

33
exportconstTEST_DATA: InputTestData<{nums: number[];target: number},number[]>[]=[
4-
// Basic cases within constraints:
4+
// Basic cases within constraints
55
{input: {nums: [2,7,11,15],target: 9},expected: [0,1]},
66
{input: {nums: [3,2,4],target: 6},expected: [1,2]},
77
{input: {nums: [5,5],target: 10},expected: [0,1]},
@@ -15,11 +15,11 @@ export const TEST_DATA: InputTestData<{nums: number[]; target: number }, number
1515
expected: [18,19],
1616
},
1717

18-
// Test cases at element value limits:
18+
// Test cases at element value limits
1919
{input: {nums: [-1000000000,0,1000000000],target: 0},expected: [0,2]},
2020
{input: {nums: [1000000000,999999999],target: 1999999999},expected: [0,1]},
2121

22-
// Test cases with valid solutions but near value limits:
22+
// Test cases with valid solutions but near value limits
2323
{input: {nums: [-999999999,1],target: -999999998},expected: [0,1]},
2424
{input: {nums: [999999998,1],target: 999999999},expected: [0,1]},
2525
];

src/arrays/121-best-time-to-buy-and-sell-stock/README.md renamed to src/problems/121-best-time-to-buy-and-sell-stock/README.md

File renamed without changes.

src/arrays/121-best-time-to-buy-and-sell-stock/index.ts renamed to src/problems/121-best-time-to-buy-and-sell-stock/index.ts

File renamed without changes.

src/arrays/121-best-time-to-buy-and-sell-stock/tests/index.bench.ts renamed to src/problems/121-best-time-to-buy-and-sell-stock/tests/index.bench.ts

File renamed without changes.

src/arrays/121-best-time-to-buy-and-sell-stock/tests/index.spec.ts renamed to src/problems/121-best-time-to-buy-and-sell-stock/tests/index.spec.ts

File renamed without changes.

src/arrays/121-best-time-to-buy-and-sell-stock/tests/test-data.ts renamed to src/problems/121-best-time-to-buy-and-sell-stock/tests/test-data.ts

File renamed without changes.

0 commit comments

Comments
(0)