반응형

algorythm

    [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..

    알고리즘/LeetCode

    [LeetCode] 605. Can Place Flowers - Java

    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 ..

    알고리즘/LeetCode

    [LeetCode] 211. Design Add and Search Words Data Structure - Java

    https://leetcode.com/problems/design-add-and-search-words-data-structure/description/ Design Add and Search Words Data Structure - LeetCode Can you solve this real interview question? Design Add and Search Words Data Structure - Design a data structure that supports adding new words and finding if a string matches any previously added string. Implement the WordDictionary class: * WordDictionar l..

    [LeetCode] 208. Implement Trie (Prefix Tree) - Java
    알고리즘/LeetCode

    [LeetCode] 208. Implement Trie (Prefix Tree) - Java

    https://leetcode.com/problems/implement-trie-prefix-tree/ Implement Trie (Prefix Tree) - LeetCode Can you solve this real interview question? Implement Trie (Prefix Tree) - A trie [https://en.wikipedia.org/wiki/Trie] (pronounced as "try") or prefix tree is a tree data structure used to efficiently store and retrieve keys in a dataset of strings. There leetcode.com 문제 A trie (pronounced as "try")..

반응형

티스토리툴바