Convert an array to an object supporting fancy indexing.

"Number of Matching Subsequences" LeetCode Problem Solution

Convert a multidimensional subsequence string to a MultiSlice object.

Normalize a Slice object.

Convert an ndarray to an object supporting fancy indexing.

Parse a string-serialized MultiSlice object.

Create a MultiSlice object from a comma-separated list of string-serialized MultiSlice constructor arguments.

Assign element values from a broadcasted input array to corresponding elements in an output array.

Convert a subsequence string to a Slice object.

Create a MultiSlice object from a list of MultiSlice constructor arguments.

Return a list of non-reduced dimensions in an un-normalized multi-slice.

Parse a string-serialized Slice object.

Normalize a MultiSlice object.

Create an iterator which replaces all values from a provided iterator from a start index to an end index with a static value.

Return a shallow copy of a portion of an array.

Convert a subsequence string to a Slice object.

Create an iterator which returns a subsequence of iterated values from a provided iterator.

Compute the number of elements in a normalized slice.

Return a list of reduced dimensions in an un-normalized multi-slice.

Convert a Slice object to a subsequence string.