mirrors/LeetCode-Questions-CompanyWise
1
0
Fork 0
mirror of https://github.com/McSmog/LeetCode-Questions-CompanyWise.git synced 2026-04-19 16:56:45 +00:00
Code Issues Packages Projects Releases Wiki Activity

Chore: Add headers to all the files (#54)

Browse Source 
## 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:
Krishna Kumar Dey
2023-04-01 11:07:49 +05:30
committed by GitHub
parent 0aeadbd612
commit fb5f78b55e
534 changed files with 20291 additions and 19757 deletions
Download Patch File Download Diff File Expand all files Collapse all files

11
morgan-stanley_1year.csv
View File

@@ -1,5 +1,6 @@
121,Best Time to Buy and Sell Stock,50.5%,Easy,0.007502371594599209, https://leetcode.com/problems/best-time-to-buy-and-sell-stock
41,First Missing Positive,32.0%,Hard,0.005444881762408285, https://leetcode.com/problems/first-missing-positive
160,Intersection of Two Linked Lists,40.6%,Easy,0.003934945881316586, https://leetcode.com/problems/intersection-of-two-linked-lists
53,Maximum Subarray,46.5%,Easy,0.003902924955778234, https://leetcode.com/problems/maximum-subarray
1,Two Sum,45.6%,Easy,0.00184543512358731, https://leetcode.com/problems/two-sum
ID,Title,Acceptance,Difficulty,Frequency,Leetcode Question Link
121,Best Time to Buy and Sell Stock,50.5%,Easy,0.007502371594599209, https://leetcode.com/problems/best-time-to-buy-and-sell-stock
41,First Missing Positive,32.0%,Hard,0.005444881762408285, https://leetcode.com/problems/first-missing-positive
160,Intersection of Two Linked Lists,40.6%,Easy,0.003934945881316586, https://leetcode.com/problems/intersection-of-two-linked-lists
53,Maximum Subarray,46.5%,Easy,0.003902924955778234, https://leetcode.com/problems/maximum-subarray
1,Two Sum,45.6%,Easy,0.00184543512358731, https://leetcode.com/problems/two-sum
1 121 ID Best Time to Buy and Sell Stock Title 50.5% Acceptance Easy Difficulty 0.007502371594599209 Frequency https://leetcode.com/problems/best-time-to-buy-and-sell-stock Leetcode Question Link
2 41 121 First Missing Positive Best Time to Buy and Sell Stock 32.0% 50.5% Hard Easy 0.005444881762408285 0.007502371594599209 https://leetcode.com/problems/first-missing-positive https://leetcode.com/problems/best-time-to-buy-and-sell-stock
3 160 41 Intersection of Two Linked Lists First Missing Positive 40.6% 32.0% Easy Hard 0.003934945881316586 0.005444881762408285 https://leetcode.com/problems/intersection-of-two-linked-lists https://leetcode.com/problems/first-missing-positive
4 53 160 Maximum Subarray Intersection of Two Linked Lists 46.5% 40.6% Easy Easy 0.003902924955778234 0.003934945881316586 https://leetcode.com/problems/maximum-subarray https://leetcode.com/problems/intersection-of-two-linked-lists
5 1 53 Two Sum Maximum Subarray 45.6% 46.5% Easy Easy 0.00184543512358731 0.003902924955778234 https://leetcode.com/problems/two-sum https://leetcode.com/problems/maximum-subarray
6 1 Two Sum 45.6% Easy 0.00184543512358731 https://leetcode.com/problems/two-sum