반응형

자바

    알고리즘/LeetCode

    [LeetCode] 2390. Removing Stars From a String - Java

    https://leetcode.com/problems/removing-stars-from-a-string/description/ Removing Stars From a String - LeetCode Can you solve this real interview question? Removing Stars From a String - You are given a string s, which contains stars *. In one operation, you can: * Choose a star in s. * Remove the closest non-star character to its left, as well as remove the star it leetcode.com 문제 You are given..

    [LeetCode] 1020. Number of Enclaves - Java
    알고리즘/LeetCode

    [LeetCode] 1020. Number of Enclaves - Java

    https://leetcode.com/problems/number-of-enclaves/ Number of Enclaves - LeetCode Can you solve this real interview question? Number of Enclaves - You are given an m x n binary matrix grid, where 0 represents a sea cell and 1 represents a land cell. A move consists of walking from one land cell to another adjacent (4-directionally) land leetcode.com 문제 You are given an m x n binary matrix grid, wh..

    알고리즘/LeetCode

    [LeetCode] 2405. Optimal Partition of String - Java

    https://leetcode.com/problems/optimal-partition-of-string/description/ Optimal Partition of String - LeetCode Can you solve this real interview question? Optimal Partition of String - Given a string s, partition the string into one or more substrings such that the characters in each substring are unique. That is, no letter appears in a single substring more than o leetcode.com 문제 Given a string ..

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

반응형

티스토리툴바