ignore descriptions

Author: vikahaze

.gitignore

@@ -9,3 +9,4 @@ venv
 leetcode-problems-tmp.json
 
 scripts/__pycache__/
+descriptions/

books/All.md

@@ -8922,68 +8922,6 @@ class Solution:
         return res
 ```
 
-## 1431. Kids With the Greatest Number of Candies [Easy]
-https://leetcode.com/problems/kids-with-the-greatest-number-of-candies/
-
-### Explanation
-
-## 1431. Kids With the Greatest Number of Candies [Easy]
-
-https://leetcode.com/problems/kids-with-the-greatest-number-of-candies
-
-## Description
-There are `n` kids with candies. You are given an integer array `candies`, where each `candies[i]` represents the number of candies the `i`th kid has, and an integer `extraCandies`, denoting the number of extra candies that you have.
-
-Return a boolean array `result` of length `n`, where `result[i]` is `true` if, after giving the `i`th kid all the `extraCandies`, they will have the greatest number of candies among all the kids, or false otherwise.
-
-Note that multiple kids can have the greatest number of candies.
-
-**Examples**
-
-```text
-Input: candies = [2,3,5,1,3], extraCandies = 3
-Output: [true,true,true,false,true]
-Explanation: If you give all extraCandies to:
-- Kid 1, they will have 2 + 3 = 5 candies, which is the greatest among the kids.
-- Kid 2, they will have 3 + 3 = 6 candies, which is the greatest among the kids.
-- Kid 3, they will have 5 + 3 = 8 candies, which is the greatest among the kids.
-- Kid 4, they will have 1 + 3 = 4 candies, which is not the greatest among the kids.
-- Kid 5, they will have 3 + 3 = 6 candies, which is the greatest among the kids.
-
-Input: candies = [4,2,1,1,2], extraCandies = 1
-Output: [true,false,false,false,false]
-
-Input: candies = [12,1,12], extraCandies = 10
-Output: [true,false,true]
-```
-
-**Constraints**
-
-```text
-- n == candies.length
-- 2 <= n <= 100
-- 1 <= candies[i] <= 100
-- 1 <= extraCandies <= 50
-```
-
-## Hint
-For each kid, check if their candies plus `extraCandies` is at least as much as the current maximum.
-
-## Explanation
-First, you want to know the highest number of candies any kid currently has. This is important because you need a reference point to see if giving extra candies to a kid will make them "the greatest."
-
-For each kid, you add the `extraCandies` to their current amount. You do this because you want to see if, after the bonus, they can reach or beat the current maximum. If they do, you mark them as `True` in our answer list; otherwise, False.
-
-You only need to find the maximum once, and then just compare each kid's total to it. Don't need to recalculate the maximum for every kid.
-
-### Solution
-
-```python
-def kidsWithCandies(candies, extraCandies):
-    max_candies = max(candies)  # Find the current maximum
-    return [(c + extraCandies) >= max_candies for c in candies]
-```
-
 ## 1448. Count Good Nodes in Binary Tree [Medium]
 https://leetcode.com/problems/count-good-nodes-in-binary-tree/
 

books/LeetCode_75.md

@@ -517,68 +517,6 @@ def uniqueOccurrences(arr):
     return len(set(count.values())) == len(count)
 ```
 
