# 100 numpy exercises

This is a collection of exercises that have been collected in the numpy mailing list, on stack
overflow

and in the numpy documentation. The goal of this collection is to offer a quick reference for
both old

and new users but also to provide a set of exercises for those who teach.

If you find an error or think you've a better way to solve some of them, feel

free to open an issue at <[Link]

File automatically generated. See the documentation to update questions/answers/hints

programmatically.

#### 1. Import the numpy package under the name `np` (★☆☆)

```python

import numpy as np

```

#### 2. Print the numpy version and the configuration (★☆☆)

```python

print(np.__version__)

np.show_config()

```
#### 3. Create a null vector of size 10 (★☆☆)

```python

Z = [Link](10)

print(Z)

```

#### 4. How to find the memory size of any array (★☆☆)

```python

Z = [Link]((10,10))

print("%d bytes" % ([Link] * [Link]))

```

#### 5. How to get the documentation of the numpy add function from the command line?
(★☆☆)

```python

%run `python -c "import numpy; [Link]([Link])"`

```

#### 6. Create a null vector of size 10 but the fifth value which is 1 (★☆☆)

```python

Z = [Link](10)
Z[4] = 1

print(Z)

```

#### 7. Create a vector with values ranging from 10 to 49 (★☆☆)

```python

Z = [Link](10,50)

print(Z)

```

#### 8. Reverse a vector (first element becomes last) (★☆☆)

```python

Z = [Link](50)

Z = Z[::-1]

print(Z)

```

#### 9. Create a 3x3 matrix with values ranging from 0 to 8 (★☆☆)

```python

Z = [Link](9).reshape(3, 3)

print(Z)

```

#### 10. Find indices of non-zero elements from [1,2,0,0,4,0] (★☆☆)

```python

nz = [Link]([1,2,0,0,4,0])

print(nz)

```

#### 11. Create a 3x3 identity matrix (★☆☆)

```python

Z = [Link](3)

print(Z)

```

#### 12. Create a 3x3x3 array with random values (★☆☆)

```python

Z = [Link]((3,3,3))

print(Z)

```

#### 13. Create a 10x10 array with random values and find the minimum and maximum
values (★☆☆)

```python

Z = [Link]((10,10))
Zmin, Zmax = [Link](), [Link]()

print(Zmin, Zmax)

```

#### 14. Create a random vector of size 30 and find the mean value (★☆☆)

```python

Z = [Link](30)

m = [Link]()

print(m)

```

#### 15. Create a 2d array with 1 on the border and 0 inside (★☆☆)

```python

Z = [Link]((10,10))

Z[1:-1,1:-1] = 0

print(Z)

```

#### 16. How to add a border (filled with 0's) around an existing array? (★☆☆)

```python

Z = [Link]((5,5))

Z = [Link](Z, pad_width=1, mode='constant', constant_values=0)

print(Z)
# Using fancy indexing

Z[:, [0, -1]] = 0

Z[[0, -1], :] = 0

print(Z)

```

#### 17. What is the result of the following expression? (★☆☆)

```python

0 * [Link]

[Link] == [Link]

[Link] > [Link]

[Link] - [Link]

[Link] in set([[Link]])

0.3 == 3 * 0.1

```

```python

print(0 * [Link])

print([Link] == [Link])

print([Link] > [Link])

print([Link] - [Link])

print([Link] in set([[Link]]))

print(0.3 == 3 * 0.1)

```

#### 18. Create a 5x5 matrix with values 1,2,3,4 just below the diagonal (★☆☆)
```python

Z = [Link](1+[Link](4),k=-1)

print(Z)

```

#### 19. Create a 8x8 matrix and fill it with a checkerboard pattern (★☆☆)

```python

Z = [Link]((8,8),dtype=int)

Z[1::2,::2] = 1

Z[::2,1::2] = 1

print(Z)

```

#### 20. Consider a (6,7,8) shape array, what is the index (x,y,z) of the 100th element?
(★☆☆)

```python

print(np.unravel_index(99,(6,7,8)))

```

#### 21. Create a checkerboard 8x8 matrix using the tile function (★☆☆)

```python
Z = [Link]( [Link]([[0,1],[1,0]]), (4,4))

print(Z)

```

#### 22. Normalize a 5x5 random matrix (★☆☆)

```python

Z = [Link]((5,5))

Z = (Z - [Link] (Z)) / ([Link] (Z))

print(Z)

```

