human
Longest Common Prefix Matching | Set | A Utility Function to find the common prefix between first and last strings.
Compare str1 and str2.
A Function that returns the longest common prefix from the array of strings.
sorts the N set of strings.
prints the common prefix of the first and the last string of the set of strings.
Driver Code"
Solution in Python:
 ... What is a code to longest Common Prefix Matching and the other steps required?
assistant
#Here is code to longest Common Prefix Matching and the other steps required.
 def commonPrefixUtil ( str1 , str2 ) :
	n1 = len ( str1 )
	n2 = len ( str2 )
	result = " "
	j = 0
	i = 0
	while ( i <= n1 - 1 and j <= n2 - 1 ) :
		if ( str1 [ i ] != str2 [ j ] ) :
			break
		result += ( str1 [ i ] )
		i += 1
		j += 1
	return ( result )
def commonPrefix ( arr , n ) :
	arr . sort ( reverse = False )
	print ( commonPrefixUtil ( arr [ 0 ] , arr [ n - 1 ] ) )
if __name__ == ' _ _ main _ _ ' :
	arr = [ " geeksforgeeks " , " geeks " , " geek " , " geezer " ]
	n = len ( arr )
	commonPrefix ( arr , n )