mirror of
https://github.com/krishnadey30/LeetCode-Questions-CompanyWise.git
synced 2025-12-28 05:34:42 +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)
```
457 B
457 B
| 1 | ID | Title | Acceptance | Difficulty | Frequency | Leetcode Question Link |
|---|---|---|---|---|---|---|
| 2 | 1323 | Maximum 69 Number | 77.9% | Easy | 0.01658412801553527 | https://leetcode.com/problems/maximum-69-number |
| 3 | 1317 | Convert Integer to the Sum of Two No-Zero Integers | 56.8% | Easy | 0 | https://leetcode.com/problems/convert-integer-to-the-sum-of-two-no-zero-integers |
| 4 | 1342 | Number of Steps to Reduce a Number to Zero | 86.3% | Easy | 0 | https://leetcode.com/problems/number-of-steps-to-reduce-a-number-to-zero |