[LeetCode] 983. Minimum Cost For Tickets - Java/Dart
·
알고리즘/LeetCode
https://leetcode.com/problems/minimum-cost-for-tickets/description/ Minimum Cost For Tickets - LeetCode Can you solve this real interview question? Minimum Cost For Tickets - You have planned some train traveling one year in advance. The days of the year in which you will travel are given as an integer array days. Each day is an integer from 1 to 365. Train leetcode.com 문제 You have planned some ..
[LeetCode] 64. Minimum Path Sum - Java
·
알고리즘/LeetCode
https://leetcode.com/problems/minimum-path-sum/description/ Minimum Path Sum - LeetCode Can you solve this real interview question? Minimum Path Sum - Given a m x n grid filled with non-negative numbers, find a path from top left to bottom right, which minimizes the sum of all numbers along its path. Note: You can only move either down or rig leetcode.com 문제 Given a m x n grid filled with non-ne..
[Leetcode] 1143. Longest Common Subsequence - Java
·
알고리즘/LeetCode
https://leetcode.com/problems/longest-common-subsequence/ Longest Common Subsequence - LeetCode Longest Common Subsequence - Given two strings text1 and text2, return the length of their longest common subsequence. If there is no common subsequence, return 0. A subsequence of a string is a new string generated from the original string with some chara leetcode.com 문제 Given two strings text1 and t..
[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,..
[LeetCode] 338. Counting Bits - Java
·
알고리즘/LeetCode
https://leetcode.com/problems/counting-bits/description/ Counting Bits - 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 n, return an array ans of length n + 1 such that for each i (0
HYOJUN
'DP' 태그의 글 목록