Test your understanding of various coding challenges focusing on algorithm efficiency.

Coding

Challenge Yourself

Efficiently prepare for coding interviews with strategies from FAANG engineers. Avoid the LeetCode grind and simplify your interview prep with real-world questions from top companies.

The ultimate guide to the System Design Interview – developed by Meta & Google engineers. Master distributed system fundamentals, and practice with real-world interview questions & mock interviews.

System Design

The essential guide to API Design & Product Design Interviews – developed by FAANG engineers. Master product design fundamentals & get hands-on with real-world APIs.

API Design

A battle-tested guide to Object Oriented Design Interviews – developed by FAANG engineers. Master OOD fundamentals & practice real-world interview questions.

Low Level Design Interview Using OOD Principles

Your essential EM Interview crash course. Learn strategies from FAANG hiring managers to demonstrate your leadership skills & experience to interviewers.

Engineering Management and Leadership Interviews

The ultimate guide to behavioral interviews. Developed by FAANG engineers. Use real-world questions, video recording, and structured strategies to get interview-ready in just a few hours.

Behavioral

# Statement

You're given an integer array, `arr`. Return a resultant array so that `res[i]` is equal to the product of all the elements of `arr` except `arr[i]`.


Write an algorithm that runs in $O(n)$ time without using the division operation.

**Constraints:**

- $2 \leq$ `arr.length` $\leq 10^3$
- $-30 \leq$ `arr[i]` $\leq 30$
- The product of any prefix or suffix of `arr` is guaranteed to fit in a 32-bit integer.

# Examples

Try to solve the  Product of Array Except Self problem.

Problem: Product of Array Except Self

Statement

Examples

Problem: Product of Array Except Self

Statement

Examples