**Time** - 90 minutes\n**Platform** - Hackerrank\n\n**Problem 1 (Hard)** - Merging two given strings such that number of inversions is minimum in the final string. (An inversion in a string `s` is defined as `0 < i < j < len(s)` where `s[i] > s[j]`).  \nLength of both the strings is `0 < len < 1000`.\n\nI believe this is a DP problem, managed to solve 11/15 test cases. Didn\'t have time to debug the failures.\n\n**Problem 2 (Medium)** - A variation of [Asteroid Collision](https://leetcode.com/problems/asteroid-collision/description/).

Time - 90 minutes\nPlatform - Hackerrank\n\nProblem 1 (Hard) - Merging two given strings such that number of inversions is minimum in the final string. (An inve