Two Sum Problem in Swift
Hallo beren en zalmen, Leo hier. Today we will solve the very first Leetcode challenge called the Two Sum problem in Swift. This problem looks very simple at first. You just have to traverse the array with two loops and find what is asked. But that is the best approach? What if we could optimize the […]
Inventory Update Problem in Swift
Hey guys, Leo here. Today we’ll continue the series Algorithms, the Final Frontier. Always remember folks, this is ONE of many possible solutions for the problem. The challenge is here: The Challenge Let’s go! The problem: Compare and update the inventory stored in a 2D array against a second 2D array of a fresh delivery. […]
