Today's LeetCode daily coding challenge

Frammenti di codice

curl "https://api.oanor.com/leetcode-api/v1/daily" \
  -H "x-oanor-key: oanor_test_..."

await fetch("https://api.oanor.com/leetcode-api/v1/daily", {
  headers: { "x-oanor-key": "oanor_test_..." }
});

$ch = curl_init("https://api.oanor.com/leetcode-api/v1/daily");
curl_setopt($ch, CURLOPT_HTTPHEADER, ["x-oanor-key: oanor_test_..."]);
curl_setopt($ch, CURLOPT_RETURNTRANSFER, true);
$out = curl_exec($ch);

import requests
requests.get(
    "https://api.oanor.com/leetcode-api/v1/daily",
    headers={"x-oanor-key": "oanor_test_..."}
)

Risposta di esempio

Una risposta reale di questo endpoint, acquisita dall'ultimo health check.

{
    "data": {
        "date": "2026-06-10",
        "link": "https://leetcode.com/problems/maximum-total-subarray-value-ii/",
        "slug": "maximum-total-subarray-value-ii",
        "title": "Maximum Total Subarray Value II",
        "source": "LeetCode",
        "paid_only": false,
        "difficulty": "Hard",
        "topic_tags": [
            "Array",
            "Greedy",
            "Segment Tree",
            "Heap (Priority Queue)"
        ],
        "question_id": "3691",
        "acceptance_rate": 34.66
    },
    "meta": {
        "timestamp": "2026-06-10T14:01:39.483Z",
        "request_id": "0aff63e5-7586-436f-9f80-7d411b0b723e"
    },
    "status": "ok",
    "message": "Daily challenge retrieved successfully",
    "success": true
}