Senior Software Engineer @HCL TECH | Ex-Infoscian | 5.11 YOE in Software Engineering | JAVA Full Stack Developer
🚀 Leetcode Daily Challenge 📅 15th March 2024 Post Part-I (Problem Statement) Problem Statement: 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. Example 1: Input: nums = [1,2,3,4] Output: [24,12,8,6] Can you think about the solution 🤔? #dailycodingchallenge #leetcode #problemoftheday #programmers