Added 2028

Author: MonitSharma

2028-find-missing-observation/solution.py

@@ -0,0 +1,12 @@
+class Solution:
+  def missingRolls(self, rolls: list[int], mean: int, n: int) -> list[int]:
+    targetSum = (len(rolls) + n) * mean
+    missingSum = targetSum - sum(rolls)
+    if missingSum > n * 6 or missingSum < n:
+      return []
+
+    ans = [missingSum // n] * n
+    for i in range(missingSum % n):
+      ans[i] += 1
+
+    return ans

README.md

@@ -184,7 +184,8 @@ This repository contains solutions to over 500 Leetcode problems that are organi
 | 1964 | Find the Longest Valid Obstacle Course at Each Position | [![Medium](https://img.shields.io/badge/Medium-12100E?style=for-the-badge&logo=medium&logoColor=white)](https://medium.com/@_monitsharma/daily-leetcode-problems-problem-1964-find-the-longest-valid-obstacle-course-at-each-position-ade63a37c125) |
 | 1970 | Last Day Where You Can Still Cross | [![Medium](https://img.shields.io/badge/Medium-12100E?style=for-the-badge&logo=medium&logoColor=white)](https://medium.com/@_monitsharma/daily-leetcode-problems-problem-1970-last-day-where-you-can-still-cross-694827e6055) |
 | 2009 | Minimum Number of Operations to Make Array Continuous | [![Medium](https://img.shields.io/badge/Medium-12100E?style=for-the-badge&logo=medium&logoColor=white)](https://medium.com/@_monitsharma/daily-leetcode-problems-2009-minimum-number-of-operations-to-make-array-continuous-334e1e25f826) |
-| 2022 | Convert 1D Array Into 2D Array | [![Medium](https://img.shields.io/badge/Medium-12100E?style=for-the-badge&logo=medium&logoColor=white)]() |
+| 2022 | Convert 1D Array Into 2D Array | [![Medium](https://img.shields.io/badge/Medium-12100E?style=for-the-badge&logo=medium&logoColor=white)](https://github.com/MonitSharma/LeetCode-Solutions/tree/main/2022-converting-1d-to-2d) |
+| 2028 | Find Missing Observation | [![Medium](https://img.shields.io/badge/Medium-12100E?style=for-the-badge&logo=medium&logoColor=white)]() |
 | 2024 | Maximize the confusion of an Exam | [![Medium](https://img.shields.io/badge/Medium-12100E?style=for-the-badge&logo=medium&logoColor=white)](https://medium.com/@_monitsharma/daily-leetcode-problems-problem-2024-maximize-the-confusion-of-an-exam-1754351c0c60) |
 | 2038 | Remove Colored Pieces if Both Neighbors are the same color | [![Medium](https://img.shields.io/badge/Medium-12100E?style=for-the-badge&logo=medium&logoColor=white)](https://medium.com/@_monitsharma/daily-leetcode-problems-2038-remove-colored-pieces-if-both-neighbors-are-the-same-color-aec52bf4300d) |
 | 2050 | Parallel Courses III | [![Medium](https://img.shields.io/badge/Medium-12100E?style=for-the-badge&logo=medium&logoColor=white)](https://medium.com/@_monitsharma/daily-leetcode-problems-2050-parallel-courses-iii-87d84ef83437) |