i am facing difficulty with these 2 questions:
7.Give the space complexity for removing the specified characters in a string which are given in another string using the concept of Hashing (Consider the length of both strings to be n)
8.Linear Probing suffers from which leads to .
Please help me with two questions
For question 7, answer must be O(n). It is marked wrong.
Ques 8 is theoretical refer this https://www.geeksforgeeks.org/hashing-set-3-open-addressing/