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.3 KiB
1.3 KiB
| 1 | ID | Title | Acceptance | Difficulty | Frequency | Leetcode Question Link |
|---|---|---|---|---|---|---|
| 2 | 121 | Best Time to Buy and Sell Stock | 50.5% | Easy | 0.17732840429038763 | https://leetcode.com/problems/best-time-to-buy-and-sell-stock |
| 3 | 1 | Two Sum | 45.6% | Easy | 0.11788787746803375 | https://leetcode.com/problems/two-sum |
| 4 | 160 | Intersection of Two Linked Lists | 40.6% | Easy | 0.05844735064567987 | https://leetcode.com/problems/intersection-of-two-linked-lists |
| 5 | 17 | Letter Combinations of a Phone Number | 46.8% | Medium | 0.03893646375009422 | https://leetcode.com/problems/letter-combinations-of-a-phone-number |
| 6 | 20 | Valid Parentheses | 39.0% | Easy | 0.03618871742239114 | https://leetcode.com/problems/valid-parentheses |
| 7 | 53 | Maximum Subarray | 46.5% | Easy | 0.02622855485962836 | https://leetcode.com/problems/maximum-subarray |
| 8 | 146 | LRU Cache | 33.2% | Medium | 0.01827577993873683 | https://leetcode.com/problems/lru-cache |
| 9 | 242 | Valid Anagram | 56.9% | Easy | 0.016513947375674708 | https://leetcode.com/problems/valid-anagram |
| 10 | 41 | First Missing Positive | 32.0% | Hard | 0.0064113058208121855 | https://leetcode.com/problems/first-missing-positive |
| 11 | 50 | Pow(x;n) | 30.3% | Medium | 0.0055950070772402055 | https://leetcode.com/problems/powx-n |
| 12 | 155 | Min Stack | 44.5% | Easy | 0.00474891074128171 | https://leetcode.com/problems/min-stack |
| 13 | 1217 | Play with Chips | 64.2% | Easy | 0 | https://leetcode.com/problems/play-with-chips |