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 @@
238,Product of Array Except Self,60.1%,Medium,0.14079121889577595, https://leetcode.com/problems/product-of-array-except-self
146,LRU Cache,33.2%,Medium,0.09466027715846642, https://leetcode.com/problems/lru-cache
98,Validate Binary Search Tree,27.8%,Medium,0.08515143211698117, https://leetcode.com/problems/validate-binary-search-tree
973,K Closest Points to Origin,63.8%,Medium,0.05474633722814542, https://leetcode.com/problems/k-closest-points-to-origin
50,Pow(x;n),30.3%,Medium,0.008615395490835889, https://leetcode.com/problems/powx-n
53,Maximum Subarray,46.5%,Easy,0.008272628741228982, https://leetcode.com/problems/maximum-subarray
ID,Title,Acceptance,Difficulty,Frequency,Leetcode Question Link
238,Product of Array Except Self,60.1%,Medium,0.14079121889577595, https://leetcode.com/problems/product-of-array-except-self
146,LRU Cache,33.2%,Medium,0.09466027715846642, https://leetcode.com/problems/lru-cache
98,Validate Binary Search Tree,27.8%,Medium,0.08515143211698117, https://leetcode.com/problems/validate-binary-search-tree
973,K Closest Points to Origin,63.8%,Medium,0.05474633722814542, https://leetcode.com/problems/k-closest-points-to-origin
50,Pow(x;n),30.3%,Medium,0.008615395490835889, https://leetcode.com/problems/powx-n
53,Maximum Subarray,46.5%,Easy,0.008272628741228982, https://leetcode.com/problems/maximum-subarray
1 238 ID Product of Array Except Self Title 60.1% Acceptance Medium Difficulty 0.14079121889577595 Frequency https://leetcode.com/problems/product-of-array-except-self Leetcode Question Link
2 146 238 LRU Cache Product of Array Except Self 33.2% 60.1% Medium Medium 0.09466027715846642 0.14079121889577595 https://leetcode.com/problems/lru-cache https://leetcode.com/problems/product-of-array-except-self
3 98 146 Validate Binary Search Tree LRU Cache 27.8% 33.2% Medium Medium 0.08515143211698117 0.09466027715846642 https://leetcode.com/problems/validate-binary-search-tree https://leetcode.com/problems/lru-cache
4 973 98 K Closest Points to Origin Validate Binary Search Tree 63.8% 27.8% Medium Medium 0.05474633722814542 0.08515143211698117 https://leetcode.com/problems/k-closest-points-to-origin https://leetcode.com/problems/validate-binary-search-tree
5 50 973 Pow(x;n) K Closest Points to Origin 30.3% 63.8% Medium Medium 0.008615395490835889 0.05474633722814542 https://leetcode.com/problems/powx-n https://leetcode.com/problems/k-closest-points-to-origin
6 53 50 Maximum Subarray Pow(x;n) 46.5% 30.3% Easy Medium 0.008272628741228982 0.008615395490835889 https://leetcode.com/problems/maximum-subarray https://leetcode.com/problems/powx-n
7 53 Maximum Subarray 46.5% Easy 0.008272628741228982 https://leetcode.com/problems/maximum-subarray