human
Greatest contiguous sub | Function that returns the sub - array.
Data - structure to store all the sub - arrays of size K.
Iterate to find all the sub - arrays.
Store the sub - array elements in the array.
Push the vector in the container.
Sort the vector of elements.
The last sub - array in the sorted order will be the answer.
Driver code.
Get the sub - array"
How can the above be solved in Python?
 Can you provide a code to greatest contiguous sub and the other steps required?
assistant
#Here is code to greatest contiguous sub and the other steps required.
 def findSubarray ( a , k , n ) :
	vec = [ ]
	for i in range ( n - k + 1 ) :
		temp = [ ]
		for j in range ( i , i + k ) :
			temp . append ( a [ j ] )
		vec . append ( temp )
	vec = sorted ( vec )
	return vec [ len ( vec ) - 1 ]
a = [ 1 , 4 , 3 , 2 , 5 ]
k = 4
n = len ( a )
ans = findSubarray ( a , k , n )
for it in ans :
	print ( it , end = " ▁ " )