🤖 Updated LeetCode Problems : Tue,30 Jan, 2024 01:02 PM

LeetCode 75/1431 Kids With the Greatest Number of Candies.py

@@ -0,0 +1,40 @@
+# 1431. Kids With the Greatest Number of Candies
+# There are n kids with candies. You are given an integer array candies, where each candies[i] represents the number of candies the ith 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 ith 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.
+
+# Example 1:
+
+# 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.
+# Example 2:
+
+# Input: candies = [4,2,1,1,2], extraCandies = 1
+# Output: [true,false,false,false,false] 
+# Explanation: There is only 1 extra candy.
+# Kid 1 will always have the greatest number of candies, even if a different kid is given the extra candy.
+# Example 3:
+
+# Input: candies = [12,1,12], extraCandies = 10
+# Output: [true,false,true]
+
+
+# Constraints:
+
+# n == candies.length
+# 2 <= n <= 100
+# 1 <= candies[i] <= 100
+# 1 <= extraCandies <= 50
+
+class Solution:
+    def kidsWithCandies(self, candies: [int], extraCandies: int) -> [bool]:
+        maxCandies = max(candies)
+        return [candy + extraCandies >= maxCandies for candy in candies]

LeetCode 75/605 Can Place Flowers.py

@@ -0,0 +1,30 @@
+# 605. Can Place Flowers
+# You have a long flowerbed in which some of the plots are planted, and some are not. However, flowers cannot be planted in adjacent plots.
+
+# Given an integer array flowerbed containing 0's and 1's, where 0 means empty and 1 means not empty, and an integer n, return true if n new flowers can be planted in the flowerbed without violating the no-adjacent-flowers rule and false otherwise.
+
+# Example 1:
+
+# Input: flowerbed = [1,0,0,0,1], n = 1
+# Output: true
+# Example 2:
+
+# Input: flowerbed = [1,0,0,0,1], n = 2
+# Output: false
+
+
+# Constraints:
+
+# 1 <= flowerbed.length <= 2 * 104
+# flowerbed[i] is 0 or 1.
+# There are no two adjacent flowers in flowerbed.
+# 0 <= n <= flowerbed.length
+
+class Solution:
+    def canPlaceFlowers(self, flowerbed: [int], n: int) -> bool:
+        flowerbed = [0] + flowerbed + [0]
+        for i in range(1, len(flowerbed) - 1):
+            if flowerbed[i] == 0 and sum(flowerbed[i - 1: i + 2]) == 0:
+                flowerbed[i] = 1
+                n -= 1
+        return n <= 0

LeetCode 75/README.md

@@ -22,12 +22,12 @@
     <tr>
         <td> Kids With the Greatest Number of Candies </td>
         <td> Easy </td>
-        <td>  </td>
+        <td> <a href="./1431 Kids With the Greatest Number of Candies.py" target="_blank">Solved</a>  </td>
     </tr>
     <tr>
         <td> Can Place Flowers </td>
         <td> Easy </td>
-        <td>  </td>
+        <td> <a href="./605 Can Place Flowers.py" target="_blank">Solved</a>  </td>
     </tr>
     <tr>
         <td> Reverse Vowels of a String </td>

auto_commit.sh

@@ -6,5 +6,5 @@ TODAY=$(date +"%a,%d %b, %Y %I:%M %p")
 # add all changes
 git add .
 # commit changes
-git commit -m "🤖 Updated learning log till $TODAY with leetcode"
+git commit -m "🤖 Updated LeetCode Problems : $TODAY "
 git push origin master