mirror of
https://github.com/McSmog/LeetCode-Questions-CompanyWise.git
synced 2026-04-19 16:56: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)
```
13 lines
1.1 KiB
CSV
13 lines
1.1 KiB
CSV
ID,Title,Acceptance,Difficulty,Frequency,Leetcode Question Link
|
|
134,Gas Station,38.5%,Medium,0.029647681078235767, https://leetcode.com/problems/gas-station
|
|
259,3Sum Smaller,47.6%,Medium,0.026117496831033614, https://leetcode.com/problems/3sum-smaller
|
|
700,Search in a Binary Search Tree,73.1%,Easy,0.01905222743200806, https://leetcode.com/problems/search-in-a-binary-search-tree
|
|
88,Merge Sorted Array,39.4%,Easy,0.011986958032982505, https://leetcode.com/problems/merge-sorted-array
|
|
20,Valid Parentheses,39.0%,Easy,0.009170695326061695, https://leetcode.com/problems/valid-parentheses
|
|
15,3Sum,26.8%,Medium,0.004940992758742591, https://leetcode.com/problems/3sum
|
|
268,Missing Number,51.7%,Easy,0.0048804391649084865, https://leetcode.com/problems/missing-number
|
|
2,Add Two Numbers,33.9%,Medium,0.00379539105290024, https://leetcode.com/problems/add-two-numbers
|
|
14,Longest Common Prefix,35.4%,Easy,0.003320331762984143, https://leetcode.com/problems/longest-common-prefix
|
|
1,Two Sum,45.6%,Easy,0.003278422738041615, https://leetcode.com/problems/two-sum
|
|
53,Maximum Subarray,46.5%,Easy,0.002167082872150794, https://leetcode.com/problems/maximum-subarray
|