반응형

Java

    알고리즘/LeetCode

    [LeetCode] 881. Boats to Save People - Java

    https://leetcode.com/problems/boats-to-save-people/description/ Boats to Save People - LeetCode Can you solve this real interview question? Boats to Save People - You are given an array people where people[i] is the weight of the ith person, and an infinite number of boats where each boat can carry a maximum weight of limit. Each boat carries at most leetcode.com 문제 You are given an array people..

    알고리즘/LeetCode

    [LeetCode] 2300. Successful Pairs of Spells and Potions - Java

    https://leetcode.com/problems/successful-pairs-of-spells-and-potions/description/ Successful Pairs of Spells and Potions - LeetCode Can you solve this real interview question? Successful Pairs of Spells and Potions - You are given two positive integer arrays spells and potions, of length n and m respectively, where spells[i] represents the strength of the ith spell and potions[j] repre leetcode...

    알고리즘/LeetCode

    [LeetCode] 1402. Reducing Dishes - Java/Dart

    https://leetcode.com/problems/reducing-dishes/description/ Reducing Dishes - LeetCode Can you solve this real interview question? Reducing Dishes - A chef has collected data on the satisfaction level of his n dishes. Chef can cook any dish in 1 unit of time. Like-time coefficient of a dish is defined as the time taken to cook that dish incl leetcode.com 문제 A chef has collected data on the satisf..

    알고리즘/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..

반응형

티스토리툴바