mirror of
https://github.com/McSmog/LeetCode-Questions-CompanyWise.git
synced 2026-04-19 08:46: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)
```
941 B
941 B
| 1 | ID | Title | Acceptance | Difficulty | Frequency | Leetcode Question Link |
|---|---|---|---|---|---|---|
| 2 | 202 | Happy Number | 50.4% | Easy | 2.6221547901764026 | https://leetcode.com/problems/happy-number |
| 3 | 20 | Valid Parentheses | 39.0% | Easy | 1.3406280912261581 | https://leetcode.com/problems/valid-parentheses |
| 4 | 1328 | Break a Palindrome | 43.3% | Medium | 0.05910139227591337 | https://leetcode.com/problems/break-a-palindrome |
| 5 | 121 | Best Time to Buy and Sell Stock | 50.5% | Easy | 0.00846879565300311 | https://leetcode.com/problems/best-time-to-buy-and-sell-stock |
| 6 | 200 | Number of Islands | 46.8% | Medium | 0.006490251382779317 | https://leetcode.com/problems/number-of-islands |
| 7 | 31 | Next Permutation | 32.6% | Medium | 0.005989835219179644 | https://leetcode.com/problems/next-permutation |
| 8 | 215 | Kth Largest Element in an Array | 55.4% | Medium | 0.003902443976931749 | https://leetcode.com/problems/kth-largest-element-in-an-array |
| 9 | 53 | Maximum Subarray | 46.5% | Easy | 0.002167082872150794 | https://leetcode.com/problems/maximum-subarray |