some changes

Array problems/Arrays/643. Maximum Average Subarray I.py

@@ -1,11 +1,15 @@
 class Solution:
     def findMaxAverage(self, nums, k: int) -> float:
-        pass
-
-
-
-
-if __name__=="__main__":
-    nums = [1,12,-5,-6,50,3], k = 4
-    s=Solution()
-    print(s.findMaxAverage(nums,k))
+        current_sum = sum(nums[:k])
+        max_sum = current_sum
+
+        for i in range(k, len(nums)):
+            current_sum = current_sum - nums[i - k] + nums[i]
+            max_sum = max(max_sum, current_sum)
+        return max_sum / k
+
+if __name__ == "__main__":
+    nums = [1, 12, -5, -6, 50, 3]
+    k = 4
+    s = Solution()
+    print(s.findMaxAverage(nums, k))  

Array problems/Arrays/sort the array according to frequency.py

@@ -0,0 +1,10 @@
+
+from collections import Counter
+class Solution:
+    def sortByFreq(self,arr):
+        frequency = Counter(arr)
+        sorted_arr = sorted(arr, key=lambda x: (-frequency[x], x))
+
+        return sorted_arr
+a=Solution().sortByFreq([12,23,34,2,12,12,23])
+print(a)