mirror of
https://github.com/krishnadey30/LeetCode-Questions-CompanyWise.git
synced 2025-12-28 13:41: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)
```
1.2 KiB
1.2 KiB
| 1 | ID | Title | Acceptance | Difficulty | Frequency | Leetcode Question Link |
|---|---|---|---|---|---|---|
| 2 | 364 | Nested List Weight Sum II | 62.8% | Medium | 0.12431632201386382 | https://leetcode.com/problems/nested-list-weight-sum-ii |
| 3 | 1293 | Shortest Path in a Grid with Obstacles Elimination | 42.8% | Hard | 0.08167803101426718 | https://leetcode.com/problems/shortest-path-in-a-grid-with-obstacles-elimination |
| 4 | 815 | Bus Routes | 42.5% | Hard | 0.06127490750055161 | https://leetcode.com/problems/bus-routes |
| 5 | 1374 | Generate a String With Characters That Have Odd Counts | 75.4% | Easy | 0.05887900525002278 | https://leetcode.com/problems/generate-a-string-with-characters-that-have-odd-counts |
| 6 | 402 | Remove K Digits | 28.4% | Medium | 0.016240714250426138 | https://leetcode.com/problems/remove-k-digits |
| 7 | 863 | All Nodes Distance K in Binary Tree | 55.4% | Medium | 0.0161554402222852 | https://leetcode.com/problems/all-nodes-distance-k-in-binary-tree |
| 8 | 116 | Populating Next Right Pointers in Each Node | 45.2% | Medium | 0.007006509657930414 | https://leetcode.com/problems/populating-next-right-pointers-in-each-node |
| 9 | 4 | Median of Two Sorted Arrays | 29.6% | Hard | 0.00371713094107092 | https://leetcode.com/problems/median-of-two-sorted-arrays |
| 10 | 1 | Two Sum | 45.6% | Easy | 0.001767235914611495 | https://leetcode.com/problems/two-sum |