mirror of
https://github.com/McSmog/LeetCode-Questions-CompanyWise.git
synced 2026-04-19 16:56:45 +00:00
Chore: Add headers to all the files (#54)
## 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)
```
This commit is contained in:
committed by
GitHub
parent
0aeadbd612
commit
fb5f78b55e
@@ -1,8 +1,9 @@
|
||||
250,Count Univalue Subtrees,52.0%,Medium,1.7195134036164268, https://leetcode.com/problems/count-univalue-subtrees
|
||||
965,Univalued Binary Tree,67.7%,Easy,1.2504050329534637, https://leetcode.com/problems/univalued-binary-tree
|
||||
68,Text Justification,27.7%,Hard,0.7812966622905007, https://leetcode.com/problems/text-justification
|
||||
935,Knight Dialer,45.2%,Medium,0.5465437063680699, https://leetcode.com/problems/knight-dialer
|
||||
191,Number of 1 Bits,49.8%,Easy,0.3920623591078002, https://leetcode.com/problems/number-of-1-bits
|
||||
126,Word Ladder II,22.1%,Hard,0.10749169745614619, https://leetcode.com/problems/word-ladder-ii
|
||||
1,Two Sum,45.6%,Easy,0.07147453361485057, https://leetcode.com/problems/two-sum
|
||||
23,Merge k Sorted Lists,40.2%,Hard,0.0250564321052577, https://leetcode.com/problems/merge-k-sorted-lists
|
||||
ID,Title,Acceptance,Difficulty,Frequency,Leetcode Question Link
|
||||
250,Count Univalue Subtrees,52.0%,Medium,1.7195134036164268, https://leetcode.com/problems/count-univalue-subtrees
|
||||
965,Univalued Binary Tree,67.7%,Easy,1.2504050329534637, https://leetcode.com/problems/univalued-binary-tree
|
||||
68,Text Justification,27.7%,Hard,0.7812966622905007, https://leetcode.com/problems/text-justification
|
||||
935,Knight Dialer,45.2%,Medium,0.5465437063680699, https://leetcode.com/problems/knight-dialer
|
||||
191,Number of 1 Bits,49.8%,Easy,0.3920623591078002, https://leetcode.com/problems/number-of-1-bits
|
||||
126,Word Ladder II,22.1%,Hard,0.10749169745614619, https://leetcode.com/problems/word-ladder-ii
|
||||
1,Two Sum,45.6%,Easy,0.07147453361485057, https://leetcode.com/problems/two-sum
|
||||
23,Merge k Sorted Lists,40.2%,Hard,0.0250564321052577, https://leetcode.com/problems/merge-k-sorted-lists
|
||||
|
||||
|
Reference in New Issue
Block a user