Suppose we have a list of numbers called nums. We have to find the number of index pairs i, j, where i < j such that nums[i] + nums[j] is equal to 2^k for some 0 >= k.So, if the input is like nums = [1, 2, 6, 3, 5], ... Read More

Suppose we have a numeric string s. We have to check whether there is some arrangement where we can have one pair of the same character and the rest of the string form any number of triplets of the same characters.So, if the input is like s = "21133123", then ... Read More

Suppose we have alphanumeric string s. It can hold both uppercase or lowercase letters. We have to check whether s is a palindrome or not considering only the lowercase alphabet characters.So, if the input is like s = "rLacHEec0a2r8", then the output will be True because the string contains "racecar" ... Read More

Suppose we have a list called relations. Where each element in relations list relations[i] contains two numbers [ai, bi] it indicates person ai is following bi on a social media platform. We have to find the list of people who follow someone and they follow them back, we have to ... Read More

Suppose we have a lowercase string s. We have to find the minimum numbers of contiguous substrings in which s is divided into parts such that each substring is either non-increasing or non-decreasing. So for example, if the string is like "pqqqr" is a non-decreasing string, and "qqqp" is a ... Read More

Suppose we have a list of numbers called nums. We have to find the minimum positive value that we can insert at the beginning of nums so that that prefix sums of the resulting list contains numbers that are all larger than 0.So, if the input is like nums = ... Read More

Suppose we have three strings text, w1, and w2. The text is a sentence with different words. We have to find the smallest distance between any two occurrences of w1 and w2 in the text, the distance is measured in number of words in between them. If either w1 or ... Read More

Suppose we have a lit of numbers called nums, and have another value k. If we remove k elements from nums, then find the minimum of (maximum of nums - minimum of nums).So, if the input is like nums = [4, 10, 3, 2, 8, 9] k = 3, then ... Read More

Suppose we have a list of numbers called nums and a value k. First we shall remove a sublist of size k, then find the minimum of (maximum of nums - minimum of nums).So, if the input is like nums = [2, 3, 10, 9, 8, 4] k = 3, ... Read More

Suppose we have a number n, we have to find the maximum number we can get by inserting 5 anywhere in the number.So, if the input is like n = 834, then the output will be 8534.To solve this, we will follow these steps −if n > 0, thens := ... Read More