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)
```
7 lines
626 B
CSV
7 lines
626 B
CSV
ID,Title,Acceptance,Difficulty,Frequency,Leetcode Question Link
|
|
121,Best Time to Buy and Sell Stock,50.5%,Easy,0.007502371594599209, https://leetcode.com/problems/best-time-to-buy-and-sell-stock
|
|
41,First Missing Positive,32.0%,Hard,0.005444881762408285, https://leetcode.com/problems/first-missing-positive
|
|
160,Intersection of Two Linked Lists,40.6%,Easy,0.003934945881316586, https://leetcode.com/problems/intersection-of-two-linked-lists
|
|
53,Maximum Subarray,46.5%,Easy,0.003902924955778234, https://leetcode.com/problems/maximum-subarray
|
|
1,Two Sum,45.6%,Easy,0.00184543512358731, https://leetcode.com/problems/two-sum
|