mirror of
https://github.com/krishnadey30/LeetCode-Questions-CompanyWise.git
synced 2025-12-28 05:34: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)
```
944 B
944 B
| 1 | ID | Title | Acceptance | Difficulty | Frequency | Leetcode Question Link |
|---|---|---|---|---|---|---|
| 2 | 529 | Minesweeper | 59.1% | Medium | 0.09420878206672367 | https://leetcode.com/problems/minesweeper |
| 3 | 575 | Distribute Candies | 61.4% | Easy | 0.08329002108922262 | https://leetcode.com/problems/distribute-candies |
| 4 | 581 | Shortest Unsorted Continuous Subarray | 31.1% | Easy | 0.05007303798232116 | https://leetcode.com/problems/shortest-unsorted-continuous-subarray |
| 5 | 785 | Is Graph Bipartite? | 47.5% | Medium | 0.041978881338661234 | https://leetcode.com/problems/is-graph-bipartite |
| 6 | 20 | Valid Parentheses | 39.0% | Easy | 0.008761898231759775 | https://leetcode.com/problems/valid-parentheses |
| 7 | 200 | Number of Islands | 46.8% | Medium | 0.002765297303115152 | https://leetcode.com/problems/number-of-islands |
| 8 | 594 | Longest Harmonious Subsequence | 46.6% | Easy | 0 | https://leetcode.com/problems/longest-harmonious-subsequence |
| 9 | 949 | Largest Time for Given Digits | 35.8% | Easy | 0 | https://leetcode.com/problems/largest-time-for-given-digits |