[LeetCode] 15. 3Sum - Java
·
알고리즘/LeetCode
https://leetcode.com/problems/3sum/description/ 3Sum - LeetCode Level up your coding skills and quickly land a job. This is the best place to expand your knowledge and get prepared for your next interview. leetcode.com 문제 Given an integer array nums, return all the triplets [nums[i], nums[j], nums[k]] such that i != j, i != k, and j != k, and nums[i] + nums[j] + nums[k] == 0. Notice that the sol..
[Leetcode] 263. Ugly Number - Java
·
알고리즘/LeetCode
https://leetcode.com/problems/ugly-number/description/ Ugly Number - LeetCode Level up your coding skills and quickly land a job. This is the best place to expand your knowledge and get prepared for your next interview. leetcode.com 문제 An ugly number is a positive integer whose prime factors are limited to 2, 3, and 5. Given an integer n, return true if n is an ugly number. Example 1: Input: n =..
[LeetCode] 153. Find Minimum in Rotated Sorted Array - Java
·
알고리즘/LeetCode
https://leetcode.com/problems/find-minimum-in-rotated-sorted-array/ Find Minimum in Rotated Sorted Array - LeetCode Level up your coding skills and quickly land a job. This is the best place to expand your knowledge and get prepared for your next interview. leetcode.com 문제 Suppose an array of length n sorted in ascending order is rotated between 1 and n times. For example, the array nums = [0,1,..
[LeetCode] 152. Maximum Product Subarray - Java
·
알고리즘/LeetCode
https://leetcode.com/problems/maximum-product-subarray/ Maximum Product Subarray - LeetCode Level up your coding skills and quickly land a job. This is the best place to expand your knowledge and get prepared for your next interview. leetcode.com 문제 Given an integer array nums, find a subarray that has the largest product, and return the product. The test cases are generated so that the answer w..
[LeetCode] 374. Guess Number Higher or Lower - Java
·
알고리즘/LeetCode
https://leetcode.com/problems/guess-number-higher-or-lower/description/ Guess Number Higher or Lower - LeetCode Level up your coding skills and quickly land a job. This is the best place to expand your knowledge and get prepared for your next interview. leetcode.com 문제 We are playing the Guess Game. The game is as follows: I pick a number from 1 to n. You have to guess which number I picked. Eve..
HYOJUN
'알고리즘' 카테고리의 글 목록 (16 Page)