-## 1431. Kids With the Greatest Number of Candies [Easy]
-https://leetcode.com/problems/kids-with-the-greatest-number-of-candies/
-
-### Explanation
-
-## 1431. Kids With the Greatest Number of Candies [Easy]
-
-https://leetcode.com/problems/kids-with-the-greatest-number-of-candies
-
-## Description
-There are `n` kids with candies. You are given an integer array `candies`, where each `candies[i]` represents the number of candies the `i`th kid has, and an integer `extraCandies`, denoting the number of extra candies that you have.
-
-Return a boolean array `result` of length `n`, where `result[i]` is `true` if, after giving the `i`th kid all the `extraCandies`, they will have the greatest number of candies among all the kids, or false otherwise.
-
-Note that multiple kids can have the greatest number of candies.
-
-**Examples**
-
-```text
-Input: candies = [2,3,5,1,3], extraCandies = 3
-Output: [true,true,true,false,true]
-Explanation: If you give all extraCandies to:
-- Kid 1, they will have 2 + 3 = 5 candies, which is the greatest among the kids.
-- Kid 2, they will have 3 + 3 = 6 candies, which is the greatest among the kids.
-- Kid 3, they will have 5 + 3 = 8 candies, which is the greatest among the kids.
-- Kid 4, they will have 1 + 3 = 4 candies, which is not the greatest among the kids.
-- Kid 5, they will have 3 + 3 = 6 candies, which is the greatest among the kids.
-
-Input: candies = [4,2,1,1,2], extraCandies = 1
-Output: [true,false,false,false,false]
-
-Input: candies = [12,1,12], extraCandies = 10
-Output: [true,false,true]
-```
-
-**Constraints**
-
-```text
-- n == candies.length
-- 2 <= n <= 100
-- 1 <= candies[i] <= 100
-- 1 <= extraCandies <= 50
-```
-
-## Hint
-For each kid, check if their candies plus `extraCandies` is at least as much as the current maximum.
-
-## Explanation
-First, you want to know the highest number of candies any kid currently has. This is important because you need a reference point to see if giving extra candies to a kid will make them "the greatest."
-
-For each kid, you add the `extraCandies` to their current amount. You do this because you want to see if, after the bonus, they can reach or beat the current maximum. If they do, you mark them as `True` in our answer list; otherwise, False.
-
-You only need to find the maximum once, and then just compare each kid's total to it. Don't need to recalculate the maximum for every kid.
-
-### Solution
-
-```python
-def kidsWithCandies(candies, extraCandies):
-    max_candies = max(candies)  # Find the current maximum
-    return [(c + extraCandies) >= max_candies for c in candies]
-```
-
 ## 2215. Find the Difference of Two Arrays [Easy]
 https://leetcode.com/problems/find-the-difference-of-two-arrays/
 

books/Visualization.md

