Skip to content
This repository was archived by the owner on Dec 22, 2023. It is now read-only.

Commit 04c2958

Browse files
[ADD] documentation for scraper added
1 parent d4c896e commit 04c2958

File tree

3 files changed

+60
-0
lines changed

3 files changed

+60
-0
lines changed
Lines changed: 25 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,25 @@
1+
# LeetCode Scraper
2+
3+
Takes [LeetCode](https://leetcode.com/) problem code as command line argument scrapes the problem statement and saves it in a text file.
4+
5+
### Prerequisites
6+
7+
Installing prerequisites:
8+
```bash
9+
$pip install -r requirements.txt
10+
```
11+
12+
### How to run the script
13+
14+
Running the script
15+
```bash
16+
$python3 leet_code_scraper.py [problem code]
17+
```
18+
### Screenshot/GIF showing the sample use of the script
19+
20+
![Screenshot of output](./output.png)
21+
22+
23+
## *Author Name*
24+
25+
[Mahesh Bharadwaj K](https://github.com/MaheshBharadwaj)
135 KB
Loading
Lines changed: 35 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,35 @@
1+
You are given an array of k linked-lists lists, each linked-list is sorted in
2+
ascending order.
3+
Merge all the linked-lists into one sorted linked-list and return it.
4+
 
5+
Example 1:
6+
Input: lists = [[1,4,5],[1,3,4],[2,6]]
7+
Output: [1,1,2,3,4,4,5,6]
8+
Explanation: The linked-lists are:
9+
[
10+
1->4->5,
11+
1->3->4,
12+
2->6
13+
]
14+
merging them into one sorted list:
15+
1->1->2->3->4->4->5->6
16+
17+
Example 2:
18+
Input: lists = []
19+
Output: []
20+
21+
Example 3:
22+
Input: lists = [[]]
23+
Output: []
24+
25+
 
26+
Constraints:
27+
28+
k == lists.length
29+
0 <= k <= 10^4
30+
0 <= lists[i].length <= 500
31+
-10^4 <= lists[i][j] <= 10^4
32+
lists[i] is sorted in ascending order.
33+
The sum of lists[i].length won't exceed 10^4.
34+
35+

0 commit comments

Comments
 (0)