Unique Integer Sequences Solution

Problem Statement

You are given an array of integers `arr` and an integer `k`. Develop a system to find all unique sequences of length `k` that can be formed from the given array, ensuring that each sequence contains distinct integers. The system should handle a large number of input arrays efficiently.

Constraints

• 1 <= k <= 10
• 1 <= arr.length <= 1000
• -10^5 <= arr[i] <= 10^5
• All elements in the array are integers

More Two Pointers Problems