Given an array of integers and numbers k and m, write a function that returns true if given array can be divided into pairs such that the sum of every pair gives remainder m when divided by k.

Input: N= 4

arr=2 1 5 7

K=9

M=3

Output: true

def rem(L,N,M,K): if len(L)==0: return True if N>0 and N%2==0: for i in range(1,N): sum=(L[0]+L[i])%K if sum == M: L.pop(i) L.pop(0) return rem(L,N-2,M,K) return False N=int(input('Enter the N number: ')) L=list(map(int,input('Enter an array of integers: ').split(' '))) K=int(input('Enter the K value: ')) M=int(input('Enter the M value: ')) print(rem(L,N,M,K))

Input_1:

Enter the N number: 4

Enter an array of integers: 2 1 5 7

Enter the K value: 9

Enter the M value: 3

Output:

True

Input_2:

Enter the N number: 10

Enter an array of integers: 1 2 3 4 5 10 6 7 8 9

Enter the K value: 5

Enter the M value: 0

Output:

True

**Morae Q!**

->Convert Numbers into Roman Numerals

->Given the string s, return the size of the longest sub-string

->Given an array of string words. Return all strings in words which is sub-string of another word in any order.

->Return the minimum positive value of startValue such that the step by step is never less than 1.

->Given the number k, return the minimum number of Fibonacci.

->Given a string s of zeros and ones, return the maximum score after splitting the string

->Given a sorted array and a value x,Write a efficient functions to find floor of x.

->Print all numbers less than n which are having digits only 3 or 7 or both.

->Function that returns true if given array can be divided into pairs.

->Find the smallest element in the list that is larger than the given target.

->Print the First N prime numbers.

->The Chef’s Binary Tree.

->The minimum number of strikes he will have to make.(so that all his enemies have the same name)

->Sum of Natural Numbers.

->Sum of the Input.

->Find the Sum of the Series: 1 + 1/2 + 1/3 + .. + 1/N.

->Put Even and Odd elements in a List into Two Different Lists.

->Python Program to Merge Two Lists and Sort it.

->Median of Three.

->Python Program to Find the Largest Number in a List.