반응형

알고리즘풀이

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

    [LeetCode] 1319. Number of Operations to Make Network Connected - Java
    알고리즘/LeetCode

    [LeetCode] 1319. Number of Operations to Make Network Connected - Java

    https://leetcode.com/problems/number-of-operations-to-make-network-connected/description/ Number of Operations to Make Network Connected - LeetCode Can you solve this real interview question? Number of Operations to Make Network Connected - There are n computers numbered from 0 to n - 1 connected by ethernet cables connections forming a network where connections[i] = [ai, bi] represents a connec..

    알고리즘/LeetCode

    [LeetCode] 2348. Number of Zero-Filled Subarrays - Java

    https://leetcode.com/problems/number-of-zero-filled-subarrays/description/ Number of Zero-Filled Subarrays - LeetCode Can you solve this real interview question? Number of Zero-Filled Subarrays - Given an integer array nums, return the number of subarrays filled with 0. A subarray is a contiguous non-empty sequence of elements within an array. Example 1: Input: nums = leetcode.com 문제 Given an in..

반응형

티스토리툴바