mirror of
https://github.com/krishnadey30/LeetCode-Questions-CompanyWise.git
synced 2025-12-28 13:41:42 +00:00
## 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)
```
20 lines
2.3 KiB
Plaintext
20 lines
2.3 KiB
Plaintext
ID,Title,Acceptance,Difficulty,Frequency,Leetcode Question Link
|
|
742,Closest Leaf in a Binary Tree,43.6%,Medium,1.1768018409410708, https://leetcode.com/problems/closest-leaf-in-a-binary-tree
|
|
380,Insert Delete GetRandom O(1),47.5%,Medium,0.9812917663172286, https://leetcode.com/problems/insert-delete-getrandom-o1
|
|
41,First Missing Positive,32.0%,Hard,0.9732633179401787, https://leetcode.com/problems/first-missing-positive
|
|
314,Binary Tree Vertical Order Traversal,45.3%,Medium,0.9050510649594637, https://leetcode.com/problems/binary-tree-vertical-order-traversal
|
|
722,Remove Comments,34.6%,Medium,0.7095409903356217, https://leetcode.com/problems/remove-comments
|
|
1242,Web Crawler Multithreaded,45.9%,Medium,0.6971713308596708, https://leetcode.com/problems/web-crawler-multithreaded
|
|
91,Decode Ways,24.7%,Medium,0.5448409073756266, https://leetcode.com/problems/decode-ways
|
|
218,The Skyline Problem,34.6%,Hard,0.42040668810636345, https://leetcode.com/problems/the-skyline-problem
|
|
614,Second Degree Follower,30.3%,Medium,0.3030501026800949, https://leetcode.com/problems/second-degree-follower
|
|
239,Sliding Window Maximum,43.0%,Hard,0.18086662630782, https://leetcode.com/problems/sliding-window-maximum
|
|
426,Convert Binary Search Tree to Sorted Doubly Linked List,59.1%,Medium,0.09352605801082346, https://leetcode.com/problems/convert-binary-search-tree-to-sorted-doubly-linked-list
|
|
381,Insert Delete GetRandom O(1) - Duplicates allowed,34.1%,Hard,0.09106388892287375, https://leetcode.com/problems/insert-delete-getrandom-o1-duplicates-allowed
|
|
987,Vertical Order Traversal of a Binary Tree,36.6%,Medium,0.070392125446596, https://leetcode.com/problems/vertical-order-traversal-of-a-binary-tree
|
|
42,Trapping Rain Water,48.9%,Hard,0.0674365414927314, https://leetcode.com/problems/trapping-rain-water
|
|
350,Intersection of Two Arrays II,51.4%,Easy,0.01168540951877908, https://leetcode.com/problems/intersection-of-two-arrays-ii
|
|
10,Regular Expression Matching,26.8%,Hard,0.0071865203293987245, https://leetcode.com/problems/regular-expression-matching
|
|
114,Flatten Binary Tree to Linked List,49.3%,Medium,0.006896579059060353, https://leetcode.com/problems/flatten-binary-tree-to-linked-list
|
|
981,Time Based Key-Value Store,53.1%,Medium,0, https://leetcode.com/problems/time-based-key-value-store
|