I created a video on the famous Leetcode problem "Perform minimum swaps between 2 arrays to make both of them sorted". It explores a non-traditional approach that does not use DP.
Find how many string pairs are there in array such that at least one permutation of their concatentation is a palindrome.
I created a video discussing the technique to solve this.