#### 23. Create a custom dtype that describes a color as four unsigned bytes (RGBA)
(★☆☆)

```python

color = [Link]([("r", [Link]),

("g", [Link]),

("b", [Link]),

("a", [Link])])

```

#### 24. Multiply a 5x3 matrix by a 3x2 matrix (real matrix product) (★☆☆)

```python

Z = [Link]([Link]((5, 3)), [Link]((3, 2)))

print(Z)

# Alternative solution, in Python 3.5 and above

Z = [Link]((5,3)) @ [Link]((3,2))

print(Z)

```

#### 25. Given a 1D array, negate all elements which are between 3 and 8, in place. (★☆☆)

```python

# Author: Evgeni Burovski

Z = [Link](11)

Z[(3 < Z) & (Z < 8)] *= -1

print(Z)

```

#### 26. What is the output of the following script? (★☆☆)

```python

# Author: Jake VanderPlas

print(sum(range(5),-1))

from numpy import *

print(sum(range(5),-1))

```
```python

# Author: Jake VanderPlas

print(sum(range(5),-1))

from numpy import *

print(sum(range(5),-1))

```

#### 27. Consider an integer vector Z, which of these expressions are legal? (★☆☆)

```python

Z**Z

2 << Z >> 2

Z <- Z

1j*Z

Z/1/1

Z<Z>Z

```

```python

Z**Z

2 << Z >> 2

Z <- Z

1j*Z

Z/1/1

Z<Z>Z

```
#### 28. What are the result of the following expressions? (★☆☆)

```python

[Link](0) / [Link](0)

[Link](0) // [Link](0)

[Link]([[Link]]).astype(int).astype(float)

```

```python

print([Link](0) / [Link](0))

print([Link](0) // [Link](0))

print([Link]([[Link]]).astype(int).astype(float))

```

#### 29. How to round away from zero a float array ? (★☆☆)

```python

# Author: Charles R Harris

Z = [Link](-10,+10,10)

print([Link]([Link]([Link](Z)), Z))

# More readable but less efficient

print([Link](Z>0, [Link](Z), [Link](Z)))

```

#### 30. How to find common values between two arrays? (★☆☆)
```python

Z1 = [Link](0,10,10)

Z2 = [Link](0,10,10)

print(np.intersect1d(Z1,Z2))

```

#### 31. How to ignore all numpy warnings (not recommended)? (★☆☆)

```python

# Suicide mode on

defaults = [Link](all="ignore")

Z = [Link](1) / 0

# Back to sanity

_ = [Link](**defaults)

# Equivalently with a context manager

with [Link](all="ignore"):

[Link](3) / 0

```

#### 32. Is the following expressions true? (★☆☆)

```python

[Link](-1) == [Link](-1)

```
```python

[Link](-1) == [Link](-1)

```

#### 33. How to get the dates of yesterday, today and tomorrow? (★☆☆)

```python

yesterday = np.datetime64('today') - np.timedelta64(1)

today = np.datetime64('today')

tomorrow = np.datetime64('today') + np.timedelta64(1)

```

#### 34. How to get all the dates corresponding to the month of July 2016? (★★☆)

```python

Z = [Link]('2016-07', '2016-08', dtype='datetime64[D]')

print(Z)

```

#### 35. How to compute ((A+B)*(-A/2)) in place (without copy)? (★★☆)

```python

A = [Link](3)*1

B = [Link](3)*2
[Link](A,B,out=B)

[Link](A,2,out=A)

[Link](A,out=A)

[Link](A,B,out=A)

```

#### 36. Extract the integer part of a random array of positive numbers using 4 different
methods (★★☆)

```python

Z = [Link](0,10,10)

print(Z - Z%1)

print(Z // 1)

print([Link](Z))

print([Link](int))

print([Link](Z))

```

#### 37. Create a 5x5 matrix with row values ranging from 0 to 4 (★★☆)

```python

Z = [Link]((5,5))

Z += [Link](5)

print(Z)
# without broadcasting

Z = [Link]([Link](0, 5), (5,1))

print(Z)

```

#### 38. Consider a generator function that generates 10 integers and use it to build an
array (★☆☆)

```python

def generate():

for x in range(10):

yield x

Z = [Link](generate(),dtype=float,count=-1)

print(Z)

```

#### 39. Create a vector of size 10 with values ranging from 0 to 1, both excluded (★★☆)

```python

Z = [Link](0,1,11,endpoint=False)[1:]

print(Z)

```

