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

Suppose we have two strings s and t, and two values p and q. We have to check whether it is possible to get t from s such that s is separated into groups of p number of characters except the last group which will have characters ≤ p and we can pick at most q number of characters from each group, and also order of characters in t must be same as s.So, if the input is like s = "mnonnopeqrst", t = "moprst", p = 5, q = 2, then the output will be True as we can ... Read More

Suppose we have three direction cosines l, m and n in 3-D space, we have to check whether it is possible to draw a straight line with these direction cosines or not.So, if the input is like l = 0.42426 m = 0.56568 n = 0.7071, then the output will be True as this the direction cosines of a vector {3, 4, 5}.To solve this, we will follow some rule asl = cos(a), where a is angle between the straight line and x-axism = cos(b), where b is angle between the straight line and y-axisn = cos(c), where c is ... Read More

Suppose we have an array nums that contain the size of n sides. We have to check whether we can form a polygon with all of the given sides or not.So, if the input is like nums = [3, 4, 5], then the output will be True because there are three sides and sum of any two sides is larger than the 3rd one. To solve this, we will use this property where length of one side is smaller than the sum of all other sides.To solve this, we will follow these steps −sort the list numsif last element of ... Read More

Suppose we have an angle a. We have to check whether we can make a regular polygon where all angles are same as a or not.So, if the input is like a = 120, then the output will be True the pentagon has all angles same as 120°. As we know$$Interior Angle(a)=\frac{180\times(n-2)}{n}\begin{bmatrix} n=number of sides of polygon\end{bmatrix}$$ $$¿n=\frac{360}{180-a}$$So if n is integer then this is forming a regular polygon.To solve this, we will follow these steps −sides := 360 /(180 - a)if sides has no fractional part, thenreturn Truereturn FalseExampleLet us see the following implementation to get better understanding − Live ... Read More