All Problems
Practice previous year questions from all companies and topics.
| Status | Problem Title | Difficulty | Company | Topic | Action |
|---|---|---|---|---|---|
Practice previous year questions from all companies and topics.
| Status | Problem Title | Difficulty | Company | Topic | Action |
|---|---|---|---|---|---|
Given an integer array nums, return an array answer such that answer[i] is equal to the product of all the elements of nums except nums[i].
The product of any prefix or suffix of nums is guaranteed to fit in a 32-bit integer.
You must write an algorithm that runs in O(n) time and without using the division operation.
We're building something amazing
⚡ Expected launch: Q1 2026
💡 For now, practice solving on your local IDE and we'll notify you when the editor is ready!
Ready to start
Try to solve within 30-45 minutes. Good interview practice!