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.7 KiB
1.7 KiB
| 1 | ID | Title | Acceptance | Difficulty | Frequency | Leetcode Question Link |
|---|---|---|---|---|---|---|
| 2 | 920 | Number of Music Playlists | 46.5% | Hard | 2.1617959520941517 | https://leetcode.com/problems/number-of-music-playlists |
| 3 | 453 | Minimum Moves to Equal Array Elements | 50.2% | Easy | 1.6379595379336402 | https://leetcode.com/problems/minimum-moves-to-equal-array-elements |
| 4 | 68 | Text Justification | 27.7% | Hard | 1.5875791186216013 | https://leetcode.com/problems/text-justification |
| 5 | 761 | Special Binary String | 54.7% | Hard | 1.38007672450902 | https://leetcode.com/problems/special-binary-string |
| 6 | 10 | Regular Expression Matching | 26.8% | Hard | 0.8562403103485083 | https://leetcode.com/problems/regular-expression-matching |
| 7 | 713 | Subarray Product Less Than K | 39.1% | Medium | 0.621799099762479 | https://leetcode.com/problems/subarray-product-less-than-k |
| 8 | 780 | Reaching Points | 29.4% | Hard | 0.3635937067449341 | https://leetcode.com/problems/reaching-points |
| 9 | 239 | Sliding Window Maximum | 43.0% | Hard | 0.14289853479023557 | https://leetcode.com/problems/sliding-window-maximum |
| 10 | 44 | Wildcard Matching | 24.7% | Hard | 0.11223226506783546 | https://leetcode.com/problems/wildcard-matching |
| 11 | 1112 | Highest Grade For Each Student | 69.5% | Medium | 0.06453852113757116 | https://leetcode.com/problems/highest-grade-for-each-student |
| 12 | 647 | Palindromic Substrings | 60.6% | Medium | 0.039530838756635246 | https://leetcode.com/problems/palindromic-substrings |
| 13 | 15 | 3Sum | 26.8% | Medium | 0.012936791030719435 | https://leetcode.com/problems/3sum |
| 14 | 392 | Is Subsequence | 49.2% | Easy | 0.008688151957637906 | https://leetcode.com/problems/is-subsequence |
| 15 | 945 | Minimum Increment to Make Array Unique | 46.3% | Medium | 0 | https://leetcode.com/problems/minimum-increment-to-make-array-unique |
| 16 | 1137 | N-th Tribonacci Number | 55.9% | Easy | 0 | https://leetcode.com/problems/n-th-tribonacci-number |