← All sections

NumPy

0 / 170 solved · Easy 59 · Medium 63 · Hard 48

#TitleDifficulty
1○Import NumPyEasy
2○NumPy VersionEasy
3○Null Vector of Size 10Easy
4○Memory Size of an ArrayEasy
5○Documentation of np.addEasy
6○Null Vector, Fifth Value 1Easy
7○Range Vector 10–49Easy
8○Reverse a VectorEasy
9○3×3 Matrix 0–8Easy
10○Indices of Non-Zero ElementsEasy
11○Identity MatrixEasy
12○3×3×3 Random ArrayEasy
13○Min and MaxEasy
14○Mean ValueEasy
15○1 on Border, 0 InsideEasy
16○Add a Zero BorderEasy
17○NaN Expression ResultsEasy
18○Values Below the DiagonalEasy
19○Checkerboard PatternEasy
20○Unravel 100th IndexEasy
21○Checkerboard with tile()Easy
22○Normalize a MatrixEasy
23○RGBA dtype SizeEasy
24○Matrix ProductEasy
25○Negate Elements 3–8Easy
26○Builtin sum vs np.sumEasy
27○Which Expressions Are Legal?Easy
28○Results of Edge ExpressionsEasy
29○Round Away From ZeroEasy
30○Common ValuesEasy
31○Ignore NumPy WarningsEasy
32○sqrt(-1) vs emath.sqrt(-1)Easy
33○Yesterday and TomorrowEasy
34○Dates in July 2016Medium
35○Compute ((A+B)*(-A/2))Medium
36○Integer PartMedium
37○Premium problem, upgrade to unlockRows Ranging 0–4Medium
38○Premium problem, upgrade to unlockBuild Array from GeneratorEasy
39○Premium problem, upgrade to unlockVector 0–1 Both ExcludedMedium
40○Premium problem, upgrade to unlockSort a VectorMedium
41○Premium problem, upgrade to unlockSum with add.reduceMedium
42○Premium problem, upgrade to unlockAre Two Arrays Equal?Medium
43○Premium problem, upgrade to unlockMake an Array Read-OnlyMedium
44○Premium problem, upgrade to unlockCartesian to PolarMedium
45○Premium problem, upgrade to unlockReplace Max with 0Medium
46○Premium problem, upgrade to unlockCoordinate GridMedium
47○Premium problem, upgrade to unlockCauchy Matrix DeterminantMedium
48○Premium problem, upgrade to unlockMin/Max of int8Medium
49○Premium problem, upgrade to unlockFull Array as StringMedium
50○Premium problem, upgrade to unlockClosest Value to a ScalarMedium
51○Premium problem, upgrade to unlockPosition + Color StructMedium
52○Premium problem, upgrade to unlockPoint-by-Point DistancesMedium
53○Premium problem, upgrade to unlockFloat32 to Int32 In PlaceMedium
54○Premium problem, upgrade to unlockParse a Messy CSVMedium
55○Premium problem, upgrade to unlockEnumerate a 2D ArrayMedium
56○Premium problem, upgrade to unlock2D Gaussian ArrayMedium
57○Premium problem, upgrade to unlockPlace p Elements RandomlyMedium
58○Premium problem, upgrade to unlockSubtract Row MeansMedium
59○Premium problem, upgrade to unlockSort by nth ColumnMedium
60○Premium problem, upgrade to unlockHas Null Columns?Medium
61○Premium problem, upgrade to unlockNearest ValueMedium
62○Premium problem, upgrade to unlockSum via IteratorMedium
63○Premium problem, upgrade to unlockArray with a NameMedium
64○Premium problem, upgrade to unlockAdd 1 at Indexed PositionsHard
65○Premium problem, upgrade to unlockAccumulate by Index ListHard
66○Premium problem, upgrade to unlockCount Unique ColorsMedium
67○Premium problem, upgrade to unlockSum Over Last Two AxesHard
68○Premium problem, upgrade to unlockMeans of SubsetsHard
69○Premium problem, upgrade to unlockDiagonal of a Dot ProductHard
70○Premium problem, upgrade to unlockInterleave 3 ZerosHard
71○Premium problem, upgrade to unlockMultiply (5,5,3) by (5,5)Hard
72○Premium problem, upgrade to unlockSwap Two RowsHard
73○Premium problem, upgrade to unlockUnique Triangle SegmentsHard
74○Premium problem, upgrade to unlockInvert a bincountHard
75○Premium problem, upgrade to unlockSliding Window AverageHard
76○Premium problem, upgrade to unlockRolling Windows (shift by 1)Hard
77○Premium problem, upgrade to unlockNegate Float Array In PlaceHard
78○Premium problem, upgrade to unlockDistance Point to LinesHard
79○Premium problem, upgrade to unlockDistance Points to LinesHard
80○Premium problem, upgrade to unlockCentered Subpart with FillHard
81○Premium problem, upgrade to unlockGenerate Shifted RowsHard
82○Premium problem, upgrade to unlockMatrix RankHard
83○Premium problem, upgrade to unlockMost Frequent ValueMedium
84○Premium problem, upgrade to unlockAll Contiguous 3×3 BlocksHard
85○Premium problem, upgrade to unlockMake a Matrix SymmetricHard
86○Premium problem, upgrade to unlockSum of p Matrix ProductsHard
87○Premium problem, upgrade to unlockBlock-Sum (4×4 blocks)Hard
88○Premium problem, upgrade to unlockGame of Life StepHard
89○Premium problem, upgrade to unlockn Largest ValuesHard
90○Premium problem, upgrade to unlockCartesian ProductHard
91○Premium problem, upgrade to unlockRecord Array from ArrayHard
92○Premium problem, upgrade to unlockCube Each ElementHard
93○Premium problem, upgrade to unlockRows Containing Each Row of BHard
94○Premium problem, upgrade to unlockRows with Unequal ValuesHard
95○Premium problem, upgrade to unlockInts to Binary MatrixHard
96○Premium problem, upgrade to unlockExtract Unique RowsHard
97○Premium problem, upgrade to unlockOuter Product with einsumHard
98○Premium problem, upgrade to unlockEquidistant Path SamplingHard
99○Premium problem, upgrade to unlockMultinomial RowsHard
100○Premium problem, upgrade to unlockBootstrap Confidence IntervalHard
101○Premium problem, upgrade to unlockFull Array Like a PrototypeEasy
102○Premium problem, upgrade to unlockReproducible Random Integers (Generator API)Easy
103○Premium problem, upgrade to unlockBinomial Draws (Generator API)Medium
104○Premium problem, upgrade to unlockSave and Load a .npy ArrayEasy
105○Premium problem, upgrade to unlockSave Multiple Named Arrays with savezMedium
106○Premium problem, upgrade to unlockSelective CSV ImportMedium
107○Premium problem, upgrade to unlockImpute Missing Values with the Column MeanMedium
108○Premium problem, upgrade to unlockDelete Rows and ColumnsEasy
109○Premium problem, upgrade to unlockSort Rows by a Given ColumnEasy
110○Premium problem, upgrade to unlockLocate Elements Matching a ConditionEasy
111○Premium problem, upgrade to unlockStack Two Vectors as RowsEasy
112○Premium problem, upgrade to unlockConcatenate Two Vectors End-to-EndEasy
113○Premium problem, upgrade to unlockStack Two Matrices Along a New AxisMedium
114○Premium problem, upgrade to unlockCount Occurrences of Each Unique ValueEasy
115○Premium problem, upgrade to unlockIndex of First Occurrence of Each Unique ValueEasy
116○Premium problem, upgrade to unlockWeighted AverageEasy
117○Premium problem, upgrade to unlockCorrelation Matrix Between RowsMedium
118○Premium problem, upgrade to unlockHistogram Bin CountsEasy
119○Premium problem, upgrade to unlockPeak-to-Peak Range per RowEasy
120○Premium problem, upgrade to unlockStrip Prefixes and Map Categories to CodesMedium
121○Premium problem, upgrade to unlockRow-wise Stable SoftmaxEasy
122○Premium problem, upgrade to unlockOne-Hot Encode an Index ArrayEasy
123○Premium problem, upgrade to unlockDense Layer Forward with Leaky ReLUEasy
124○Premium problem, upgrade to unlockPadding Mask from Sequence LengthsEasy
125○Premium problem, upgrade to unlockLayer Normalization ForwardEasy
126○Premium problem, upgrade to unlockTop-k AccuracyEasy
127○Premium problem, upgrade to unlockCross-Entropy Loss Straight from LogitsMedium
128○Premium problem, upgrade to unlockBatch Norm Forward with Running StatsMedium
129○Premium problem, upgrade to unlockOne Lloyd Step of k-MeansMedium
130○Premium problem, upgrade to unlockkNN Predict with a Deterministic Tie-BreakMedium
131○Premium problem, upgrade to unlockConfusion Matrix and Macro F1Medium
132○Premium problem, upgrade to unlockPairwise IoU Matrix Between Box SetsMedium
133○Premium problem, upgrade to unlockLogistic Loss and Gradient, VectorizedMedium
134○Premium problem, upgrade to unlockRidge Regression in Closed FormMedium
135○Premium problem, upgrade to unlockMax-Pool Forward with StrideMedium
136○Premium problem, upgrade to unlockGradient of Softmax Cross-EntropyHard
137○Premium problem, upgrade to unlockBackprop Gradients for a Two-Layer MLPHard
138○Premium problem, upgrade to unlockScaled Dot-Product Attention, CausalHard
139○Premium problem, upgrade to unlockGreedy Non-Maximum SuppressionHard
140○Premium problem, upgrade to unlockROC AUC by Rank Statistic, with TiesHard
141○Premium problem, upgrade to unlockCoalesce Two Rating ColumnsEasy
142○Premium problem, upgrade to unlockDrop Rows Containing Any Missing ValueEasy
143○Premium problem, upgrade to unlockWinsorize at Given PercentilesEasy
144○Premium problem, upgrade to unlockMonth-over-Month Growth RateEasy
145○Premium problem, upgrade to unlockAverage Order Value per CustomerMedium
146○Premium problem, upgrade to unlockPercentile Rank Each ValueMedium
147○Premium problem, upgrade to unlockNumber the Rows Within Each GroupMedium
148○Premium problem, upgrade to unlockForward-Fill Missing ValuesMedium
149○Premium problem, upgrade to unlockConvert Amounts via a Rate LookupMedium
150○Premium problem, upgrade to unlockStandardize Each Column SafelyMedium
151○Premium problem, upgrade to unlockTop-N Rows per CategoryHard
152○Premium problem, upgrade to unlockLongest Streak of Consecutive Active DaysHard
153○Premium problem, upgrade to unlockClassify Each Indexing Form as View or CopyMedium
154○Premium problem, upgrade to unlockFind the Unit-Stride AxisMedium
155○Premium problem, upgrade to unlockResolve a Broadcast Shape by HandMedium
156○Premium problem, upgrade to unlockWhich Reductions Silently Change dtypeMedium
157○Premium problem, upgrade to unlockmay_share_memory vs shares_memoryMedium
158○Premium problem, upgrade to unlockPredict Result dtypes Under NEP 50Hard
159○Premium problem, upgrade to unlockIn-Place vs Out-of-Place Mixed dtypesHard
160○Premium problem, upgrade to unlockBuild a Broadcast View With a Zero StrideHard
161○Premium problem, upgrade to unlockThe reduceat Non-Monotonic TrapHard
162○Premium problem, upgrade to unlockLog Returns from a Price SeriesEasy
163○Premium problem, upgrade to unlockInterpolate a Curve with Flat ExtrapolationEasy
164○Premium problem, upgrade to unlockMaximum Drawdown with Peak and TroughMedium
165○Premium problem, upgrade to unlockRolling Z-Score Over a Trailing WindowMedium
166○Premium problem, upgrade to unlockRiskMetrics EWMA VolatilityMedium
167○Premium problem, upgrade to unlockOLS Beta and R-Squared via Least SquaresMedium
168○Premium problem, upgrade to unlockGlobal Minimum-Variance Portfolio WeightsMedium
169○Premium problem, upgrade to unlockAttach the Prevailing Quote to Each TradeHard
170○Premium problem, upgrade to unlockMonte Carlo Call with Antithetic VariatesHard