added test 2 programs

Author: thatsabhishek

Diff for: Milestone 2/Test2/Leadersinarray.py

@@ -0,0 +1,24 @@
+# Given an integer array A of size n. Find and print all the leaders present in the input array. 
+# An array element A[i] is called Leader, if all the elements following it (i.e. present at its right) are less than or equal to A[i].
+# Print all the leader elements separated by space and in the same order they are present in the input array.
+
+# Sample Input 1 :
+# 6
+# 3 12 34 2 0 -1
+# Sample Output 1 :
+# 34 2 0 -1
+
+## Read input as specified in the question.
+## Print output as specified in the question.
+
+n = int(input())
+arr = list(map(int, input().split()))
+ma = arr[-1]
+arr = arr[::-1]
+k = [arr[0]]
+for i in range(1, n):
+    if arr[i] >= ma:
+        ma = arr[i]
+        k.append(arr[i])
+k = k[::-1]
+print(*k)

Diff for: Milestone 2/Test2/MinimumLengthWord.py

@@ -0,0 +1,17 @@
+# Given a string S (that can contain multiple words), you need to find the word which has minimum length.
+# Note : If multiple words are of same length, then answer will be first minimum length word in the string.
+# Words are seperated by single space only.
+
+# Sample Input 1 :
+# this is test string
+# Sample Output 1 :
+# is
+
+## Read input as specified in the question.
+## Print output as specified in the question.
+
+s = input().split()
+l = []
+for i in s:
+    l.append(len(i))
+print(s[l.index(min(l))])

Diff for: Milestone 2/Test2/Print2DArray.py

@@ -0,0 +1,29 @@
+# Given a 2D integer array with n rows and m columns. Print the 0th row from input n times, 1st row n-1 times…..(n-1)th row will be printed 1 time.
+# Input format :
+# Line 1 : No of rows (n) and no of columns (m) (separated by single space)
+# Line 2 : Row 1 elements (separated by space)
+# Line 3 : Row 2 elements (separated by space)
+# Line 4 : and so on
+# Sample Input 1:
+# 3 3
+# 1 2 3
+# 4 5 6
+# 7 8 9
+# Sample Output 1 :
+# 1 2 3
+# 1 2 3
+# 1 2 3
+# 4 5 6
+# 4 5 6
+# 7 8 9
+
+from os import *
+from sys import *
+from collections import *
+from math import *
+
+n, m = map(int, input().split())
+for i in range(n):
+    a = list(map(int, input().split()))
+    for j in range(n-i):
+        print(*a)