Matrix

Author: iamnishantchandra

10X/Python/Array/Good_Pair.py

@@ -0,0 +1,37 @@
+"""
+Good Pairs
+Given an array of integers nums (length of nums > 1).
+
+A pair (i,j) is called good if nums[i] == nums[j] and i < j.
+
+Return the number of good pairs.
+
+Input
+Single line containing a list of numbers separated by spaces
+
+Output
+Single integer representing total number of good pairs
+
+Example
+Input:
+
+1 2 3 1 1 3
+
+Output:
+
+4
+
+Explanation:
+(0,3), (0,4), (3,4), (2,5) index position elements
+
+"""
+from typing import Counter
+
+
+a=list(map(int,input().split()))
+count=0
+for i in range(len(a)):
+    for j in range(len(a)):
+        if a[i] == a[j] and i < j:
+            count+=1
+print(count)

10X/Python/Array/Matrix_Diagonal.py

@@ -0,0 +1,60 @@
+'''
+Matrix Diagonal
+Write a function which takes a 2 dimentional array of size nxn where n > 0 and changes its diagonal according to the following conditions
+
+if an element e < 0 replace it with 0
+If element e >= 0 replace it with 1
+Input
+The first line contains n, denoting the number of lists.
+
+This is followed by n lines. Each line contains n integers separated by a space
+
+Output
+n lines, each line representing a list of numbers separated by a space.
+
+Example
+Input:
+
+4
+
+2 0 1 4
+
+0 -1 1 10
+
+0 0 0 0
+
+1 2 3 4
+
+Output:
+
+1 0 1 4
+
+0 0 1 10
+
+0 0 1 0
+
+1 2 3 1
+'''
+# name your function as change_diagonal and it should take list as input
+def change_diagonal(lst):
+    for i in range(val):
+        for j in range(val):
+            if i==j:
+                if lst[i][j]<0:
+                    lst[i][j]=0
+                elif lst[i][j]>=0:
+                    lst[i][j]=1
+    return lst
+
+
+
+
+# Do not change anything below this line.
+if __name__ == "__main__":
+    val = int(input())
+    lst = []
+    for index in range(0, val):
+        lst.append([int(i) for i in input().split(' ')])
+    out = change_diagonal(lst)
+    for lst1 in out:
+        print(" ".join(str(i) for i in lst1))

10X/Python/Array/Right_left_Diagonal.py

@@ -0,0 +1,51 @@
+'''
+Right to Left Diagonal
+Write a function right_to_left_diagonal which a matrix as a list of lists of size mxm and returns a list of numbers containing elements of diagonal from right to left.
+
+Input
+M size of matrix
+
+M lines containing M elements in each line separated by space
+
+Output
+list of m elements 1 per each line.
+
+Example
+Input: 4
+
+1 2 3 4
+
+5 6 7 8
+
+9 10 11 12
+
+13 14 15 16
+
+Output:
+
+4
+
+7
+
+10
+
+13
+
+'''
+# name your function as right_to_left_diagonal
+def right_to_left_diagonal(lst):
+    out=[]
+    for i in range(m):
+        for j in range(m):
+            if (m-1)==j+i:
+                out.append(lst[i][j])
+    return out
+
+# Do not change anything below this line
+if __name__ == "__main__":
+    m = int(input())
+    lst = []    
+    for val in range(0, m):
+        lst.append([int(i) for i in input().split(' ')])
+    out = right_to_left_diagonal(lst)
+    [print(val) for val in out]

10X/Python/Array/SteepArray.py

@@ -0,0 +1,57 @@
+'''
+Steep array
+Given a list of integers. The steepness score of an index i is computed in the following way-
+
+Steepness Score(i) = (maximum element to the right of index i(including i) )- A[i])
+
+Find out the total steepness score of the array, i.e - sum of steepness scores of each index in the array.
+
+Constraints
+1<= length of array<= 100000
+
+Input
+first line of the input contains N, the size of the array. the second line contains the N space separated integers representing the N elements of the array.
+
+Output
+print the total steepness score of the array.
+
+Example
+Input:
+
+5
+
+1 2 3 5 4
+
+Output:
+
+9
+
+Explanation:
+
+for 1-> greatest element to right of 1 including 1 is 5, SS= 5-1=4
+
+for 2-> greatest element to right of 2 including 2 is 5, SS= 5-2=3
+
+for 3-> greatest element to right of 3 including 3 is 5, SS= 5-3=2
+
+for 5-> greatest element to right of 5 including 5 is 5, SS= 5-5=0
+
+for 4-> greatest element to right of 4 including 4 is 4, SS= 4-4=0
+
+hence total SS= 4+3+2=9
+'''
+import array
+n=int(input())
+su=0
+b=[]
+#b=array.array('i',[])
+b=list(map(int,input().split()))
+#for i in range(n):
+#   b.append(c[i])
+while len(b)>1:
+    ma=max(b)
+    su=su+ma-b[0]
+
+    del b[0]
+    
+print(su)