#### 40. Create a random vector of size 10 and sort it (★★☆)

```python
Z = [Link](10)

[Link]()

print(Z)

```

#### 41. How to sum a small array faster than [Link]? (★★☆)

```python

# Author: Evgeni Burovski

Z = [Link](10)

[Link](Z)

```

#### 42. Consider two random arrays A and B, check if they are equal (★★☆)

```python

A = [Link](0,2,5)

B = [Link](0,2,5)

# Assuming identical shape of the arrays and a tolerance for the comparison of values

equal = [Link](A,B)

print(equal)

# Checking both the shape and the element values, no tolerance (values have to be exactly
equal)
equal = np.array_equal(A,B)

print(equal)

```

#### 43. Make an array immutable (read-only) (★★☆)

```python

Z = [Link](10)

[Link] = False

Z[0] = 1

```

#### 44. Consider a random 10x2 matrix representing cartesian coordinates, convert them
to polar coordinates (★★☆)

```python

Z = [Link]((10,2))

X,Y = Z[:,0], Z[:,1]

R = [Link](X**2+Y**2)

T = np.arctan2(Y,X)

print(R)

print(T)

```

#### 45. Create random vector of size 10 and replace the maximum value by 0 (★★☆)
```python

Z = [Link](10)

Z[[Link]()] = 0

print(Z)

```

#### 46. Create a structured array with `x` and `y` coordinates covering the [0,1]x[0,1]
area (★★☆)

```python

Z = [Link]((5,5), [('x',float),('y',float)])

Z['x'], Z['y'] = [Link]([Link](0,1,5),

[Link](0,1,5))

print(Z)

```

#### 47. Given two arrays, X and Y, construct the Cauchy matrix C (Cij =1/(xi - yj)) (★★☆)

```python

# Author: Evgeni Burovski

X = [Link](8)

Y = X + 0.5

C = 1.0 / [Link](X, Y)

print([Link](C))

```
#### 48. Print the minimum and maximum representable values for each numpy scalar
type (★★☆)

```python

for dtype in [np.int8, np.int32, np.int64]:

print([Link](dtype).min)

print([Link](dtype).max)

for dtype in [np.float32, np.float64]:

print([Link](dtype).min)

print([Link](dtype).max)

print([Link](dtype).eps)

```

#### 49. How to print all the values of an array? (★★☆)

```python

np.set_printoptions(threshold=float("inf"))

Z = [Link]((40,40))

print(Z)

```

#### 50. How to find the closest value (to a given scalar) in a vector? (★★☆)

```python

Z = [Link](100)
v = [Link](0,100)

index = ([Link](Z-v)).argmin()

print(Z[index])

```

#### 51. Create a structured array representing a position (x,y) and a color (r,g,b) (★★☆)

```python

Z = [Link](10, [ ('position', [ ('x', float, 1),

('y', float, 1)]),

('color', [ ('r', float, 1),

('g', float, 1),

('b', float, 1)])])

print(Z)

```

#### 52. Consider a random vector with shape (100,2) representing coordinates, find point
by point distances (★★☆)

```python

Z = [Link]((10,2))

X,Y = np.atleast_2d(Z[:,0], Z[:,1])

D = [Link]( (X-X.T)**2 + (Y-Y.T)**2)

print(D)

# Much faster with scipy

import scipy

# Thanks Gavin Heverly-Coulson (#issue 1)

import [Link]

Z = [Link]((10,2))

D = [Link](Z,Z)

print(D)

```

#### 53. How to convert a float (32 bits) array into an integer (32 bits) array in place?

```python

# Thanks Vikas ([Link]

# & unutbu ([Link]

Z = ([Link](10)*100).astype(np.float32)

Y = [Link](np.int32)

Y[:] = Z

print(Y)

```

#### 54. How to read the following file? (★★☆)

```

1, 2, 3, 4, 5

6, , , 7, 8

, , 9,10,11

```
```python

from io import StringIO

# Fake file

s = StringIO('''1, 2, 3, 4, 5

6, , , 7, 8

, , 9,10,11

''')

Z = [Link](s, delimiter=",", dtype=[Link])

print(Z)

```

#### 55. What is the equivalent of enumerate for numpy arrays? (★★☆)

```python

Z = [Link](9).reshape(3,3)

for index, value in [Link](Z):

print(index, value)

for index in [Link]([Link]):

print(index, Z[index])

```

#### 56. Generate a generic 2D Gaussian-like array (★★☆)