@@ -86,68 +86,6 @@ def __init__(self, val=0, next=None):
         self.next = next
 ```
 
-## 1431. Kids With the Greatest Number of Candies [Easy]
-https://leetcode.com/problems/kids-with-the-greatest-number-of-candies/
-
-### Explanation
-
-## 1431. Kids With the Greatest Number of Candies [Easy]
-
-https://leetcode.com/problems/kids-with-the-greatest-number-of-candies
-
-## Description
-There are `n` kids with candies. You are given an integer array `candies`, where each `candies[i]` represents the number of candies the `i`th kid has, and an integer `extraCandies`, denoting the number of extra candies that you have.
-
-Return a boolean array `result` of length `n`, where `result[i]` is `true` if, after giving the `i`th kid all the `extraCandies`, they will have the greatest number of candies among all the kids, or false otherwise.
-
-Note that multiple kids can have the greatest number of candies.
-
-**Examples**
-
-```text
-Input: candies = [2,3,5,1,3], extraCandies = 3
-Output: [true,true,true,false,true]
-Explanation: If you give all extraCandies to:
-- Kid 1, they will have 2 + 3 = 5 candies, which is the greatest among the kids.
-- Kid 2, they will have 3 + 3 = 6 candies, which is the greatest among the kids.
-- Kid 3, they will have 5 + 3 = 8 candies, which is the greatest among the kids.
-- Kid 4, they will have 1 + 3 = 4 candies, which is not the greatest among the kids.
-- Kid 5, they will have 3 + 3 = 6 candies, which is the greatest among the kids.
-
-Input: candies = [4,2,1,1,2], extraCandies = 1
-Output: [true,false,false,false,false]
-
-Input: candies = [12,1,12], extraCandies = 10
-Output: [true,false,true]
-```
-
-**Constraints**
-
-```text
-- n == candies.length
-- 2 <= n <= 100
-- 1 <= candies[i] <= 100
-- 1 <= extraCandies <= 50
-```
-
-## Hint
-For each kid, check if their candies plus `extraCandies` is at least as much as the current maximum.
-
-## Explanation
-First, you want to know the highest number of candies any kid currently has. This is important because you need a reference point to see if giving extra candies to a kid will make them "the greatest."
-
-For each kid, you add the `extraCandies` to their current amount. You do this because you want to see if, after the bonus, they can reach or beat the current maximum. If they do, you mark them as `True` in our answer list; otherwise, False.
-
-You only need to find the maximum once, and then just compare each kid's total to it. Don't need to recalculate the maximum for every kid.
-
-### Solution
-
-```python
-def kidsWithCandies(candies, extraCandies):
-    max_candies = max(candies)  # Find the current maximum
-    return [(c + extraCandies) >= max_candies for c in candies]
-```
-
 ## 1798. Maximum Number of Consecutive Values You Can Make [Medium]
 https://leetcode.com/problems/maximum-number-of-consecutive-values-you-can-make/
 

data/book-sets.json

@@ -57,13 +57,13 @@
       202, 205, 206, 207, 208, 209, 210, 211, 212, 215, 216, 217, 219, 221, 222, 224, 226, 228, 230, 234, 235, 236, 238, 240, 242, 268, 274, 278, 283,
       287, 289, 290, 295, 297, 300, 322, 328, 334, 337, 338, 344, 345, 347, 373, 374, 378, 380, 383, 392, 394, 399, 409, 412, 427, 433, 435, 437, 438,
       443, 448, 450, 452, 460, 494, 502, 509, 530, 543, 547, 560, 581, 605, 617, 637, 643, 647, 649, 695, 700, 701, 704, 714, 724, 733, 735, 739, 746,
-      790, 841, 872, 875, 876, 901, 909, 918, 933, 973, 981, 994, 997, 1004, 1029, 1046, 1071, 1127, 1137, 1143, 1161, 1167, 1207, 1249, 1268, 1288,
-      1304, 1318, 1337, 1372, 1423, 1431, 1448, 1456, 1466, 1480, 1493, 1515, 1523, 1528, 1557, 1584, 1657, 1672, 1679, 1704, 1732, 1768, 1798, 1920,
-      1925, 1926, 1929, 1957, 1963, 2011, 2095, 2119, 2130, 2211, 2215, 2300, 2336, 2352, 2390, 2419, 2462, 2542, 2627, 2703, 2723, 2769, 2807, 2862,
-      2879, 2884, 2888, 2894, 2942, 3100, 3110, 3133, 3164, 3190, 3197, 3228, 3291, 3320, 3351, 3380, 3381, 3413, 3424, 3432, 3444, 3471, 3512, 3522,
-      3602, 3603, 3606, 3607, 3608, 3622, 3623, 3625, 3663, 3668, 3678, 3683, 3688, 3692, 3697, 3701, 3707, 3712, 3718, 3722, 3723, 3724, 3726, 3727,
-      3728, 3731, 3736, 3737, 3738, 3739, 3740, 3741, 3742, 3743, 3745, 3747, 3748, 3750, 3751, 3752, 3753, 3754, 3755, 3756, 3757, 3759, 3760, 3761,
-      3762, 3764, 3765, 3766, 3767, 3768, 3769, 3770, 3771, 3772
+      790, 841, 872, 875, 876, 901, 909, 918, 933, 973, 981, 994, 997, 1004, 1029, 1046, 1127, 1137, 1143, 1161, 1167, 1207, 1249, 1268, 1288, 1304,
+      1318, 1337, 1372, 1423, 1448, 1456, 1466, 1480, 1493, 1515, 1523, 1528, 1557, 1584, 1657, 1672, 1679, 1704, 1732, 1798, 1920, 1925, 1926, 1929,
+      1957, 1963, 2011, 2095, 2119, 2130, 2211, 2215, 2300, 2336, 2352, 2390, 2419, 2462, 2542, 2627, 2703, 2723, 2769, 2807, 2862, 2879, 2884, 2888,
+      2894, 2942, 3100, 3110, 3133, 3164, 3190, 3197, 3228, 3291, 3320, 3351, 3380, 3381, 3413, 3424, 3432, 3444, 3471, 3512, 3522, 3602, 3603, 3606,
+      3607, 3608, 3622, 3623, 3625, 3663, 3668, 3678, 3683, 3688, 3692, 3697, 3701, 3707, 3712, 3718, 3722, 3723, 3724, 3726, 3727, 3728, 3731, 3736,
+      3737, 3738, 3739, 3740, 3741, 3742, 3743, 3745, 3747, 3748, 3750, 3751, 3752, 3753, 3754, 3755, 3756, 3757, 3759, 3760, 3761, 3762, 3764, 3765,
+      3766, 3767, 3768, 3769, 3770, 3771, 3772
     ]
   },
   {"title": "Visualization", "description": "", "tags": [], "problems": [1, 2, 11, 1431, 1679, 1768, 1798, 2215, 3603, 3622, 3623]},