{
  "tasks": [
    {
      "id": 1,
      "title": "Min-max from array",
      "description": "input array arr of length n, 1 <= n <=100, output: 2-length array [min,max], where min is smallest element from arr, max - biggest one",
      "authorId": 1,
      "points": 100,
      "tags": [
        "math",
        "array",
        "algorithms"
      ],
      "tests": [
        {
          "id": 1,
          "taskId": 1,
          "input": "[1,2,4,0,-4]",
          "output": "[-4,4]"
        },
        {
          "id": 2,
          "taskId": 1,
          "input": "[1,5,11,-4,-32,3,5,1,4,5,1,5,5,555,43]",
          "output": "[-32,555]"
        },
        {
          "id": 3,
          "taskId": 1,
          "input": "[9,2,3,7,1,5,3,2,3,-4]",
          "output": "[-4,9]"
        },
        {
          "id": 4,
          "taskId": 1,
          "input": "[-33,-42,-423,-323,-1,-9,-11,-932,-3,-3]",
          "output": "[-932,-1]"
        }
      ],
      "haveUserSolved": false,
      "timesSolved": 2,
      "timesSubmitted": 5
    },
    {
      "id": 2,
      "title": "Isograms",
      "description": "An isogram is a word that has no repeating letters, consecutive or non-consecutive. Implement a function that determines whether a string that contains only letters is an isogram. Assume the empty string is an isogram.",
      "authorId": 1,
      "points": 50,
      "tags": [
        "strings"
      ],
      "tests": [
        {
          "id": 1,
          "taskId": 1,
          "input": "Dermatoglyphics",
          "output": true
        },
        {
          "id": 2,
          "taskId": 1,
          "input": "aba",
          "output": false
        },
        {
          "id": 3,
          "taskId": 1,
          "input": "Sample",
          "output": true
        },
      ],
      "haveUserSolved": false,
      "timesSolved": 12,
      "timesSubmitted": 123
    },
    {
      "id": 3,
      "title": "primes",
      "description": "input n: 1 < n < 100, output: n first prime numbers",
      "authorId": 1,
      "points": 100,
      "tags": [
        "math"
      ],
      "tests": [
        {
          "id": 5,
          "taskId": 3,
          "input": "2",
          "output": "[2, 3]"
        },
        {
          "id": 6,
          "taskId": 1,
          "input": "10",
          "output": "[2, 3, 5, 7, 11, 13, 17, 19, 23, 29]"
        },
        {
          "id": 7,
          "taskId": 1,
          "input": "20",
          "output": "[2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71]"
        },
        {
          "id": 8,
          "taskId": 1,
          "input": "30",
          "output": "[2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97, 101, 103, 107, 109, 113, 127, 131, 137, 139, 149]"
        }
      ],
      "haveUserSolved": false,
      "timesSolved": 12,
      "timesSubmitted": 123
    },
    {
      "id": 4,
      "title": "Reverse words",
      "description": "Write a reverseWords function that accepts a string a parameter, and reverses each word in the string. Any spaces in the string should be retained.",
      "authorId": 1,
      "points": 200,
      "tags": [
        "strings"
      ],
      "tests": [
        {
          "id": 1,
          "taskId": 1,
          "input": "aba",
          "output": "aba"
        },
        {
          "id": 2,
          "taskId": 1,
          "input": "This is an example!",
          "output": "sihT si na !elpmaxe"
        },
        {
          "id": 3,
          "taskId": 1,
          "input": "double  spaces",
          "output": "elbuod  secaps"
        },
        {
          "id": 4,
          "taskId": 1,
          "input": "a",
          "output": "a"
        }
      ],
      "haveUserSolved": false,
      "timesSolved": 12,
      "timesSubmitted": 123
    }
  ]
}