```python

X, Y = [Link]([Link](-1,1,10), [Link](-1,1,10))

D = [Link](X*X+Y*Y)

sigma, mu = 1.0, 0.0

G = [Link](-( (D-mu)**2 / ( 2.0 * sigma**2 ) ) )

print(G)

```

#### 57. How to randomly place p elements in a 2D array? (★★☆)

```python

# Author: Divakar

n = 10

p=3

Z = [Link]((n,n))

[Link](Z, [Link](range(n*n), p, replace=False),1)

print(Z)

```

#### 58. Subtract the mean of each row of a matrix (★★☆)

```python

# Author: Warren Weckesser

X = [Link](5, 10)

# Recent versions of numpy

Y = X - [Link](axis=1, keepdims=True)

# Older versions of numpy

Y = X - [Link](axis=1).reshape(-1, 1)

print(Y)

```

#### 59. How to sort an array by the nth column? (★★☆)

```python

# Author: Steve Tjoa

Z = [Link](0,10,(3,3))

print(Z)

print(Z[Z[:,1].argsort()])

```

#### 60. How to tell if a given 2D array has null columns? (★★☆)

```python

# Author: Warren Weckesser

# null : 0

Z = [Link](0,3,(3,10))

print((~[Link](axis=0)).any())

# null : [Link]

Z=[Link]([

[0,1,[Link]],

[1,2,[Link]],

[4,5,[Link]]

])

print([Link](Z).all(axis=0))

```

#### 61. Find the nearest value from a given value in an array (★★☆)

```python

Z = [Link](0,1,10)

z = 0.5

m = [Link][[Link](Z - z).argmin()]

print(m)

```

#### 62. Considering two arrays with shape (1,3) and (3,1), how to compute their sum
using an iterator? (★★☆)

```python
A = [Link](3).reshape(3,1)

B = [Link](3).reshape(1,3)

it = [Link]([A,B,None])

for x,y,z in it: z[...] = x + y

print([Link][2])

```

#### 63. Create an array class that has a name attribute (★★☆)

```python

class NamedArray([Link]):

def __new__(cls, array, name="no name"):

obj = [Link](array).view(cls)

[Link] = name

return obj

def __array_finalize__(self, obj):

if obj is None: return

[Link] = getattr(obj, 'name', "no name")

Z = NamedArray([Link](10), "range_10")

print ([Link])

```

#### 64. Consider a given vector, how to add 1 to each element indexed by a second vector
(be careful with repeated indices)? (★★★)
```python

# Author: Brett Olsen

Z = [Link](10)

I = [Link](0,len(Z),20)

Z += [Link](I, minlength=len(Z))

print(Z)

# Another solution

# Author: Bartosz Telenczuk

[Link](Z, I, 1)

print(Z)

```

#### 65. How to accumulate elements of a vector (X) to an array (F) based on an index list
(I)? (★★★)

```python

# Author: Alan G Isaac

X = [1,2,3,4,5,6]

I = [1,3,9,3,4,1]

F = [Link](I,X)

print(F)

```
#### 66. Considering a (w,h,3) image of (dtype=ubyte), compute the number of unique
colors (★★☆)

```python

# Author: Fisher Wang

w, h = 256, 256

I = [Link](0, 4, (h, w, 3)).astype([Link])

colors = [Link]([Link](-1, 3), axis=0)

n = len(colors)

print(n)

# Faster version

# Author: Mark Setchell

# [Link]

w, h = 256, 256

I = [Link](0,4,(h,w,3), dtype=np.uint8)

# View each pixel as a single 24-bit integer, rather than three 8-bit bytes

I24 = [Link]([Link](np.uint32),[1,256,65536])

# Count unique colours

n = len([Link](I24))

print(n)
```

#### 67. Considering a four dimensions array, how to get sum over the last two axis at
once? (★★★)

```python

A = [Link](0,10,(3,4,3,4))

# solution by passing a tuple of axes (introduced in numpy 1.7.0)

sum = [Link](axis=(-2,-1))

print(sum)

# solution by flattening the last two dimensions into one

# (useful for functions that don't accept tuples for axis argument)

sum = [Link]([Link][:-2] + (-1,)).sum(axis=-1)

print(sum)

```

#### 68. Considering a one-dimensional vector D, how to compute means of subsets of D

using a vector S of same size describing subset indices? (★★★)

