mirrors/LeetCode-Questions-CompanyWise
1
0
Fork 0
mirror of https://github.com/McSmog/LeetCode-Questions-CompanyWise.git synced 2026-04-20 09:07:31 +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

7
hrt_alltime.csv
View File

@@ -1,3 +1,4 @@
1323,Maximum 69 Number,77.9%,Easy,0.01658412801553527, https://leetcode.com/problems/maximum-69-number
1317,Convert Integer to the Sum of Two No-Zero Integers,56.8%,Easy,0, https://leetcode.com/problems/convert-integer-to-the-sum-of-two-no-zero-integers
1342,Number of Steps to Reduce a Number to Zero,86.3%,Easy,0, https://leetcode.com/problems/number-of-steps-to-reduce-a-number-to-zero
ID,Title,Acceptance,Difficulty,Frequency,Leetcode Question Link
1323,Maximum 69 Number,77.9%,Easy,0.01658412801553527, https://leetcode.com/problems/maximum-69-number
1317,Convert Integer to the Sum of Two No-Zero Integers,56.8%,Easy,0, https://leetcode.com/problems/convert-integer-to-the-sum-of-two-no-zero-integers
1342,Number of Steps to Reduce a Number to Zero,86.3%,Easy,0, https://leetcode.com/problems/number-of-steps-to-reduce-a-number-to-zero
1 1323 ID Maximum 69 Number Title 77.9% Acceptance Easy Difficulty 0.01658412801553527 Frequency https://leetcode.com/problems/maximum-69-number Leetcode Question Link
2 1317 1323 Convert Integer to the Sum of Two No-Zero Integers Maximum 69 Number 56.8% 77.9% Easy Easy 0 0.01658412801553527 https://leetcode.com/problems/convert-integer-to-the-sum-of-two-no-zero-integers https://leetcode.com/problems/maximum-69-number
3 1342 1317 Number of Steps to Reduce a Number to Zero Convert Integer to the Sum of Two No-Zero Integers 86.3% 56.8% Easy Easy 0 0 https://leetcode.com/problems/number-of-steps-to-reduce-a-number-to-zero https://leetcode.com/problems/convert-integer-to-the-sum-of-two-no-zero-integers
4 1342 Number of Steps to Reduce a Number to Zero 86.3% Easy 0 https://leetcode.com/problems/number-of-steps-to-reduce-a-number-to-zero