I’ve implemented the solution in O(m+n) time and using space O(1) and only 1 test case failing. Any hint regarding it? Since it’s only 1 test case so I think my approach is correct?
You are using hashing which is O(1) amortised and O(n) in worst case. This question can be solved without use of Hashing.
This is the new approach which I am using (also causing failures). This question was for another approach.
Shall I closed this issue then?
Yeah close this issue.
Closing this topic as it has been solved by you yourself. Great job, keep working hard. if its not resolved feel free to un-mark the accepted solution to re-open the topic.