```python

# Author: Jaime Fernández del Río

D = [Link](0,1,100)

S = [Link](0,10,100)

D_sums = [Link](S, weights=D)

D_counts = [Link](S)
D_means = D_sums / D_counts

print(D_means)

# Pandas solution as a reference due to more intuitive code

import pandas as pd

print([Link](D).groupby(S).mean())

```

#### 69. How to get the diagonal of a dot product? (★★★)

```python

# Author: Mathieu Blondel

A = [Link](0,1,(5,5))

B = [Link](0,1,(5,5))

# Slow version

[Link]([Link](A, B))

# Fast version

[Link](A * B.T, axis=1)

# Faster version

[Link]("ij,ji->i", A, B)

```
#### 70. Consider the vector [1, 2, 3, 4, 5], how to build a new vector with 3 consecutive
zeros interleaved between each value? (★★★)

```python

# Author: Warren Weckesser

Z = [Link]([1,2,3,4,5])

nz = 3

Z0 = [Link](len(Z) + (len(Z)-1)*(nz))

Z0[::nz+1] = Z

print(Z0)

```

#### 71. Consider an array of dimension (5,5,3), how to multiply it by an array with
dimensions (5,5)? (★★★)

```python

A = [Link]((5,5,3))

B = 2*[Link]((5,5))

print(A * B[:,:,None])

```

#### 72. How to swap two rows of an array? (★★★)

```python
# Author: Eelco Hoogendoorn

A = [Link](25).reshape(5,5)

A[[0,1]] = A[[1,0]]

print(A)

```

#### 73. Consider a set of 10 triplets describing 10 triangles (with shared vertices), find the
set of unique line segments composing all the triangles (★★★)

```python

# Author: Nicolas P. Rougier

faces = [Link](0,100,(10,3))

F = [Link]([Link](2,axis=1),-1,axis=1)

F = [Link](len(F)*3,2)

F = [Link](F,axis=1)

G = [Link]( dtype=[('p0',[Link]),('p1',[Link])] )

G = [Link](G)

print(G)

```

#### 74. Given a sorted array C that corresponds to a bincount, how to produce an array A
such that [Link](A) == C? (★★★)

```python
# Author: Jaime Fernández del Río

C = [Link]([1,1,2,3,4,4,6])

A = [Link]([Link](len(C)), C)

print(A)

```

#### 75. How to compute averages using a sliding window over an array? (★★★)

```python

# Author: Jaime Fernández del Río

def moving_average(a, n=3) :

ret = [Link](a, dtype=float)

ret[n:] = ret[n:] - ret[:-n]

return ret[n - 1:] / n

Z = [Link](20)

print(moving_average(Z, n=3))

# Author: Jeff Luo (@Jeff1999)

# make sure your NumPy >= 1.20.0

from [Link].stride_tricks import sliding_window_view

Z = [Link](20)

print(sliding_window_view(Z, window_shape=3).mean(axis=-1))
```

