https://ahessmat.netlify.com/tags/code/Recent content in code on Asa's WebsiteHugo -- gohugo.ioen-usFri, 23 Jul 2021 17:08:10 +0000https://ahessmat.netlify.com/post/2021-07-the-two-sum-problem/Fri, 23 Jul 2021 17:08:10 +0000https://ahessmat.netlify.com/post/2021-07-the-two-sum-problem/The Two-Sum problem is a simple interview question where: …given an array of integers of varying values (both positive and negative; they may repeat)… …and a target integer that is achievable… …identify the 2 integers in the array (by index) that - when summed together - equate to the target; an element may only be used once. I initially thought to try a brute-force solution, wherein I would iterate over every entry in the list and see if that would match to an entry we had seen before: