mirror of
https://github.com/McSmog/LeetCode-Questions-CompanyWise.git
synced 2026-04-19 16:56:45 +00:00
fb5f78b55e
## Description
- Add headers to all the CSV files
## Script used
```py
import csv
import os
# Set the path of the folder containing the CSV files
folder_path = "./LeetCode-Questions-CompanyWise"
headers = [
"ID",
"Title",
"Acceptance",
"Difficulty",
"Frequency",
"Leetcode Question Link",
]
# Loop through all the CSV files in the folder
for file_name in os.listdir(folder_path):
if file_name.endswith(".csv"):
# Read the CSV file into a list of rows
file_path = os.path.join(folder_path, file_name)
with open(file_path, "r") as f:
reader = csv.reader(f)
rows = list(reader)
has_headers = False
if len(rows) > 0 and rows[0] == headers:
has_headers = True
if not has_headers:
rows.insert(0, headers)
# Write the list of rows back to the CSV file
with open(file_path, "w", newline="") as f:
writer = csv.writer(f)
writer.writerows(rows)
```
1.0 KiB
1.0 KiB
| 1 | ID | Title | Acceptance | Difficulty | Frequency | Leetcode Question Link |
|---|---|---|---|---|---|---|
| 2 | 1242 | Web Crawler Multithreaded | 45.9% | Medium | 0.3795917253315977 | https://leetcode.com/problems/web-crawler-multithreaded |
| 3 | 722 | Remove Comments | 34.6% | Medium | 0.2913421223844446 | https://leetcode.com/problems/remove-comments |
| 4 | 314 | Binary Tree Vertical Order Traversal | 45.3% | Medium | 0.20100106920044414 | https://leetcode.com/problems/binary-tree-vertical-order-traversal |
| 5 | 380 | Insert Delete GetRandom O(1) | 47.5% | Medium | 0.1466146891661091 | https://leetcode.com/problems/insert-delete-getrandom-o1 |
| 6 | 41 | First Missing Positive | 32.0% | Hard | 0.056273635982108605 | https://leetcode.com/problems/first-missing-positive |
| 7 | 239 | Sliding Window Maximum | 43.0% | Hard | 0.0483746857022364 | https://leetcode.com/problems/sliding-window-maximum |
| 8 | 987 | Vertical Order Traversal of a Binary Tree | 36.6% | Medium | 0.011601058182762062 | https://leetcode.com/problems/vertical-order-traversal-of-a-binary-tree |
| 9 | 10 | Regular Expression Matching | 26.8% | Hard | 0.0071865203293987245 | https://leetcode.com/problems/regular-expression-matching |