mirror of
https://github.com/McSmog/LeetCode-Questions-CompanyWise.git
synced 2026-04-19 08:46:45 +00:00
## 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)
```
951 B
951 B
| 1 | ID | Title | Acceptance | Difficulty | Frequency | Leetcode Question Link |
|---|---|---|---|---|---|---|
| 2 | 498 | Diagonal Traverse | 48.2% | Medium | 0.046617066297050695 | https://leetcode.com/problems/diagonal-traverse |
| 3 | 130 | Surrounded Regions | 28.1% | Medium | 0.02556231203780306 | https://leetcode.com/problems/surrounded-regions |
| 4 | 236 | Lowest Common Ancestor of a Binary Tree | 45.7% | Medium | 0.004507557778555423 | https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-tree |
| 5 | 146 | LRU Cache | 33.2% | Medium | 0.004370636328108912 | https://leetcode.com/problems/lru-cache |
| 6 | 238 | Product of Array Except Self | 60.1% | Medium | 0.003757284149658983 | https://leetcode.com/problems/product-of-array-except-self |
| 7 | 977 | Squares of a Sorted Array | 72.1% | Easy | 0.003733088796375401 | https://leetcode.com/problems/squares-of-a-sorted-array |
| 8 | 1 | Two Sum | 45.6% | Easy | 0.003139596786381058 | https://leetcode.com/problems/two-sum |
| 9 | 20 | Valid Parentheses | 39.0% | Easy | 0.002197682330605871 | https://leetcode.com/problems/valid-parentheses |