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,12 +1,13 @@
708,Insert into a Sorted Circular Linked List,31.6%,Medium,0.6963635371787209, https://leetcode.com/problems/insert-into-a-sorted-circular-linked-list
855,Exam Room,43.1%,Medium,0.5147127208812607, https://leetcode.com/problems/exam-room
510,Inorder Successor in BST II,58.0%,Medium,0.3274381237537068, https://leetcode.com/problems/inorder-successor-in-bst-ii
761,Special Binary String,54.7%,Hard,0.3007541540191337, https://leetcode.com/problems/special-binary-string
362,Design Hit Counter,63.7%,Medium,0.2737682417732349, https://leetcode.com/problems/design-hit-counter
285,Inorder Successor in BST,40.4%,Medium,0.08649364464568089, https://leetcode.com/problems/inorder-successor-in-bst
88,Merge Sorted Array,39.4%,Easy,0.011986958032982505, https://leetcode.com/problems/merge-sorted-array
17,Letter Combinations of a Phone Number,46.8%,Medium,0.00987716546167603, https://leetcode.com/problems/letter-combinations-of-a-phone-number
208,Implement Trie (Prefix Tree),49.4%,Medium,0.009105457856626612, https://leetcode.com/problems/implement-trie-prefix-tree
54,Spiral Matrix,34.1%,Medium,0.0065941551175130245, https://leetcode.com/problems/spiral-matrix
34,Find First and Last Position of Element in Sorted Array,36.2%,Medium,0.004247643638268045, https://leetcode.com/problems/find-first-and-last-position-of-element-in-sorted-array
1309,Decrypt String from Alphabet to Integer Mapping,76.8%,Easy,0, https://leetcode.com/problems/decrypt-string-from-alphabet-to-integer-mapping
ID,Title,Acceptance,Difficulty,Frequency,Leetcode Question Link
708,Insert into a Sorted Circular Linked List,31.6%,Medium,0.6963635371787209, https://leetcode.com/problems/insert-into-a-sorted-circular-linked-list
855,Exam Room,43.1%,Medium,0.5147127208812607, https://leetcode.com/problems/exam-room
510,Inorder Successor in BST II,58.0%,Medium,0.3274381237537068, https://leetcode.com/problems/inorder-successor-in-bst-ii
761,Special Binary String,54.7%,Hard,0.3007541540191337, https://leetcode.com/problems/special-binary-string
362,Design Hit Counter,63.7%,Medium,0.2737682417732349, https://leetcode.com/problems/design-hit-counter
285,Inorder Successor in BST,40.4%,Medium,0.08649364464568089, https://leetcode.com/problems/inorder-successor-in-bst
88,Merge Sorted Array,39.4%,Easy,0.011986958032982505, https://leetcode.com/problems/merge-sorted-array
17,Letter Combinations of a Phone Number,46.8%,Medium,0.00987716546167603, https://leetcode.com/problems/letter-combinations-of-a-phone-number
208,Implement Trie (Prefix Tree),49.4%,Medium,0.009105457856626612, https://leetcode.com/problems/implement-trie-prefix-tree
54,Spiral Matrix,34.1%,Medium,0.0065941551175130245, https://leetcode.com/problems/spiral-matrix
34,Find First and Last Position of Element in Sorted Array,36.2%,Medium,0.004247643638268045, https://leetcode.com/problems/find-first-and-last-position-of-element-in-sorted-array
1309,Decrypt String from Alphabet to Integer Mapping,76.8%,Easy,0, https://leetcode.com/problems/decrypt-string-from-alphabet-to-integer-mapping
1 708 ID Insert into a Sorted Circular Linked List Title 31.6% Acceptance Medium Difficulty 0.6963635371787209 Frequency https://leetcode.com/problems/insert-into-a-sorted-circular-linked-list Leetcode Question Link
2 855 708 Exam Room Insert into a Sorted Circular Linked List 43.1% 31.6% Medium Medium 0.5147127208812607 0.6963635371787209 https://leetcode.com/problems/exam-room https://leetcode.com/problems/insert-into-a-sorted-circular-linked-list
3 510 855 Inorder Successor in BST II Exam Room 58.0% 43.1% Medium Medium 0.3274381237537068 0.5147127208812607 https://leetcode.com/problems/inorder-successor-in-bst-ii https://leetcode.com/problems/exam-room
4 761 510 Special Binary String Inorder Successor in BST II 54.7% 58.0% Hard Medium 0.3007541540191337 0.3274381237537068 https://leetcode.com/problems/special-binary-string https://leetcode.com/problems/inorder-successor-in-bst-ii
5 362 761 Design Hit Counter Special Binary String 63.7% 54.7% Medium Hard 0.2737682417732349 0.3007541540191337 https://leetcode.com/problems/design-hit-counter https://leetcode.com/problems/special-binary-string
6 285 362 Inorder Successor in BST Design Hit Counter 40.4% 63.7% Medium Medium 0.08649364464568089 0.2737682417732349 https://leetcode.com/problems/inorder-successor-in-bst https://leetcode.com/problems/design-hit-counter
7 88 285 Merge Sorted Array Inorder Successor in BST 39.4% 40.4% Easy Medium 0.011986958032982505 0.08649364464568089 https://leetcode.com/problems/merge-sorted-array https://leetcode.com/problems/inorder-successor-in-bst
8 17 88 Letter Combinations of a Phone Number Merge Sorted Array 46.8% 39.4% Medium Easy 0.00987716546167603 0.011986958032982505 https://leetcode.com/problems/letter-combinations-of-a-phone-number https://leetcode.com/problems/merge-sorted-array
9 208 17 Implement Trie (Prefix Tree) Letter Combinations of a Phone Number 49.4% 46.8% Medium Medium 0.009105457856626612 0.00987716546167603 https://leetcode.com/problems/implement-trie-prefix-tree https://leetcode.com/problems/letter-combinations-of-a-phone-number
10 54 208 Spiral Matrix Implement Trie (Prefix Tree) 34.1% 49.4% Medium Medium 0.0065941551175130245 0.009105457856626612 https://leetcode.com/problems/spiral-matrix https://leetcode.com/problems/implement-trie-prefix-tree
11 34 54 Find First and Last Position of Element in Sorted Array Spiral Matrix 36.2% 34.1% Medium Medium 0.004247643638268045 0.0065941551175130245 https://leetcode.com/problems/find-first-and-last-position-of-element-in-sorted-array https://leetcode.com/problems/spiral-matrix
12 1309 34 Decrypt String from Alphabet to Integer Mapping Find First and Last Position of Element in Sorted Array 76.8% 36.2% Easy Medium 0 0.004247643638268045 https://leetcode.com/problems/decrypt-string-from-alphabet-to-integer-mapping https://leetcode.com/problems/find-first-and-last-position-of-element-in-sorted-array
13 1309 Decrypt String from Alphabet to Integer Mapping 76.8% Easy 0 https://leetcode.com/problems/decrypt-string-from-alphabet-to-integer-mapping