[FEATURE] Add "Meet in the Middle" Folder with Classical Problems

[DataWorshipper]

Detailed description

Description:

I'd like to propose adding a new folder called "Meet in the Middle" under the repository’s Algorithms / Problem Solving section. Currently, this technique — a powerful optimization method often used for subset sum, combinatorial problems, and other exponential-time problems — does not have a dedicated folder in the repository.

What I Plan to Add

Folder: Meet_in_the_Middle (or MeetInTheMiddle)

Classical Problems Implemented:

Subset Sum Variants (e.g., Count of subsets with sum ≤ target)

Maximum Product / Sum over Subsets

Combinatorial Selection Problems (like 2^N problem optimization)

Other standard problems demonstrating the technique

For Each Problem:

Problem Statement with examples

Constraints & Assumptions

Efficient Implementation in C++ / Python

Comments explaining the logic and optimization steps

Test cases to verify correctness

Context

Meet in the Middle is a core algorithmic technique that reduces otherwise infeasible exponential solutions (O(2^N)) to manageable O(2^(N/2)) solutions.

Currently missing from the repository — this will fill an important gap for learners and competitive programmers.

Helps developers understand:

Problem decomposition into halves

Combination of solutions from two subsets

Efficient use of data structures (sets, binary search, maps)

Possible implementation

No response

Additional information

Include helper functions to generate subset sums efficiently.

Add brief notes or diagrams illustrating the approach for easier understanding.