#### 76. Consider a one-dimensional array Z, build a two-dimensional array whose first
row is (Z[0],Z[1],Z[2]) and each subsequent row is shifted by 1 (last row should be (Z[-3],Z[-
2],Z[-1]) (★★★)

```python

# Author: Joe Kington / Erik Rigtorp

from [Link] import stride_tricks

def rolling(a, window):

shape = ([Link] - window + 1, window)

strides = ([Link][0], [Link][0])

return stride_tricks.as_strided(a, shape=shape, strides=strides)

Z = rolling([Link](10), 3)

print(Z)

# Author: Jeff Luo (@Jeff1999)

Z = [Link](10)

print(sliding_window_view(Z, window_shape=3))

```

#### 77. How to negate a boolean, or to change the sign of a float inplace? (★★★)

```python
# Author: Nathaniel J. Smith

Z = [Link](0,2,100)

np.logical_not(Z, out=Z)

Z = [Link](-1.0,1.0,100)

[Link](Z, out=Z)

```

#### 78. Consider 2 sets of points P0,P1 describing lines (2d) and a point p, how to
compute distance from p to each line i (P0[i],P1[i])? (★★★)

```python

P0 = [Link](-10,10,(10,2))

P1 = [Link](-10,10,(10,2))

p = [Link](-10,10,( 1,2))

def distance_faster(P0,P1,p):

#Author: Hemanth Pasupuleti

#Reference: [Link]

v = P1- P0

v[:,[0,1]] = v[:,[1,0]]

v[:,1]*=-1

norm = [Link](v,axis=1)

r = P0 - p
 d = [Link]([Link]("ij,ij->i",r,v)) / norm

return d

print(distance_faster(P0, P1, p))

##--------------- OR ---------------##

def distance_slower(P0, P1, p):

T = P1 - P0

L = (T**2).sum(axis=1)

U = -((P0[:,0]-p[...,0])*T[:,0] + (P0[:,1]-p[...,1])*T[:,1]) / L

U = [Link](len(U),1)

D = P0 + U*T - p

return [Link]((D**2).sum(axis=1))

print(distance_slower(P0, P1, p))

```

#### 79. Consider 2 sets of points P0,P1 describing lines (2d) and a set of points P, how to
compute distance from each point j (P[j]) to each line i (P0[i],P1[i])? (★★★)

```python

# Author: Italmassov Kuanysh

# based on distance function from previous question

P0 = [Link](-10, 10, (10,2))

P1 = [Link](-10,10,(10,2))

p = [Link](-10, 10, (10,2))

print([Link]([distance(P0,P1,p_i) for p_i in p]))

# Author: Yang Wu (Broadcasting)

def distance_points_to_lines(p: [Link], p_1: [Link], p_2: [Link]) -> [Link]:

x_0, y_0 = p.T # Shape -> (n points, )

x_1, y_1 = p_1.T # Shape -> (n lines, )

x_2, y_2 = p_2.T # Shape -> (n lines, )

# Displacement vector coordinates from p_1 -> p_2

dx = x_2 - x_1 # Shape -> (n lines, )

dy = y_2 - y_1 # Shape -> (n lines, )

# The 'cross product' term

cross_term = x_2 * y_1 - y_2 * x_1 # Shape -> (n lines, )

# Broadcast x_0, y_0 (n points, 1) and dx, dy, cross_term (1, n lines) -> (n points, n lines)

numerator = [Link](

dy[[Link], :] * x_0[:, [Link]]

- dx[[Link], :] * y_0[:, [Link]]

+ cross_term[[Link], :]

denominator = [Link](dx**2 + dy**2) # Shape -> (n lines, )

# Shape (n points, n lines) / (1, n_lines) -> (n points, n lines)

 return numerator / denominator[[Link], :]

distance_points_to_lines(p, P0, P1)

```

#### 80. Consider an arbitrary array, write a function that extracts a subpart with a fixed
shape and centered on a given element (pad with a `fill` value when necessary) (★★★)

```python

# Author: Nicolas Rougier

Z = [Link](0,10,(10,10))

shape = (5,5)

fill = 0

position = (1,1)

R = [Link](shape, dtype=[Link])*fill

P = [Link](list(position)).astype(int)

Rs = [Link](list([Link])).astype(int)

Zs = [Link](list([Link])).astype(int)

R_start = [Link]((len(shape),)).astype(int)

R_stop = [Link](list(shape)).astype(int)

Z_start = (P-Rs//2)

Z_stop = (P+Rs//2)+Rs%2
R_start = (R_start - [Link](Z_start,0)).tolist()

Z_start = ([Link](Z_start,0)).tolist()

R_stop = [Link](R_start, (R_stop - [Link](Z_stop-Zs,0))).tolist()

Z_stop = ([Link](Z_stop,Zs)).tolist()

r = tuple([slice(start,stop) for start,stop in zip(R_start,R_stop)])

z = tuple([slice(start,stop) for start,stop in zip(Z_start,Z_stop)])

R[r] = Z[z]

print(Z)

print(R)

```

#### 81. Consider an array Z = [1,2,3,4,5,6,7,8,9,10,11,12,13,14], how to generate an array

R = [[1,2,3,4], [2,3,4,5], [3,4,5,6], ..., [11,12,13,14]]? (★★★)

```python

# Author: Stefan van der Walt

Z = [Link](1,15,dtype=np.uint32)

R = stride_tricks.as_strided(Z,(11,4),(4,4))

print(R)

# Author: Jeff Luo (@Jeff1999)

Z = [Link](1, 15, dtype=np.uint32)

print(sliding_window_view(Z, window_shape=4))
```

#### 82. Compute a matrix rank (★★★)

```python

# Author: Stefan van der Walt

Z = [Link](0,1,(10,10))

U, S, V = [Link](Z) # Singular Value Decomposition

rank = [Link](S > 1e-10)

print(rank)

# alternative solution:

# Author: Jeff Luo (@Jeff1999)

rank = [Link].matrix_rank(Z)

print(rank)

```

#### 83. How to find the most frequent value in an array?

```python

Z = [Link](0,10,50)

print([Link](Z).argmax())

```

#### 84. Extract all the contiguous 3x3 blocks from a random 10x10 matrix (★★★)
```python

# Author: Chris Barker

Z = [Link](0,5,(10,10))

n=3

i = 1 + ([Link][0]-3)

j = 1 + ([Link][1]-3)

C = stride_tricks.as_strided(Z, shape=(i, j, n, n), strides=[Link] + [Link])

print(C)

# Author: Jeff Luo (@Jeff1999)

Z = [Link](0,5,(10,10))

print(sliding_window_view(Z, window_shape=(3, 3)))

```

#### 85. Create a 2D array subclass such that Z[i,j] == Z[j,i] (★★★)

```python

# Author: Eric O. Lebigot

# Note: only works for 2d array and value setting using indices

class Symetric([Link]):

def __setitem__(self, index, value):

 i,j = index

super(Symetric, self).__setitem__((i,j), value)

super(Symetric, self).__setitem__((j,i), value)

def symetric(Z):

return [Link](Z + Z.T - [Link]([Link]())).view(Symetric)

S = symetric([Link](0,10,(5,5)))

S[2,3] = 42

print(S)

```

#### 86. Consider a set of p matrices with shape (n,n) and a set of p vectors with shape
(n,1). How to compute the sum of of the p matrix products at once? (result has shape (n,1))
(★★★)

```python

# Author: Stefan van der Walt

p, n = 10, 20

M = [Link]((p,n,n))

V = [Link]((p,n,1))

S = [Link](M, V, axes=[[0, 2], [0, 1]])

print(S)

# It works, because:
# M is (p,n,n)

# V is (p,n,1)

# Thus, summing over the paired axes 0 and 0 (of M and V independently),

# and 2 and 1, to remain with a (n,1) vector.

```

#### 87. Consider a 16x16 array, how to get the block-sum (block size is 4x4)? (★★★)

```python

# Author: Robert Kern

Z = [Link]((16,16))

k=4

S = [Link]([Link](Z, [Link](0, [Link][0], k), axis=0),

[Link](0, [Link][1], k), axis=1)

print(S)

# alternative solution:

# Author: Sebastian Wallkötter (@FirefoxMetzger)

Z = [Link]((16,16))

k=4

windows = [Link].stride_tricks.sliding_window_view(Z, (k, k))

S = windows[::k, ::k, ...].sum(axis=(-2, -1))

# Author: Jeff Luo (@Jeff1999)

Z = [Link]((16, 16))

k=4

print(sliding_window_view(Z, window_shape=(k, k))[::k, ::k].sum(axis=(-2, -1)))

```

#### 88. How to implement the Game of Life using numpy arrays? (★★★)

```python

# Author: Nicolas Rougier

def iterate(Z):

# Count neighbours

N = (Z[0:-2,0:-2] + Z[0:-2,1:-1] + Z[0:-2,2:] +

Z[1:-1,0:-2] + Z[1:-1,2:] +

Z[2: ,0:-2] + Z[2: ,1:-1] + Z[2: ,2:])

# Apply rules

birth = (N==3) & (Z[1:-1,1:-1]==0)

survive = ((N==2) | (N==3)) & (Z[1:-1,1:-1]==1)

Z[...] = 0

Z[1:-1,1:-1][birth | survive] = 1

return Z

Z = [Link](0,2,(50,50))
for i in range(100): Z = iterate(Z)

print(Z)

```

#### 89. How to get the n largest values of an array (★★★)

```python

Z = [Link](10000)

[Link](Z)

n=5

# Slow

print (Z[[Link](Z)[-n:]])

# Fast

print (Z[[Link](-Z,n)[:n]])

```

#### 90. Given an arbitrary number of vectors, build the cartesian product (every
combination of every item) (★★★)

