Levenshtein distance is a metric for the distance between two strings. It is defined by three different types of edits: substitution, insertion, and deletion. The Levenshtein distance between two strings is the minimum number of edits to get from one string to the other. Read more
The Knapsack problem is a Dynamic Programming problem. We have to maximize the total value of the items, while making sure the total weight of the items is lower than a specific value. There are two variations to this problem:
This is an intermediate level Unreal Engine 4 tutorial on how to save and read variables. This is useful for keeping values even when the game is not running. In my examples, I am saving GUI settings that were acquired through a settings menu in the main menu. Read more
This is a basic Unreal Engine 4 guide on how to zoom in when you hold the button and zoom out when you release the button. This is useful when making binoculars or telescopes that the player can see through. Includes adding post process effects after zooming in and resetting it after zooming out. Read more
This beginner friendly tutorial is about how to make two (or more) characters in Unreal Engine 4 move at the same time.