Cody

Augusto Mazzei submitted Solution 1943522 to Problem 42938. Project Euler: Problem 18, Maximum path sum I

7 hours and 14 minutes ago

Augusto Mazzei submitted Solution 1943407 to Problem 2337. Sum of big primes without primes

10 hours and 36 minutes ago

Augusto Mazzei submitted Solution 1943406 to Problem 2337. Sum of big primes without primes

Augusto Mazzei received Community Group Solver badge for Basics on Cell Arrays

10 hours and 48 minutes ago

Augusto Mazzei submitted Solution 1943399 to Problem 43677. String Array Basics, Part 1: Convert Cell Array to String Array; No Missing Values

Augusto Mazzei submitted Solution 1943397 to Problem 2300. Natural numbers in string form

10 hours and 53 minutes ago

Augusto Mazzei submitted Solution 1943396 to Problem 1755. Fix the last element of a cell array

10 hours and 54 minutes ago

Augusto Mazzei submitted Solution 1943389 to Problem 1971. Remove element(s) from cell array

11 hours and 1 minute ago

Augusto Mazzei submitted Solution 1943384 to Problem 1899. Convert a Cell Array into an Array

11 hours and 5 minutes ago

Augusto Mazzei submitted Solution 1943380 to Problem 44060. Volume Pillar

11 hours and 9 minutes ago

Augusto Mazzei submitted Solution 1943379 to Problem 44273. Given a square and a circle, please decide whether the square covers more area.

11 hours and 11 minutes ago

Augusto Mazzei submitted Solution 1943374 to Problem 44660. Perimeter of a semicircle

11 hours and 14 minutes ago

Augusto Mazzei submitted Solution 1943322 to Problem 953. Pi Estimate 1

11 hours and 50 minutes ago

Augusto Mazzei submitted Solution 1943295 to Problem 43298. Calculate area of sector

12 hours and 4 minutes ago

Augusto Mazzei submitted Solution 1943249 to Problem 795. Joining Ranges

12 hours and 39 minutes ago

Augusto Mazzei submitted Solution 1943237 to Problem 801. Construct an index vector from two input vectors in vectorized fashion

12 hours and 48 minutes ago

Augusto Mazzei submitted Solution 1943209 to Problem 652. Put two time series onto the same time basis

13 hours and 5 minutes ago

Augusto Mazzei submitted Solution 1943200 to Problem 970. Piecewise linear interpolation

13 hours and 22 minutes ago

Augusto Mazzei submitted Solution 1943193 to Problem 672. Longest run of consecutive numbers

13 hours and 36 minutes ago

Augusto Mazzei submitted a Comment to Solution 53910

15 hours and 13 minutes ago

Augusto Mazzei submitted Solution 1943137 to Problem 415. Sum the Infinite Series

15 hours and 22 minutes ago

Augusto Mazzei received Sequences & Series I Master badge

Augusto Mazzei received Indexing V Master badge

16 hours and 13 minutes ago

Augusto Mazzei submitted Solution 1943077 to Problem 42894. Find longest run

Augusto Mazzei submitted Solution 1943061 to Problem 42922. Zero Cross

16 hours and 26 minutes ago

Augusto Mazzei submitted Solution 1943053 to Problem 43675. Weave two matrices together to form one matrix

16 hours and 32 minutes ago

Augusto Mazzei submitted Solution 1943046 to Problem 43072. Check if a rotated array was originally sorted

16 hours and 37 minutes ago

Augusto Mazzei submitted Solution 1943044 to Problem 42893. Look Up Mapping

16 hours and 44 minutes ago

Augusto Mazzei submitted Solution 1943041 to Problem 42875. Assignment Problem

17 hours and 1 minute ago

Augusto Mazzei submitted Solution 1943029 to Problem 42845. generate number in particular way

17 hours and 24 minutes ago

Augusto Mazzei submitted Solution 1943011 to Problem 42816. Sorting integers by their digits (Level 4)

17 hours and 39 minutes ago

Augusto Mazzei submitted Solution 1942962 to Problem 42815. Sorting integers by their digits (Level 3)

18 hours and 5 minutes ago

Augusto Mazzei submitted Solution 1942943 to Problem 42811. Sorting integers by their digits (Level 2)

18 hours and 11 minutes ago

Augusto Mazzei submitted Solution 1942910 to Problem 42634. Minimum of each diagonal

18 hours and 30 minutes ago

Augusto Mazzei submitted Solution 1942867 to Problem 42854. Crunch that matrix!

18 hours and 46 minutes ago

Augusto Mazzei submitted Solution 1942863 to Problem 42798. Moving Product (Easy)

18 hours and 49 minutes ago

Augusto Mazzei submitted Solution 1942856 to Problem 43609. Sort rows of a matrix

18 hours and 56 minutes ago

Augusto Mazzei submitted Solution 1942852 to Problem 42858. Block average ignoring NaN values

19 hours and 2 minutes ago

Augusto Mazzei submitted Solution 1942746 to Problem 42856. Block average

20 hours and 2 minutes ago

Augusto Mazzei submitted Solution 1942720 to Problem 43803. Cookie Cutters

20 hours and 14 minutes ago

Augusto Mazzei submitted Solution 1942149 to Problem 2126. Split bread like the Pharaohs - Egyptian fractions and greedy algorithm

on 19 Sep 2019 at 2:20

Augusto Mazzei submitted Solution 1942138 to Problem 44500. Find the starting index of a consecutive condition

on 19 Sep 2019 at 1:49

Augusto Mazzei submitted Solution 1942135 to Problem 1478. Hamiltonian Cycle

on 19 Sep 2019 at 1:46

Augusto Mazzei submitted Solution 1942121 to Problem 2147. Langston's Ant

on 19 Sep 2019 at 1:36

Augusto Mazzei submitted Solution 1941783 to Problem 1686. Generate a melodic contour string matrix

on 18 Sep 2019 at 17:23

Augusto Mazzei submitted Solution 1941742 to Problem 1696. Morse Code Generator! Try it!

on 18 Sep 2019 at 16:51

Augusto Mazzei submitted Solution 1941597 to Problem 44823. Relative points in 2D: problem 1

on 18 Sep 2019 at 15:25

Augusto Mazzei submitted Solution 1941583 to Problem 44820. Relative pose in 2D: problem 2

on 18 Sep 2019 at 15:10

Augusto Mazzei submitted Solution 1941568 to Problem 44819. Relative pose in 2D: problem 1

on 18 Sep 2019 at 15:02

Augusto Mazzei received Indexing IV Master badge

on 18 Sep 2019 at 12:14

Choose a web site to get translated content where available and see local events and offers. Based on your location, we recommend that you select: .

You can also select a web site from the following list:

Select the China site (in Chinese or English) for best site performance. Other MathWorks country sites are not optimized for visits from your location.

Contact your local office