```python

# Author: Stefan Van der Walt

def cartesian(arrays):

arrays = [[Link](a) for a in arrays]

 shape = (len(x) for x in arrays)

ix = [Link](shape, dtype=int)

ix = [Link](len(arrays), -1).T

for n, arr in enumerate(arrays):

ix[:, n] = arrays[n][ix[:, n]]

return ix

print (cartesian(([1, 2, 3], [4, 5], [6, 7])))

```

#### 91. How to create a record array from a regular array? (★★★)

```python

Z = [Link]([("Hello", 2.5, 3),

("World", 3.6, 2)])

R = [Link](Z.T,

names='col1, col2, col3',

formats = 'S8, f8, i8')

print(R)

```

#### 92. Consider a large vector Z, compute Z to the power of 3 using 3 different methods
(★★★)
```python

# Author: Ryan G.

x = [Link](int(5e7))

%timeit [Link](x,3)

%timeit x*x*x

%timeit [Link]('i,i,i->i',x,x,x)

```

#### 93. Consider two arrays A and B of shape (8,3) and (2,2). How to find rows of A that
contain elements of each row of B regardless of the order of the elements in B? (★★★)

```python

# Author: Gabe Schwartz

A = [Link](0,5,(8,3))

B = [Link](0,5,(2,2))

C = (A[..., [Link], [Link]] == B)

rows = [Link]([Link]((3,1)).all(1))[0]

print(rows)

```

