mirror of
https://github.com/krishnadey30/LeetCode-Questions-CompanyWise.git
synced 2025-12-28 05:34:42 +00:00
## 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 | 1 | Two Sum | 45.6% | Easy | 0.007050281837628458 | https://leetcode.com/problems/two-sum |
| 3 | 204 | Count Primes | 31.5% | Easy | 0.006761350978043845 | https://leetcode.com/problems/count-primes |
| 4 | 543 | Diameter of Binary Tree | 48.4% | Easy | 0.005047966297304777 | https://leetcode.com/problems/diameter-of-binary-tree |
| 5 | 20 | Valid Parentheses | 39.0% | Easy | 0.004938010692392608 | https://leetcode.com/problems/valid-parentheses |
| 6 | 234 | Palindrome Linked List | 39.3% | Easy | 0.0043299483107622555 | https://leetcode.com/problems/palindrome-linked-list |
| 7 | 238 | Product of Array Except Self | 60.1% | Medium | 0.003757284149658983 | https://leetcode.com/problems/product-of-array-except-self |
| 8 | 2 | Add Two Numbers | 33.9% | Medium | 0.003640486182288058 | https://leetcode.com/problems/add-two-numbers |
| 9 | 206 | Reverse Linked List | 62.5% | Easy | 0.002231770161393673 | https://leetcode.com/problems/reverse-linked-list |
| 10 | 21 | Merge Two Sorted Lists | 53.5% | Easy | 0.002158080146984904 | https://leetcode.com/problems/merge-two-sorted-lists |
| 11 | 53 | Maximum Subarray | 46.5% | Easy | 0.0020745819379855658 | https://leetcode.com/problems/maximum-subarray |
| 12 | 121 | Best Time to Buy and Sell Stock | 50.5% | Easy | 0.0020383211296970956 | https://leetcode.com/problems/best-time-to-buy-and-sell-stock |