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)
```
1.5 KiB
1.5 KiB
| 1 | ID | Title | Acceptance | Difficulty | Frequency | Leetcode Question Link |
|---|---|---|---|---|---|---|
| 2 | 708 | Insert into a Sorted Circular Linked List | 31.6% | Medium | 0.6963635371787209 | https://leetcode.com/problems/insert-into-a-sorted-circular-linked-list |
| 3 | 855 | Exam Room | 43.1% | Medium | 0.5147127208812607 | https://leetcode.com/problems/exam-room |
| 4 | 510 | Inorder Successor in BST II | 58.0% | Medium | 0.3274381237537068 | https://leetcode.com/problems/inorder-successor-in-bst-ii |
| 5 | 761 | Special Binary String | 54.7% | Hard | 0.3007541540191337 | https://leetcode.com/problems/special-binary-string |
| 6 | 362 | Design Hit Counter | 63.7% | Medium | 0.2737682417732349 | https://leetcode.com/problems/design-hit-counter |
| 7 | 285 | Inorder Successor in BST | 40.4% | Medium | 0.08649364464568089 | https://leetcode.com/problems/inorder-successor-in-bst |
| 8 | 88 | Merge Sorted Array | 39.4% | Easy | 0.011986958032982505 | https://leetcode.com/problems/merge-sorted-array |
| 9 | 17 | Letter Combinations of a Phone Number | 46.8% | Medium | 0.00987716546167603 | https://leetcode.com/problems/letter-combinations-of-a-phone-number |
| 10 | 208 | Implement Trie (Prefix Tree) | 49.4% | Medium | 0.009105457856626612 | https://leetcode.com/problems/implement-trie-prefix-tree |
| 11 | 54 | Spiral Matrix | 34.1% | Medium | 0.0065941551175130245 | https://leetcode.com/problems/spiral-matrix |
| 12 | 34 | Find First and Last Position of Element in Sorted Array | 36.2% | Medium | 0.004247643638268045 | https://leetcode.com/problems/find-first-and-last-position-of-element-in-sorted-array |
| 13 | 1309 | Decrypt String from Alphabet to Integer Mapping | 76.8% | Easy | 0 | https://leetcode.com/problems/decrypt-string-from-alphabet-to-integer-mapping |