In this post, we discuss the Meet in Middle problem solving technique and show through examples how we can use it to improve a naive brute force algorithm.
Table of contents:
Introduction to Meet In MiddleProblem 1: Pythagorean tripletProblem 2: Maximum sum subsetMore examples using Meet in Middle
Introduction to Meet In Middle
The meet-in-middle algorithm is a search technique used for problem solving whereby the given input size of the problem is small but not small enough for a brute fo...
Published on November 21, 2021 09:35