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)
```
11 lines
1.1 KiB
CSV
11 lines
1.1 KiB
CSV
ID,Title,Acceptance,Difficulty,Frequency,Leetcode Question Link
|
|
811,Subdomain Visit Count,69.9%,Easy,0.7210003114031188, https://leetcode.com/problems/subdomain-visit-count
|
|
770,Basic Calculator IV,48.1%,Hard,0.538996500732687, https://leetcode.com/problems/basic-calculator-iv
|
|
224,Basic Calculator,36.8%,Hard,0.3569926900622552, https://leetcode.com/problems/basic-calculator
|
|
718,Maximum Length of Repeated Subarray,49.4%,Medium,0.3017806373775875, https://leetcode.com/problems/maximum-length-of-repeated-subarray
|
|
68,Text Justification,27.7%,Hard,0.22496389768259162, https://leetcode.com/problems/text-justification
|
|
1197,Minimum Knight Moves,36.1%,Medium,0.06562120535847293, https://leetcode.com/problems/minimum-knight-moves
|
|
362,Design Hit Counter,63.7%,Medium,0.05622967649867821, https://leetcode.com/problems/design-hit-counter
|
|
227,Basic Calculator II,36.9%,Medium,0.027685557859864054, https://leetcode.com/problems/basic-calculator-ii
|
|
1143,Longest Common Subsequence,58.4%,Medium,0.008835931134362285, https://leetcode.com/problems/longest-common-subsequence
|