[1.Minimum Window Subsequence](https://leetcode.com/problems/minimum-window-subsequence/)\n[2.Predict the Winner](https://leetcode.com/problems/predict-the-winner/)\n3.Given an array of integers A(max size 10^5) and an integer X(max value 10^6) find pairs which follows given conditions:\n  1.A[i] == A[j]\n  2.i < j\n  3. (i * j) % X == 0\n\nIf anyone has any solutions or approaches to 3rd question i would be happy to discuss. Thanks!

1.Minimum Window Subsequence\n2.Predict the Winner\n3.Given an array of integers A(max size 10^5) and an integer X(max value 10^6) find pairs which follows give