Spaghetti with BQN

Photo by Mae Mu on Unsplash

One of the most famous problems that we all learn when we start our journey into algorithms is “Two Sum” where one is supposed to find the pair of numbers that sum up to a target value.

This problem has at least three different solutions which are widely quoted:

1. Brute Force where we check every possible combination of the elements. This has a time complexity of O(n²)