new problems added

Author: Dhrumil-Zion

Arrays/all_subaaray_odd_length_sum.py

@@ -0,0 +1,19 @@
+## most optimized one
+
+def sumOddLengthSubarrays(arr):
+    res = 0; freq = 0; n = len(arr)
+    for i in range(n):
+        freq = freq-(i+1)//2+(n-i+1)//2
+        res += freq*arr[i]
+    return res
+
+def sub_lists (arr):
+    k=0
+    for i in range(len(arr) + 1):
+        for j in range(i):
+            if len(arr[j: i])%2!=0:
+                k+=sum(arr[j: i])
+    return k
+
+l1 = [10,11,12]
+print(sub_lists(l1))

Arrays/good_pair.py

@@ -0,0 +1,25 @@
+nums = [1,2,3,1,1,3]
+k=0
+for i in range(len(nums)):
+    for j in range(len(nums)):
+        if nums[i]==nums[j] and i<j:
+            k+=1
+print(k)
+
+
+## java sol
+
+# class Solution {
+#     public int numIdenticalPairs(int[] nums) {
+#         int count = 0;
+#         for(int i=0;i<nums.length;i++){
+#             for(int j=0;j<nums.length;j++){
+#                 if(nums[i]==nums[j] && i<j){
+#                     count++;
+#                 }
+#             }
+#         }
+#         return count;
+        
+#     }
+# }

Arrays/max_wealth.py

@@ -0,0 +1,21 @@
+accounts = [[2,8,7],[7,1,3],[1,9,5]]
+temp = [sum(c) for c in accounts]
+print(max(temp))
+
+
+## java 100% faster 
+
+# class Solution {
+#     public int maximumWealth(int[][] accounts) {
+#      int wealth=0;
+#      int max_wealth=0;
+#         for(int i =0;i<accounts.length;i++){
+#             for(int j=0;j<accounts[0].length;j++){
+#                 wealth=wealth+accounts[i][j];
+#                 max_wealth=Math.max(max_wealth,wealth);
+#             }
+#             wealth=0;
+#         }
+#         return max_wealth;
+#     }
+# }