Daily Coding Challenge — uByte
Solve a brand-new coding challenge every day on uByte. The daily challenge is completely free for all users — no account required. Pick your language, write your solution, and get instant feedback from automated test cases.
Today's Problem: Product of Array Except Self
Difficulty: medium
Category: array
Given an integer array `nums`, return an array `answer` such that `answer[i]` is equal to the product of all elements of `nums` except `nums[i]`. You must write an algorithm that runs in **O(n)** time and without using the division operation. Hint: Build a prefix-products array left to right, then
How It Works
- A new problem is selected each day from a pool of 114+ challenges.
- Choose your language: Go, Python, JavaScript, TypeScript, Java, C++, Rust, C#, or SQL.
- Write and run your solution in the browser with instant test feedback.
- Earn XP and compete on the leaderboard.