# Hudson River Trading\n![image](https://assets.leetcode.com/users/images/4c286c74-2d38-4338-b3bf-b86f75fcb8ae_1624625292.736949.png)\n\nMy solution is O(n) by creating two sets of unique number. one set is increasing and another set is decreasing.\n\nAny idea if this is correct approach or any other approach?\n

Hudson River Trading\n\n\nMy solution is O(n) by creating two sets of unique number. one set is increasing and another set is decreasing.\n\nAny idea if this is