Server Side Programming Articles - Page 573 of 2651

Suppose we have a coordinate (x, y). On a 2D grid, a robot is at (0, 0) position and want to reach (x, y). It can move up, down, left or right or stay at current cell. It wants to reach destination with as minimum as possible commands. We have to count the number of steps needed.So, if the input is like x = 3; y = 4, then the output will be 7StepsTo solve this, we will follow these steps −return x + y + minimum of |x - y|, |x - y + 1|, and |x - y ... Read More

Suppose we have an array A with N elements. In each operation, we pick an element and increase or decrease it by 1. We have to find at least how many operations are needed to satisfy following conditions −For every i in range 1 to n, the sum of the terms from 1st through ith term is not 0For every i in range 1 to n - 1, the sign of the terms from the 1st through ith term is different from sign of the sum of the terms from the 1st through (i+1)th term.So, if the input is like ... Read More

To generate a pseudo Vandermonde matrix of the Hermite polynomial, use the hermite.hermvander2d() in Python Numpy. The method returns the pseudo-Vandermonde matrix. The parameter, x, y are an array of point coordinates, all of the same shape. The dtypes will be converted to either float64 or complex128 depending on whether any of the elements are complex. Scalars are converted to 1-D arrays. The parameter, deg is the list of maximum degrees of the form [x_deg, y_deg].StepsAt first, import the required library −import numpy as np from numpy.polynomial import hermite as HCreate arrays of point coordinates, all of the same shape ... Read More

Suppose we have an array A with K number of elements. Consider, in a game there are N players and a game master is there. This game has K rounds. In ith round game master announces to form groups with A[i] number of children. Then the remaining children form as many groups of A[i] children as possible. One child cannot take part into multiple groups. Those who are left without a group leave the game. The others proceed to the next round. A round may have with no player loss. In the end, after the K-th round, there are exactly ... Read More

Suppose we have an array A with n elements. A function F(p) is a sorted array of sums of adjacent elements in p. So F(p) = sort([p1 + p2, p2 + p3, ... pn-1 + pn]). We have a permutation represented in A. We have to find the different permutation of A where F(A) is same.So, if the input is like A = [2, 1, 6, 5, 4, 3], then the output will be [1, 2, 5, 6, 3, 4], because F(A)=sort([2+1, 1+6, 6+5, 5+4, 4+3]) = sort([3, 7, 11, 9, 7]) = [3, 7, 7, 9, 11]. And sort([1+2, ... Read More

To generate a Hermite series with given roots, use the hermite.hermfromroots() method in Python Numpy. The method returns a 1-D array of coefficients. If all roots are real then out is a real array, if some of the roots are complex, then out is complex even if all the coefficients in the result are real. The parameter roots are the sequence containing the roots.StepsAt first, import the required library −import numpy as np from numpy.polynomial import hermite as HTo generate a Hermite series with given roots, use the hermite.hermfromroots() method in Python Numpy −print("Result...", H.hermfromroots((-1, 0, 1)))Get the datatype −print("Type...", ... Read More

To Integrate a Chebyshev series, use the chebyshev.chebint() method in Python. Returns the Chebyshev series coefficients c integrated m times from lbnd along axis. At each iteration the resulting series is multiplied by scl and an integration constant, k, is added. The 1st parameter, c is an array of Chebyshev series coefficients. If c is multidimensional the different axis correspond to different variables with the degree in each axis given by the corresponding index.The 2nd parameter, m is an order of integration, must be positive. (Default: 1). The 3rd parameter, k is an Integration constant(s). The value of the first ... Read More

To Integrate a Chebyshev series, use the chebyshev.chebint() method in Python. Returns the Chebyshev series coefficients c integrated m times from lbnd along axis. At each iteration the resulting series is multiplied by scl and an integration constant, k, is added. The 1st parameter, c is an array of Chebyshev series coefficients. If c is multidimensional the different axis correspond to different variables with the degree in each axis given by the corresponding index.The 2nd parameter, m is an order of integration, must be positive. (Default: 1). The 3rd parameter, k is an Integration constant(s). The value of the first ... Read More

Suppose we have a string S with n characters. S contains lowercase letters only. We must select a number k in range 0 to n, then select k characters from S and permute them in any order. In this process, the remaining characters will remain unchanged. We perform this whole operation exactly once. We have to find the value of k, for which S becomes sorted in alphabetical order.So, if the input is like S = "acdb", then the output will be 3, because 'a' is at the correct place and remaining characters should be rearranged.StepsTo solve this, we will ... Read More

To Integrate a Chebyshev series, use the chebyshev.chebint() method in Python. Returns the Chebyshev series coefficients c integrated m times from lbnd along axis. At each iteration the resulting series is multiplied by scl and an integration constant, k, is added. The 1st parameter, c is an array of Chebyshev series coefficients. If c is multidimensional the different axis correspond to different variables with the degree in each axis given by the corresponding index.The 2nd parameter, m is an order of integration, must be positive. (Default: 1). The 3rd parameter, k is an Integration constant(s). The value of the first ... Read More