[LeetCode] 64. Minimum Path Sum - Java
·
알고리즘/LeetCode
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] 105. Construct Binary Tree from Preorder and Inorder Traversal - Java
·
알고리즘/LeetCode
https://leetcode.com/problems/construct-binary-tree-from-preorder-and-inorder-traversal/description/ Construct Binary Tree from Preorder and Inorder Traversal - LeetCode Can you solve this real interview question? Construct Binary Tree from Preorder and Inorder Traversal - Given two integer arrays preorder and inorder where preorder is the preorder traversal of a binary tree and inorder is the i..
[LeetCode] 1319. Number of Operations to Make Network Connected - Java
·
알고리즘/LeetCode
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] 2348. Number of Zero-Filled Subarrays - Java
·
알고리즘/LeetCode
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..
[LeetCode] 605. Can Place Flowers - Java
·
알고리즘/LeetCode
https://leetcode.com/problems/can-place-flowers/description/ 문제 You have a long flowerbed in which some of the plots are planted, and some are not. However, flowers cannot be planted in adjacent plots. Given an integer array flowerbed containing 0's and 1's, where 0 means empty and 1 means not empty, and an integer n, return if n new flowers can be planted in the flowerbed without violating the ..
HYOJUN
'분류 전체보기' 카테고리의 글 목록 (6 Page)