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)
```
2.0 KiB
2.0 KiB
| 1 | ID | Title | Acceptance | Difficulty | Frequency | Leetcode Question Link |
|---|---|---|---|---|---|---|
| 2 | 1473 | Paint House III | 48.1% | Hard | 0.3658010975821623 | https://leetcode.com/problems/paint-house-iii |
| 3 | 1497 | Check If Array Pairs Are Divisible by k | 41.1% | Medium | 0.2357666456855048 | https://leetcode.com/problems/check-if-array-pairs-are-divisible-by-k |
| 4 | 1041 | Robot Bounded In Circle | 49.6% | Medium | 0.10573219378884732 | https://leetcode.com/problems/robot-bounded-in-circle |
| 5 | 1297 | Maximum Number of Occurrences of a Substring | 47.3% | Medium | 0.07770898432731625 | https://leetcode.com/problems/maximum-number-of-occurrences-of-a-substring |
| 6 | 56 | Merge Intervals | 39.3% | Medium | 0.04173304225331761 | https://leetcode.com/problems/merge-intervals |
| 7 | 324 | Wiggle Sort II | 29.9% | Medium | 0.02898753687325229 | https://leetcode.com/problems/wiggle-sort-ii |
| 8 | 68 | Text Justification | 27.7% | Hard | 0.0276451606661453 | https://leetcode.com/problems/text-justification |
| 9 | 12 | Integer to Roman | 55.1% | Medium | 0.019096697456456382 | https://leetcode.com/problems/integer-to-roman |
| 10 | 73 | Set Matrix Zeroes | 43.1% | Medium | 0.015715357479628243 | https://leetcode.com/problems/set-matrix-zeroes |
| 11 | 977 | Squares of a Sorted Array | 72.1% | Easy | 0.015474196582597383 | https://leetcode.com/problems/squares-of-a-sorted-array |
| 12 | 227 | Basic Calculator II | 36.9% | Medium | 0.01239941490503826 | https://leetcode.com/problems/basic-calculator-ii |
| 13 | 20 | Valid Parentheses | 39.0% | Easy | 0.009170695326061695 | https://leetcode.com/problems/valid-parentheses |
| 14 | 128 | Longest Consecutive Sequence | 45.1% | Hard | 0.009051883485315484 | https://leetcode.com/problems/longest-consecutive-sequence |
| 15 | 876 | Middle of the Linked List | 68.4% | Easy | 0.007624893975696915 | https://leetcode.com/problems/middle-of-the-linked-list |
| 16 | 53 | Maximum Subarray | 46.5% | Easy | 0.004869349014182134 | https://leetcode.com/problems/maximum-subarray |
| 17 | 146 | LRU Cache | 33.2% | Medium | 0.004600353139061353 | https://leetcode.com/problems/lru-cache |
| 18 | 1 | Two Sum | 45.6% | Easy | 0.003278422738041615 | https://leetcode.com/problems/two-sum |
| 19 | 2 | Add Two Numbers | 33.9% | Medium | 0.0016886191111440908 | https://leetcode.com/problems/add-two-numbers |