Is the sorting is only one solution for the the target problem

#1

can we do it in o(n) ,by avoiding sorting

#2

For solving the target sum problem in O(n) you can use unordered_set/ unordered_map. For any x, search for t-x in container.

#3

I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.

On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.