Data Structure
Networking
RDBMS
Operating System
Java
MS Excel
iOS
HTML
CSS
Android
Python
C Programming
C++
C#
MongoDB
MySQL
Javascript
PHP
- Selected Reading
- UPSC IAS Exams Notes
- Developer's Best Practices
- Questions and Answers
- Effective Resume Writing
- HR Interview Questions
- Computer Glossary
- Who is Who
Programming Articles - Page 693 of 3366
478 Views
Suppose we have an array A with n elements, and other values l, r and k are there. Amal wants to buy chocolates and he will not buy too expensive chocolates, and not also too cheap chocolates. In the store, there are n different chocolate bars and the prices are represented in A. A chocolate bar is too expensive if its price is larger than r and too cheap if its price is less than l. He wants to spend at most k rupees. We have to find the maximum amount of chocolates he can buy.So, if the input is ... Read More
119 Views
To multiply a Laguerre series by an independent variable, use the polynomial.laguerre.lagmulx() method in Python. Multiply the Laguerre series c by x, where x is the independent variable. The parameter c is a 1-D array of Laguerre series coefficients ordered from low to high.StepsAt first, import the required library −import numpy as np from numpy.polynomial import laguerre as LCreate an array −c = np.array([1, 2, 3])Display the array −print("Our Array...", c)Check the Dimensions −print("Dimensions of our Array...", c.ndim)Get the Datatype −print("Datatype of our Array object...", c.dtype)Get the Shape −print("Shape of our Array object...", c.shape)To multiply a Laguerre series by an ... Read More
306 Views
Suppose we have an array A with n elements. In one operation, we can add 1 with any one element preset in A. If either the sum or the product of all elements in the array is equal to zero, We can do this operation one more time. We have to count the minimum number of steps needed to make both the sum and the product of all elements in the array different from zero?So, if the input is like A = [-1, 0, 0, 1], then the output will be 2, because both product and sum are 0. If ... Read More
132 Views
To subtract one Laguerre series from another, use the polynomial.laguerre.lagsub() method in Python Numpy. The method returns an array of Laguerre series coefficients representing their difference. Returns the difference of two Laguerre series c1 - c2. The sequences of coefficients are from lowest order term to highest, i.e., [1, 2, 3] represents the series P_0 + 2*P_1 + 3*P_2. The parameters c1 and c2 are 1-D arrays of Laguerre series coefficients ordered from low to high.StepsAt first, import the required library −import numpy as np from numpy.polynomial import laguerre as LCreate 1-D arrays of Laguerre series coefficients −c1 = np.array([1, ... Read More
182 Views
To generate a pseudo Vandermonde matrix of the Hermite polynomial and x, y, z sample points, use the hermite.hermvander3d() in Python Numpy. The method returns the pseudo-Vandermonde matrix. The parameter, x, y, z are arrays 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, z_deg].StepsAt first, import the required library −import numpy as np from numpy.polynomial import hermite as HCreate arrays of ... Read More
379 Views
Suppose we have five numbers b, p, f, h and c. There are two types of burgers in a restaurant. These are hamburger and chicken burger. Hamburger needs two buns and a beef patty and for chicken burger we need two buns and a chicken cutlet. We have b buns, p beef patties, f chicken cutlets. We are trying to sell hamburger for h rupees and chicken burger for c rupees. We have to find the maximum profit that we can gain.So, if the input is like b = 7; p = 5; f = 2; h = 10; c ... Read More
179 Views
Suppose we have five numbers n, k1, k2, w and b. There is a board with 2 x n cells and first k1 cells in the first row, first k2 cells in second row are colored in white. All other cells are black. We have w white dominos and b black dominos (2 x 1 size). We can place a white domino on the board if both board's cells are white and not occupied by any other domino. In the same way, a black domino can be placed if both cells are black and not occupied by any other domino. ... Read More
455 Views
Suppose we have an array A with n elements. The A[i] represents the programming skill of ith student. All elements in A are distinct. We want to split them into teams in such a way that −No two students i and j, such that |A[i] - A[j]| = 1 belong to the same teamThe number of teams is the minimum possible.So, if the input is like A = [2, 3, 4, 99, 100], then the output will be 2, because the groups are [2, 3, 4] and [99, 100]StepsTo solve this, we will follow these steps −dem := 1 sort ... Read More
579 Views
Suppose we have an array A with n elements. There was an electronic store, where a robbery has done on the last night. All keyboards which were present inside the store were numbered in ascending order from some integer number x. For example, for x=4 and there were 3 keyboards in the store, then the devices had indices 4, 5 and 6. If x=10 and there were 7 of them then the keyboards had indices 10, 11, 12, 13, 14, 15 and 16. After the robbery, only n keyboards are left. They have indices stored in array A. We have ... Read More
172 Views
Suppose we have two arrays A with n elements and B with m elements. Select some element a form A and some element b from B, such that a + b does not belong to A or B.So, if the input is like A = [3, 2, 2]; B = [1, 5, 7, 7, 9], then the output will be [3, 1], because 3 + 1 = 4 is not present in any array. (Other answers are also available)StepsTo solve this, we will follow these steps −sort the array A sort the array B return last element of A and ... Read More