Given an array of integers, determine if there exists a subsequence of three integers nums[i], nums[j], nums[k] where i < j < k and nums[i] < nums[k] < nums[j]. Return true if such a subsequence exists, otherwise return false.
You are playing a game with a circular array where each element indicates how many steps to move forward or backward. Determine if there exists a cycle in the array where the cycle has more than one element and all elements in the cycle move in the same direction. Return true if such a cycle exists, otherwise return false.
Given a string s, return the number of unique non-empty substrings of s that are present in the infinite wraparound string ‘abcdefghijklmnopqrstuvwxyz’.
Given an array of binary strings strs and two integers m and n, return the size of the largest subset of strs such that there are at most m zeros and n ones in the subset.
You are given the positions of houses and heaters along a horizontal line. Your task is to find the minimum radius required for the heaters so that all houses are within the heater’s warm radius.
The Hamming distance between two integers is the number of positions at which the corresponding bits differ. Given an integer array nums, return the sum of Hamming distances between all pairs of integers in nums.
