Two strings are said to be nearly equal iff a single mutation applied to one string will result in another string. That means, Given two strings s1 and s2, find if s1 can be converted to s2 with exactly one edit(mutation). If yes, then the function should return a True value as the result. Otherwise, it must return a False value as the result.
EXERCISE - 9(b)
Description:
We need to write a function dups to find all duplicate elements in the list. If an element is repeated more than once in the list, then add that repeated element to the resultant list.
EXERCISE - 9(C)
We need to write a function dups to find all duplicate elements in the list. If an element is repeated more than once in the list, then add that repeated element to the resultant list.
EXERCISE - 9(C)
Description:
We need to write a function unique to find all unique elements in the list. If an element is found only once in the list, then add that element to the resultant list.
We need to write a function unique to find all unique elements in the list. If an element is found only once in the list, then add that element to the resultant list.
No comments