반응형

Dynamic Programming

    알고리즘/LeetCode

    [LeetCode] 983. Minimum Cost For Tickets - Java/Dart

    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

    [LeetCode] 64. Minimum Path Sum - Java

    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

    [Leetcode] 1143. Longest Common Subsequence - Java

    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

    [LeetCode] 213. House Robber II - Java

    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

    [LeetCode] 377. Combination Sum IV - Java

    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..

반응형

티스토리툴바