Programming Articles - Page 1487 of 3363

Suppose we have an unordered array of numbers called nums and all elements are in range 0 to n-1. We can swap adjacent elements in nums as many times as required but only when the absolute difference between these element is 1. We have to check whether we can sort the nums or not.So, if the input is like nums = [1, 0, 3, 2, 5, 4], then the output will be True as we can swap these pairs [(1, 0), (3, 2), (5, 4)] to sort [0, 1, 2, 3, 4, 5].To solve this, we will follow these steps ... Read More

Suppose we have an array called notes represents different rupee notes holding by customers in a queue. They are all waiting to buy tickets worth Rs 50. Here possible notes are [50, 100 and 200]. We have to check whether we can sell tickets to the people in order or not, initially we have Rs 0 in our hand.So, if the input is like notes = [50, 50, 100, 100], then the output will be True for first two we do not need to return anything, but now we have two Rs 50 notes. So for last two we can ... Read More

Suppose we are at position (0, 0) We have a string represents consecutive directions using four letters. We have to check whether we can return at (0, 0) position after considering all of the given directions. The symbols areE for eastW for westN for northS for south.So, if the input is like "EENWWS", then the output will be true, move east two units, then go north, then west two units then again south, so this is the starting position.To solve this, we will follow these steps −l := size of moves arrayif l is same as 0, then −return truelft ... Read More

Suppose we have a list of rectangles represented using its length and breadth. We can rotate any rectangle by 90 degrees so after rotating, the breadth will become length and vice-versa. We have to check whether we can sort the rectangles in non-increasing order of breadth.So, if the input is like rects = [[4, 5], [5, 7], [4, 6]], then the output will be True as the breadths are [5, 7, 6] now if we rotate last two rectangles then breadths will be [5, 5, 4] which is in non-increasing way.To solve this, we will follow these steps −m := ... Read More

Suppose we have a binary string s whose length is 2 or more. We have to check whether we can rearrange s such that there are alternate 0s and 1s.So, if the input is like s = "1000111", then the output will be True as we can form "1010101" from s.To solve this, we will follow these steps −one_count := count of 1 in binary string szero_count := count of 0 in binary string sif size of s is even, thenreturn true when one_count is same as zero_count otherwise falsereturn true when |one_count - zero_count| is same as 1 otherwise ... Read More

Suppose we have three vectors x, y and z in 2D plane. We have to check whether we can get vector y from vector x by rotating it 90 degrees(clockwise) or adding z with it any number of times as required.So, if the input is like x = (-4, -2) y = (-1, 2) z = (-2, -1), then the output will be True as we can add z with x to get location (-2, -1), then rotate 90° clockwise to get (-1, 2).To solve this, we will follow these steps −Define a function util() . This will take p, ... Read More

Suppose we are at starting position p, we can jump at any direction (left or right) d1 and d2 units. We have to find minimum number of steps required to reach at position q by jumping from p.So, if the input is like p = 5, q = 10, d1 = 4, d2 = 3, then the output will be 3 as we can jump to right using distance 4 twice then we can reach at location 13, then jump left 3 units to reach 10.To solve this, we will follow these steps −gcd_res := gcd of d1 and d2if ... Read More

Suppose we have a coordinate point (x, y) and another value n. We have to check whether we can move from (0, 0) to (x, y) using n steps or not. We can move any of the four directions left, right, up and down.So, if the input is like p = (2, 1) n = 3, then the output will be True we can move two step to the right then one step to the up direction.To solve this, we will follow these steps −if n >= |x of p| + |y of p| and (n -(|x of p| + ... Read More

Suppose we have two matrices of size n x m named mat1 and mat2. We have to check where these two matrices are strictly increasing or not by swapping only two elements in different matrices only when they are at position (i, j) in both matrices.So, if the input is like7151610149817then the output will be True as we can swap (7, 14) and (10, 17) pairs to make them strictly increasing.1415161779810To solve this, we will follow these steps −row := row count of mat1col := column count of mat1for i in range 0 to row - 1, dofor j in ... Read More

Suppose we have an array of n different second values. We have to check whether it is possible to start from 12'O clock and go back to 12 by only adding or subtracting the given seconds or not. We can use all given seconds exactly once, we can either add seconds or subtract it.So, if the input is like seconds = [40, 90, 50], then the output will be True as it can add 40 then subtract 90 then again add 50.To solve this, we will follow these steps −size := 2^(length of seconds array)for c in range 0 to ... Read More