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)
```
17 lines
1.8 KiB
CSV
17 lines
1.8 KiB
CSV
ID,Title,Acceptance,Difficulty,Frequency,Leetcode Question Link
|
||
713,Subarray Product Less Than K,39.1%,Medium,0.6727517560064701, https://leetcode.com/problems/subarray-product-less-than-k
|
||
1223,Dice Roll Simulation,45.6%,Medium,0.5140462384660329, https://leetcode.com/problems/dice-roll-simulation
|
||
1411,Number of Ways to Paint N × 3 Grid,61.1%,Hard,0.35534072092559577, https://leetcode.com/problems/number-of-ways-to-paint-n-3-grid
|
||
1177,Can Make Palindrome from Substring,34.6%,Medium,0.24991141156531438, https://leetcode.com/problems/can-make-palindrome-from-substring
|
||
995,Minimum Number of K Consecutive Bit Flips,46.8%,Hard,0.19004360288786493, https://leetcode.com/problems/minimum-number-of-k-consecutive-bit-flips
|
||
324,Wiggle Sort II,29.9%,Medium,0.168749479248411, https://leetcode.com/problems/wiggle-sort-ii
|
||
1319,Number of Operations to Make Network Connected,53.1%,Medium,0.04587960575069364, https://leetcode.com/problems/number-of-operations-to-make-network-connected
|
||
48,Rotate Image,56.7%,Medium,0.020228249775471566, https://leetcode.com/problems/rotate-image
|
||
1048,Longest String Chain,54.7%,Medium,0.019361689049145963, https://leetcode.com/problems/longest-string-chain
|
||
443,String Compression,41.3%,Easy,0.01390843004613198, https://leetcode.com/problems/string-compression
|
||
39,Combination Sum,56.1%,Medium,0.005715934396440999, https://leetcode.com/problems/combination-sum
|
||
152,Maximum Product Subarray,31.7%,Medium,0.005590510716885066, https://leetcode.com/problems/maximum-product-subarray
|
||
15,3Sum,26.8%,Medium,0.004940992758742591, https://leetcode.com/problems/3sum
|
||
20,Valid Parentheses,39.0%,Easy,0.0023005704055949323, https://leetcode.com/problems/valid-parentheses
|
||
121,Best Time to Buy and Sell Stock,50.5%,Easy,0.0021239321954525975, https://leetcode.com/problems/best-time-to-buy-and-sell-stock
|