Suppose we have an array nums with positive values, we have to find a pattern of length m that is repeated k or more than k times. Here a pattern is a non-overlapping subarray (consecutive) that consists of one or more values and are repeated multiple times. A pattern is ... Read More

Suppose we have a number n and an array called rounds. We have a circular track which consists of n different sectors labeled from 1 to n. Now consider a race will be held on this track, the race consists of m different rounds. The ith round starts at sector ... Read More

Suppose we have a number n, we have to return this number into string format where thousands are separated by comma (", ").So, if the input is like n = 512462687, then the output will be "512, 462, 687"To solve this, we will follow these steps −res := n as ... Read More

Suppose we have a string s with lower and upper case English letters. We shall consider a string is a good string which does not have any two adjacent characters s[i] and s[i + 1] where −0

Suppose we have an array called nums with positive sorted strictly increasing values, and also have an integer k. We have to find the kth positive integer that is missing from this array.So, if the input is like nums = [1, 2, 4, 8, 12], k = 6, then the ... Read More

Suppose we have an array nums, and three different integers a, b and c. We have to find the number of good triplets. A triplet (nums[i], nums[j], nums[k]) is said to be a good triplet if the following conditions are true −0

Suppose we have an array called nums, we have to check whether there are three consecutive odd numbers in nums or not.So, if the input is like nums = [18, 15, 2, 19, 3, 11, 17, 25, 20], then the output will be True as there are three consecutive odds ... Read More

Suppose we have a string s and a list of indices ind, they are of same length. The string s will be shuffled such that the character at the position i, moves to indices[i] in the final string. We have to find the final string.So, if the input is like ... Read More

Suppose we have two non-negative numbers left and right. We have to find the number of odd numbers between left and right (inclusive).So, if the input is like left = 3, right = 15, then the output will be 7 because there are 7 odd numbers in range, these are ... Read More

Suppose there are n number of full water bottles, we can exchange m empty water bottles for only one full water bottle. Now drinking a full water bottle makes it an empty bottle. We have to find the maximum number of water bottles we can drink.So, if the input is ... Read More