Python Program to remove a specific digit from every element of the list

Given a list of elements, the task here is to write a Python program that can remove the presence of all a specific digit from every element and then return the resultant list. 

Examples:

Input : test_list = [333, 893, 1948, 34, 2346], K = 3 
Output : [”, 89, 1948, 4, 246] 
Explanation : All occurrences of 3 are removed.

Input : test_list = [345, 893, 1948, 34, 2346], K = 5 
Output : [34, 893, 1948, 34, 2346] 
Explanation : All occurrences of 5 are removed. 

Method 1 : Using loop, str() and join()

In this, we perform the task of reforming elements by converting them to strings and checking for each digit, and ignoring while joining to get new element. Lastly, each element is converted to integer using int().

Example:

The original list is : [345, 893, 1948, 34, 2346]
Modified List : [45, 89, 1948, 4, 246]

Time complexity: O(n*m), where n is the length of the list “test_list”, and m is the average length of the string representation of the elements in “test_list”.
Auxiliary Space: O(n), where n is the length of the list “res”.

Method 2 : Using list comprehension, int(), str() and join()

Similar to the above method, joining is done using join() and interconversion is performed using int() and str().

The original list is : [345, 893, 1948, 34, 2346]
Modified List : [45, 89, 1948, 4, 246]

Time Complexity: O(N*N), where n is the number of elements in the list “test_list”.
Auxiliary Space: O(N), where n is the number of elements in the list “test_list”.

Method 3: Using replace() method

The original list is : [345, 893, 1948, 34, 2346]
Modified List : [45, 89, 1948, 4, 246]

Time complexity: O(nm), where n is the length of the list and m is the length of the largest integer in the list.
Auxiliary space: O(n), since we are creating a new list to store the modified integers.

Method #4: Using map(),lambda functions.

The original list is : [345, 893, 1948, 34, 2346]
Modified List : [45, 89, 1948, 4, 246]

Time Complexity: O(n)
Auxiliary Space: O(n)

Method #5 : Using split(),join() methods

The original list is : [345, 893, 1948, 34, 2346]
Modified List : [45, 89, 1948, 4, 246]

Time Complexity: O(n)
Auxiliary Space: O(n)

Method#6: Using Recursion

This code takes a number and a target digit as arguments and removes all occurrences of the target digit from the number using recursion. The function first extracts the right-most digit of the number, removes it, and then checks the remaining number recursively. If the right-most digit matches the target digit, it is skipped; otherwise, it is added back to the remaining number. Finally, the function returns the modified number.

Modified List : [45, 89, 1948, 4, 246]

Time complexity: O(N) 
Where n is the number of elements in the list. This is because we need to iterate through each element in the list and call the function recursively for each sublist.

Auxiliary Space: O(n)
Where n is the number of elements in the list. This is because we need to create a new list to store the modified elements, and each recursive call creates a new stack frame to store the state of the function.

Method #7: Using bitwise operations

Step-by-step approach:

• Define a function remove_digit_k that takes two arguments: a list lst and an integer k.
• Inside the function, define an empty list res to store the modified elements.
• Define a constant digit_mask as the bitwise complement of a number with a single 1-bit in the k-th position (i.e., digit_mask = ~(1 << k)).
• Loop through each element ele in the input list lst.
• If the element ele is an integer and the k-th digit is not present in its decimal representation (i.e., (ele >> k) & 1 == 0), append it to the res list as-is.
• Otherwise, use the bitwise AND operator to clear the k-th bit from the integer ele (i.e., cleared = ele & digit_mask), then convert it to a string and append it to the res list as an integer (i.e., res.append(int(str(cleared)))).
• Return the res list.

Method 7: Using string manipulation and list comprehension

In this approach, we convert the list of integers to a list of strings and then use string manipulation to remove the specific digit (K) from each string. Finally, we convert the list of strings back to a list of integers.

Step-by-step approach:

• Initialize the list of integers.
• Print the original list.
• Initialize K.
• Convert the list of integers to a list of strings using list comprehension.
• Use string manipulation to remove the specific digit (K) from each string using another list comprehension.
• Convert the list of modified strings back to a list of integers using list comprehension.
• Print the modified list.

The original list is : [345, 893, 1948, 34, 2346]
Modified List : [45, 89, 1948, 4, 246]

Time complexity: O(n*k), where n is the length of the list and k is the length of the maximum number in the list.

Auxiliary space: O(n*k), as we are creating new lists of strings and integers.