#### 94. Considering a 10x3 matrix, extract rows with unequal values (e.g. [2,2,3]) (★★★)
```python

# Author: Robert Kern

Z = [Link](0,5,(10,3))

print(Z)

# solution for arrays of all dtypes (including string arrays and record arrays)

E = [Link](Z[:,1:] == Z[:,:-1], axis=1)

U = Z[~E]

print(U)

# soluiton for numerical arrays only, will work for any number of columns in Z

U = Z[[Link](axis=1) != [Link](axis=1),:]

print(U)

```

#### 95. Convert a vector of ints into a matrix binary representation (★★★)

```python

# Author: Warren Weckesser

I = [Link]([0, 1, 2, 3, 15, 16, 32, 64, 128])

B = (([Link](-1,1) & (2**[Link](8))) != 0).astype(int)

print(B[:,::-1])

# Author: Daniel T. McDonald

I = [Link]([0, 1, 2, 3, 15, 16, 32, 64, 128], dtype=np.uint8)

print([Link](I[:, [Link]], axis=1))

```

#### 96. Given a two dimensional array, how to extract unique rows? (★★★)

```python

# Author: Jaime Fernández del Río

Z = [Link](0,2,(6,3))

T = [Link](Z).view([Link](([Link], [Link] * [Link][1])))

_, idx = [Link](T, return_index=True)

uZ = Z[idx]

print(uZ)

# Author: Andreas Kouzelis

# NumPy >= 1.13

uZ = [Link](Z, axis=0)

print(uZ)

```

#### 97. Considering 2 vectors A & B, write the einsum equivalent of inner, outer, sum, and
mul function (★★★)

```python

# Author: Alex Riley

# Make sure to read: [Link]

A = [Link](0,1,10)

B = [Link](0,1,10)

[Link]('i->', A) # [Link](A)

[Link]('i,i->i', A, B) # A * B

[Link]('i,i', A, B) # [Link](A, B)

[Link]('i,j->ij', A, B) # [Link](A, B)

```

#### 98. Considering a path described by two vectors (X,Y), how to sample it using
equidistant samples (★★★)?

```python

# Author: Bas Swinckels

phi = [Link](0, 10*[Link], 0.1)

a=1

x = a*phi*[Link](phi)

y = a*phi*[Link](phi)

dr = ([Link](x)**2 + [Link](y)**2)**.5 # segment lengths

r = np.zeros_like(x)

r[1:] = [Link](dr) # integrate path

r_int = [Link](0, [Link](), 200) # regular spaced path

x_int = [Link](r_int, r, x) # integrate path

y_int = [Link](r_int, r, y)

```

#### 99. Given an integer n and a 2D array X, select from X the rows which can be
interpreted as draws from a multinomial distribution with n degrees, i.e., the rows which
only contain integers and which sum to n. (★★★)

```python

# Author: Evgeni Burovski

X = [Link]([[1.0, 0.0, 3.0, 8.0],

[2.0, 0.0, 1.0, 1.0],

[1.5, 2.5, 1.0, 0.0]])

n=4

M = np.logical_and.reduce([Link](X, 1) == 0, axis=-1)

M &= ([Link](axis=-1) == n)

print(X[M])

```

#### 100. Compute bootstrapped 95% confidence intervals for the mean of a 1D array X
(i.e., resample the elements of an array with replacement N times, compute the mean of
each sample, and then compute percentiles over the means). (★★★)

```python

# Author: Jessica B. Hamrick

X = [Link](100) # random 1D array

N = 1000 # number of bootstrap samples

idx = [Link](0, [Link], (N, [Link]))

means = X[idx].mean(axis=1)

confint = [Link](means, [2.5, 97.5])

print(confint)

```