human
Find two numbers with sum N such that neither of them contains digit K | Python3 implementation of the above approach.
Count leading zeros.
It removes i characters starting from index 0.
Check each digit of the N.
If digit is K break it.
For odd numbers.
Add D1 to A and D2 to B.
If the digit is not K , no need to break String D in A and 0 in B.
Remove leading zeros.
Print the answer.
Driver code"
How can the above be solved in Python?

=====
Give me a code to find two numbers with sum N such that neither of them contains digit K and the other steps required?
assistant
#Here is code to find two numbers with sum N such that neither of them contains digit K and the other steps required.
 def removeLeadingZeros ( Str ) :
	i = 0
	n = len ( Str )
	while ( Str [ i ] == '0' and i < n ) :
		i += 1
	Str = Str [ i : ]
	return Str
def findPairs ( Sum , K ) :
	A = " "
	B = " "
	N = str ( Sum )
	n = len ( N )
	for i in range ( n ) :
	D = int ( N [ i ] ) - int ( '0' )
	if ( D == K ) :
		D1 = D // 2 ;
		D2 = ( D // 2 ) + ( D % 2 )
		A = A + ( str ) ( D1 + int ( '0' ) )
		B = B + ( str ) ( D2 + int ( '0' ) )
	else :
		A = A + ( str ) ( D + int ( '0' ) )
		B = B + '0'
	A = removeLeadingZeros ( A )
	B = removeLeadingZeros ( B )
	print ( A + " , ▁ " + B )
N = 33673
K = 3
findPairs ( N , K )