mirror of
https://github.com/McSmog/LeetCode-Questions-CompanyWise.git
synced 2026-04-19 16:56: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)
```
976 B
976 B
| 1 | ID | Title | Acceptance | Difficulty | Frequency | Leetcode Question Link |
|---|---|---|---|---|---|---|
| 2 | 811 | Subdomain Visit Count | 69.9% | Easy | 0.2537020331694895 | https://leetcode.com/problems/subdomain-visit-count |
| 3 | 224 | Basic Calculator | 36.8% | Hard | 0.17452286430813568 | https://leetcode.com/problems/basic-calculator |
| 4 | 68 | Text Justification | 27.7% | Hard | 0.16143214434637243 | https://leetcode.com/problems/text-justification |
| 5 | 718 | Maximum Length of Repeated Subarray | 49.4% | Medium | 0.10887697125309591 | https://leetcode.com/problems/maximum-length-of-repeated-subarray |
| 6 | 1197 | Minimum Knight Moves | 36.1% | Medium | 0.02969780239174205 | https://leetcode.com/problems/minimum-knight-moves |
| 7 | 227 | Basic Calculator II | 36.9% | Medium | 0.027685557859864054 | https://leetcode.com/problems/basic-calculator-ii |
| 8 | 362 | Design Hit Counter | 63.7% | Medium | 0.025382073271417165 | https://leetcode.com/problems/design-hit-counter |
| 9 | 1143 | Longest Common Subsequence | 58.4% | Medium | 0.008835931134362285 | https://leetcode.com/problems/longest-common-subsequence |