[LeetCode] 213. House Robber II - Java
·
알고리즘/LeetCode
https://leetcode.com/problems/house-robber-ii/description/ 문제 You are a professional robber planning to rob houses along a street. Each house has a certain amount of money stashed. All houses at this place are arranged in a circle. That means the first house is the neighbor of the last one. Meanwhile, adjacent houses have a security system connected, and it will automatically contact the police ..
[LeetCode] 300. Longest Increasing Subsequence - Java
·
알고리즘/LeetCode
https://leetcode.com/problems/longest-increasing-subsequence/description/ Longest Increasing Subsequence - 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 the length of the longest strictly increasing subsequence . Example 1: Input: nums = [10..
[LeetCode] 55. Jump Game - Java
·
알고리즘/LeetCode
https://leetcode.com/problems/jump-game/ Jump Game - 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 문제 You are given an integer array nums. You are initially positioned at the array's first index, and each element in the array represents your maximum jump length at that position. ..
[LeetCode] 377. Combination Sum IV - Java
·
알고리즘/LeetCode
https://leetcode.com/problems/combination-sum-iv/description/ Combination Sum IV - 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 array of distinct integers nums and a target integer target, return the number of possible combinations that add up to target. The test cas..
[LeetCode] 139. Word Break -Java
·
알고리즘/LeetCode
https://leetcode.com/problems/word-break/description/ Word Break - 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 a string s and a dictionary of strings wordDict, return true if s can be segmented into a space-separated sequence of one or more dictionary words. Note that ..
HYOJUN
'leetcode' 태그의 글 목록 (11 Page)