Programming Articles - Page 1741 of 3363

Suppose we have a list of fractions where each fraction contains [numerator, denominator] (numerator / denominator). We have ti find a new list of fractions such that the numbers in fractions are −In their most reduced terms. (20 / 14 becomes 10 / 7).Any duplicate fractions (after reducing) will be removed.Sorted in ascending order by their actual value.If the number is negative, the '-' sign will be with the numerator.So, if the input is like {{16, 8}, {4, 2}, {7, 3}, {14, 6}, {20, 4}, {-6, 12}}, then the output will be [[-1, 2], [2, 1], [7, 3], [5, 1]]To ... Read More

Suppose we have a list of requests, where requests[i] contains [t, d] indicating at time t, a person arrived at the door and either wanted to go inside (inside is indicating using 1) or go outside (outside is indicating using 0).So if there is only one door and it takes one time unit to use the door, there are few rules that we have to follow −The door starts with 'in' position and then is set to the position used by the last participant.If there's only one participant at the door at given time t, they can use the door.If ... Read More

Suppose we have a list of lists of integers intervals where each element has interval like [start, end]. We have to find the most frequently occurred number in the intervals. If there are ties, then return the smallest number.So, if the input is like [[2, 5], [4, 6], [7, 10], [8, 10]], then the output will be 4To solve this, we will follow these steps −Define one map mcnt := 0, val := 0for each value it in x −(increase m[it[0]] by 1)decrease m[it[1] + 1] by 1last := 0for each key it in mlast := last + value of ... Read More

Suppose we have one number n. Here n indicates n full beer bottles. If we can exchange 3 empty beer bottles for 1 full beer bottle, we have to find the number of beer bottles we can drink.So, if the input is like 10, then the output will be 14.To solve this, we will follow these steps −Define a function solve(), this will take n, ret := 0while n >= 3, do −q := n / 3ret := ret + q * 3n := n - q * 3n := n + qret := ret + nreturn retLet us see ... Read More

Suppose we have a list of integers nums, we have to sort the list in this manner −First element is maximumSecond element is minimumThird element is 2nd maximumFourth element is 2nd minimumAnd so on.So, if the input is like [6,3,10,4], then the output will be [10, 3, 6, 4]To solve this, we will follow these steps −Define an array retsort the array numsj := size of nums - 1i := 0while i

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