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)
```
1.2 KiB
1.2 KiB
| 1 | ID | Title | Acceptance | Difficulty | Frequency | Leetcode Question Link |
|---|---|---|---|---|---|---|
| 2 | 1130 | Minimum Cost Tree From Leaf Values | 66.1% | Medium | 0.20224156200426477 | https://leetcode.com/problems/minimum-cost-tree-from-leaf-values |
| 3 | 1163 | Last Substring in Lexicographical Order | 33.9% | Hard | 0.13476502218995134 | https://leetcode.com/problems/last-substring-in-lexicographical-order |
| 4 | 526 | Beautiful Arrangement | 57.8% | Medium | 0.11699160434169399 | https://leetcode.com/problems/beautiful-arrangement |
| 5 | 259 | 3Sum Smaller | 47.6% | Medium | 0.04951506452738057 | https://leetcode.com/problems/3sum-smaller |
| 6 | 1319 | Number of Operations to Make Network Connected | 53.1% | Medium | 0.04587960575069364 | https://leetcode.com/problems/number-of-operations-to-make-network-connected |
| 7 | 115 | Distinct Subsequences | 38.3% | Hard | 0.027798871362742988 | https://leetcode.com/problems/distinct-subsequences |
| 8 | 338 | Counting Bits | 69.5% | Medium | 0.01088446119842327 | https://leetcode.com/problems/counting-bits |
| 9 | 647 | Palindromic Substrings | 60.6% | Medium | 0.010400509768078022 | https://leetcode.com/problems/palindromic-substrings |
| 10 | 25 | Reverse Nodes in k-Group | 42.1% | Hard | 0.01021198560502829 | https://leetcode.com/problems/reverse-nodes-in-k-group |
| 11 | 206 | Reverse Linked List | 62.5% | Easy | 0.009326794511974934 | https://leetcode.com/problems/reverse-linked-list |