Given an array of non-negative integers arr, you are initially positioned at start index of the array. When you are at index i, you can jump to i + arr[i] or i - arr[i], check if you can reach to any index with value 0. Notice that you can not jump outside of the array at any time.......
Given head which is a reference node to a singly-linked list. The value of each node in the linked list is either 0 or 1. The linked list holds the binary representation of a number. Return the decimal value of the number in the linked list.......
Given an integer array nums, return an array answer such that answer[i] is equal to the product of all the elements of nums except nums[i].......
Nearly everyone has used the Multiplication Table. The multiplication table of size m x n is an integer matrix mat where mat[i][j] == i * j (1-indexed). Given three integers m, n, and k, return the kth smallest element in the m x n multiplication table.......
Design the CombinationIterator class; 1. CombinationIterator(string characters, int combinationLength) Initializes the object with a string characters of sorted distinct lowercase English letters and a number combinationLength as arguments. 2. next() Returns the next combination of length combinationLength in lexicographical order. 3. hasNext() Returns true if and only if there exists a next combination.......
Given a set of distinct positive integers nums, return the largest subset answer such that every pair (answer[i], answer[j]) of elements in this subset satisfies; 1. answer[i] % answer[j] == 0, or 2. answer[j] % answer[i] == 0 If there are multiple solutions, return any of them.......