mirror of
https://github.com/McSmog/LeetCode-Questions-CompanyWise.git
synced 2026-04-20 00:57:31 +00:00
fb5f78b55e
## 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)
```
4.3 KiB
4.3 KiB
| 1 | ID | Title | Acceptance | Difficulty | Frequency | Leetcode Question Link |
|---|---|---|---|---|---|---|
| 2 | 1349 | Maximum Students Taking Exam | 42.0% | Hard | 0.12179424958237695 | https://leetcode.com/problems/maximum-students-taking-exam |
| 3 | 738 | Monotone Increasing Digits | 44.3% | Medium | 0.08479653666007693 | https://leetcode.com/problems/monotone-increasing-digits |
| 4 | 1283 | Find the Smallest Divisor Given a Threshold | 47.6% | Medium | 0.047798823737776906 | https://leetcode.com/problems/find-the-smallest-divisor-given-a-threshold |
| 5 | 1 | Two Sum | 45.6% | Easy | 0.02912591612409083 | https://leetcode.com/problems/two-sum |
| 6 | 917 | Reverse Only Letters | 58.0% | Easy | 0.0286552557603761 | https://leetcode.com/problems/reverse-only-letters |
| 7 | 283 | Move Zeroes | 57.8% | Easy | 0.025673520193393074 | https://leetcode.com/problems/move-zeroes |
| 8 | 559 | Maximum Depth of N-ary Tree | 68.7% | Easy | 0.024524389863084386 | https://leetcode.com/problems/maximum-depth-of-n-ary-tree |
| 9 | 1048 | Longest String Chain | 54.7% | Medium | 0.019361689049145963 | https://leetcode.com/problems/longest-string-chain |
| 10 | 146 | LRU Cache | 33.2% | Medium | 0.01827577993873683 | https://leetcode.com/problems/lru-cache |
| 11 | 509 | Fibonacci Number | 67.2% | Easy | 0.01593518138579736 | https://leetcode.com/problems/fibonacci-number |
| 12 | 8 | String to Integer (atoi) | 15.4% | Medium | 0.015084664273571906 | https://leetcode.com/problems/string-to-integer-atoi |
| 13 | 56 | Merge Intervals | 39.3% | Medium | 0.013819532422258866 | https://leetcode.com/problems/merge-intervals |
| 14 | 53 | Maximum Subarray | 46.5% | Easy | 0.013467854269413949 | https://leetcode.com/problems/maximum-subarray |
| 15 | 273 | Integer to English Words | 27.1% | Hard | 0.012081089250339716 | https://leetcode.com/problems/integer-to-english-words |
| 16 | 23 | Merge k Sorted Lists | 40.2% | Hard | 0.009092808657599025 | https://leetcode.com/problems/merge-k-sorted-lists |
| 17 | 5 | Longest Palindromic Substring | 29.5% | Medium | 0.009086325220960808 | https://leetcode.com/problems/longest-palindromic-substring |
| 18 | 209 | Minimum Size Subarray Sum | 38.2% | Medium | 0.00841401682484616 | https://leetcode.com/problems/minimum-size-subarray-sum |
| 19 | 240 | Search a 2D Matrix II | 43.2% | Medium | 0.0075829747244553335 | https://leetcode.com/problems/search-a-2d-matrix-ii |
| 20 | 94 | Binary Tree Inorder Traversal | 63.3% | Medium | 0.007533307577636257 | https://leetcode.com/problems/binary-tree-inorder-traversal |
| 21 | 16 | 3Sum Closest | 46.0% | Medium | 0.0075259057003469075 | https://leetcode.com/problems/3sum-closest |
| 22 | 116 | Populating Next Right Pointers in Each Node | 45.2% | Medium | 0.007336790063854334 | https://leetcode.com/problems/populating-next-right-pointers-in-each-node |
| 23 | 41 | First Missing Positive | 32.0% | Hard | 0.0064113058208121855 | https://leetcode.com/problems/first-missing-positive |
| 24 | 24 | Swap Nodes in Pairs | 50.4% | Medium | 0.0062218275061505365 | https://leetcode.com/problems/swap-nodes-in-pairs |
| 25 | 199 | Binary Tree Right Side View | 54.1% | Medium | 0.0056826406650506926 | https://leetcode.com/problems/binary-tree-right-side-view |
| 26 | 20 | Valid Parentheses | 39.0% | Easy | 0.005168860577665306 | https://leetcode.com/problems/valid-parentheses |
| 27 | 160 | Intersection of Two Linked Lists | 40.6% | Easy | 0.004901369939720486 | https://leetcode.com/problems/intersection-of-two-linked-lists |
| 28 | 121 | Best Time to Buy and Sell Stock | 50.5% | Easy | 0.0047725193990346675 | https://leetcode.com/problems/best-time-to-buy-and-sell-stock |
| 29 | 35 | Search Insert Position | 42.6% | Easy | 0.004646848510375352 | https://leetcode.com/problems/search-insert-position |
| 30 | 22 | Generate Parentheses | 62.7% | Medium | 0.0043611059090124735 | https://leetcode.com/problems/generate-parentheses |
| 31 | 46 | Permutations | 63.5% | Medium | 0.004216302230139218 | https://leetcode.com/problems/permutations |
| 32 | 322 | Coin Change | 35.5% | Medium | 0.004029826126500844 | https://leetcode.com/problems/coin-change |
| 33 | 238 | Product of Array Except Self | 60.1% | Medium | 0.003930436424724545 | https://leetcode.com/problems/product-of-array-except-self |
| 34 | 102 | Binary Tree Level Order Traversal | 54.6% | Medium | 0.003639014205004082 | https://leetcode.com/problems/binary-tree-level-order-traversal |
| 35 | 101 | Symmetric Tree | 46.8% | Easy | 0.0034057078469827435 | https://leetcode.com/problems/symmetric-tree |
| 36 | 98 | Validate Binary Search Tree | 27.8% | Medium | 0.002943776044013381 | https://leetcode.com/problems/validate-binary-search-tree |
| 37 | 104 | Maximum Depth of Binary Tree | 66.0% | Easy | 0.002787846801433134 | https://leetcode.com/problems/maximum-depth-of-binary-tree |
| 38 | 3 | Longest Substring Without Repeating Characters | 30.4% | Medium | 0.0015556336509412823 | https://leetcode.com/problems/longest-substring-without-repeating-characters |