Programming Articles - Page 1742 of 3366

Suppose we have a list of unique integers called nums. We have to find the number of integers that could still be successfully found using a standard binary search.So, if the input is like [2,6,4,3,10], then the output will be 3, as if we use binary search to look for 4, we can find it at first iteration. We can also find 2 and 10 after two iterations.To solve this, we will follow these steps −Define a function help(), this will take target, an array & nums,low := 0high := size of nums - 1while low

Suppose we have a non-negative integer called num, we have to check whether it is a palindrome or not, but not using a string.So, if the input is like 1331, then the output will be true.To solve this, we will follow these steps −ret := 0x := numwhile num > 0, do −d := num mod 10ret := ret * 10ret := ret + dnum := num / 10return true when x is same as retLet us see the following implementation to get better understanding −Example Live Demo#include using namespace std; class Solution {    public:    bool solve(int num) ... Read More

Suppose we have one binary matrix. We have to find the maximum number of 1s we can get if we flip a row and then flip a column.So, if the input is like101010100then the output will be 8To solve this, we will follow these steps −n := size of rows in matrixm := size of columns in matrixret := 0Define an array row of size nDefine an array col of size ntotal := 0for initialize i := 0, when i < n, update (increase i by 1), do −for initialize j := 0, when j < m, update (increase j ... Read More

Suppose we have a string s where each character is either "L", "R" or "?". "L" means moved one unit left, "R" means moved one unit right, and "?" means either "L" or "R". If we are at position 0, we have to find the maximum possible distance we could be from 0 by replacing "?" with "L" or "R".So, if the input is like "LLRRL??", then the output will be 3, replace ? using L to move 5 units left and 2 units right, so maximum displacement is 3.To solve this, we will follow these steps −op := 0, ... Read More

Suppose we have one integer array called nums and this contains 0s and 1s. Suppose we have an operation where we pick an index i in nums and flip element at index i as well as all numbers to the right of i. We have to find the minimum number of operations required to make nums contain all 0s.So, if the input is like [1, 0, 1], then the output will be 3, operation on index 0, it will convert [0, 1, 0], then on index 1 [0, 0, 1], then index 2, [0, 0, 0].To solve this, we will ... Read More

Suppose we have a list of integers called nums, we have to find whether we can partition the list into two sublists (non-empty) such that every number in the left part is strictly less than every number in the right part.So, if the input is like [6, 4, 3, 8, 10], then the output will be true, as left = [6, 4, 3] and right = [8, 10]To solve this, we will follow these steps −n := size of numsDefine an array right of size nDefine an array left of size nleft[0] := nums[0]last element of right := last element ... Read More

Suppose we have a two-dimensional list of intervals where each interval has two values [start, end]. We have to find whether there's an interval which contains another interval.So, if the input is like [[2, 4], [5, 11], [5, 9], [10, 10]], then the output will be true as [5, 11] is containing [5, 9].To solve this, we will follow these steps −sort the array vDefine one 2D array retfor each interval it in v −if ret is empty, then −insert it at the end of retotherwise when last element of ret >= it[0], then −return trueOtherwiseinsert it at the end ... Read More

Suppose we have a list of integers called nums. Now suppose an operation where we select some subset of integers in the list and increment all of them by one. We have to find the minimum number of required operations to make all values in the list equal to each other.So, if the input is like [1, 3, 5], then the output will be 4.To solve this, we will follow these steps −if size of nums is same as 1, then −return 0ret := 0maxVal := -infminVal := inffor initialize i := 0, when i < size of nums, update ... Read More

Suppose we have a list of distinct integers called nums. We have to find the size of the largest interval (inclusive) [start, end] such that it contains at most one number in nums.So, if the input is like nums = [10, 6, 20], then the output will be 99990, as the largest interval is [11, 100000], this contains 20 only.To solve this, we will follow these steps −ret := -infend := 100000prev := 1sort the array numsn := size of numsfor initialize i := 0, when i < size of nums, update (increase i by 1), do −if i + ... Read More

We are given an array of integer elements and the task is to find the sub-sequences from the given array which are having GCD as 1. GCD is the greatest common divisor of two or more integers that divides the given numbers entirely and greatest amongst all.Input − int arr[] = {3, 4, 8, 16}Output − Count of number of sub-sequences with GCD 1 are − 7Explanation −The sub-sequences that can be formed from the given array with GCD as 1 are (3, 4), (3, 8), (3, 16), (4, 3), (8, 3), (16, 3), (3, 4, 8)Input − int arr[] ... Read More