Microsoft3 LeetCode 628. Maximum Product of Three Numbers Problem: Given an integer array, find three numbers whose product is maximum and output the maximum product. Example 1: Input: [1,2,3] Output: 6 Example 2: Input: [1,2,3,4] Output: 24 Note: The length of the given array will be in range [3,104] and all elements are in the range [-1000, 1000]. Multiplication of any three numbers in the input won't exceed the range of 32-bit signed integer. -Summa.. 2020. 7. 9. LeetCode 665. Non-decreasing Array Problem: Given an array nums with n integers, your task is to check if it could become non-decreasing by modifying at most 1 element. We define an array is non-decreasing if nums[i] 2020. 6. 18. [Arrays] rotateImage - Amazon, Microsoft, Apple Problem: Note: Try to solve this task in-place (with O(1) additional memory), since this is what you'll be asked to do during an interview. You are given an n x n 2D matrix that represents an image. Rotate the image by 90 degrees (clockwise). Example For the output should be -Summary- 1. Reverse the matrix first 2. Transpose the matrix to move around the elements. The element will be rotated wit.. 2020. 5. 29. 이전 1 다음
