반응형

Java

    [LeetCode] 1572. Matrix Diagonal Sum - Java
    알고리즘/LeetCode

    [LeetCode] 1572. Matrix Diagonal Sum - Java

    https://leetcode.com/problems/matrix-diagonal-sum/description/ Matrix Diagonal Sum - LeetCode Can you solve this real interview question? Matrix Diagonal Sum - Given a square matrix mat, return the sum of the matrix diagonals. Only include the sum of all the elements on the primary diagonal and all the elements on the secondary diagonal that are leetcode.com 문제 Given a square matrix mat, return ..

    알고리즘/LeetCode

    [LeetCode] 1046. Last Stone Weight - Java

    https://leetcode.com/problems/last-stone-weight/description/ Last Stone Weight - LeetCode Can you solve this real interview question? Last Stone Weight - You are given an array of integers stones where stones[i] is the weight of the ith stone. We are playing a game with the stones. On each turn, we choose the heaviest two stones and smash them leetcode.com 문제 You are given an array of integers s..

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

반응형

티스토리툴바