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:
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

View File

@@ -1,6 +1,7 @@
166,Fraction to Recurring Decimal,21.6%,Medium,0.052923221534690555, https://leetcode.com/problems/fraction-to-recurring-decimal
51,N-Queens,46.6%,Hard,0.03651521297509749, https://leetcode.com/problems/n-queens
123,Best Time to Buy and Sell Stock III,37.5%,Hard,0.02516207671950806, https://leetcode.com/problems/best-time-to-buy-and-sell-stock-iii
4,Median of Two Sorted Arrays,29.6%,Hard,0.008754068159914991, https://leetcode.com/problems/median-of-two-sorted-arrays
64,Minimum Path Sum,54.5%,Medium,0.006127470152097104, https://leetcode.com/problems/minimum-path-sum
31,Next Permutation,32.6%,Medium,0.005989835219179644, https://leetcode.com/problems/next-permutation
ID,Title,Acceptance,Difficulty,Frequency,Leetcode Question Link
166,Fraction to Recurring Decimal,21.6%,Medium,0.052923221534690555, https://leetcode.com/problems/fraction-to-recurring-decimal
51,N-Queens,46.6%,Hard,0.03651521297509749, https://leetcode.com/problems/n-queens
123,Best Time to Buy and Sell Stock III,37.5%,Hard,0.02516207671950806, https://leetcode.com/problems/best-time-to-buy-and-sell-stock-iii
4,Median of Two Sorted Arrays,29.6%,Hard,0.008754068159914991, https://leetcode.com/problems/median-of-two-sorted-arrays
64,Minimum Path Sum,54.5%,Medium,0.006127470152097104, https://leetcode.com/problems/minimum-path-sum
31,Next Permutation,32.6%,Medium,0.005989835219179644, https://leetcode.com/problems/next-permutation
1 166 ID Fraction to Recurring Decimal Title 21.6% Acceptance Medium Difficulty 0.052923221534690555 Frequency https://leetcode.com/problems/fraction-to-recurring-decimal Leetcode Question Link
2 51 166 N-Queens Fraction to Recurring Decimal 46.6% 21.6% Hard Medium 0.03651521297509749 0.052923221534690555 https://leetcode.com/problems/n-queens https://leetcode.com/problems/fraction-to-recurring-decimal
3 123 51 Best Time to Buy and Sell Stock III N-Queens 37.5% 46.6% Hard Hard 0.02516207671950806 0.03651521297509749 https://leetcode.com/problems/best-time-to-buy-and-sell-stock-iii https://leetcode.com/problems/n-queens
4 4 123 Median of Two Sorted Arrays Best Time to Buy and Sell Stock III 29.6% 37.5% Hard Hard 0.008754068159914991 0.02516207671950806 https://leetcode.com/problems/median-of-two-sorted-arrays https://leetcode.com/problems/best-time-to-buy-and-sell-stock-iii
5 64 4 Minimum Path Sum Median of Two Sorted Arrays 54.5% 29.6% Medium Hard 0.006127470152097104 0.008754068159914991 https://leetcode.com/problems/minimum-path-sum https://leetcode.com/problems/median-of-two-sorted-arrays
6 31 64 Next Permutation Minimum Path Sum 32.6% 54.5% Medium Medium 0.005989835219179644 0.006127470152097104 https://leetcode.com/problems/next-permutation https://leetcode.com/problems/minimum-path-sum
7 31 Next Permutation 32.6% Medium 0.005989835219179644 https://leetcode.com/problems/next-permutation