[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 ..
[LeetCode] 19. Remove Nth Node From End of List - Java
·
알고리즘/LeetCode
https://leetcode.com/problems/remove-nth-node-from-end-of-list/description/ Remove Nth Node From End of List - 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 the head of a linked list, remove the nth node from the end of the list and return its head. Example 1: Input: hea..
[LeetCode] 198. House Robber - Java
·
알고리즘/LeetCode
https://leetcode.com/problems/house-robber/description/ House Robber - 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 a professional robber planning to rob houses along a street. Each house has a certain amount of money stashed, the only constraint stopping you from rob..
[LeetCode] 91. Decode Ways - Java
·
알고리즘/LeetCode
https://leetcode.com/problems/decode-ways/description/ Decode Ways - 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 문제 A message containing letters from A-Z can be encoded into numbers using the following mapping: 'A' -> "1" 'B' -> "2" ... 'Z' -> "26" To decode an encoded message,..
HYOJUN
'Java' 태그의 글 목록 (12 Page)