Hi pleasee help!I want to write a programme that takes in aninput string and find anagrams of the input stringin a list that’s sorted alphabetically e.g.[‘aa’,’ab’,’bc’]. The search needs to be O(k logN + W) in theworst-case where W is the output size (i.e., the number ofcharacters in the output). N is the input array and k is the mumberof characters in the smaller string that is compared.So I plan tosearch for all the anagrams through BINARY SEARCH.Can u please helpme write a binary search to search for all the anagrams?
This is my function to check if two words are
PayPal Gateway not configured
PayPal Gateway not configured