본문 바로가기

leetcode

684. Redundant Connection
PS/Leetcode 2025. 1. 29. 684. Redundant Connection https://leetcode.com/problems/redundant-connection/description/?envType=daily-question&envId=2025-01-29 In this problem, a tree is an undirected graph that is connected and has no cycles.You are given a graph that started as a tree with n nodes labeled from 1 to n, with one additional edge added. The added edge has two different vertices chosen from 1 to n, and was not an edge that already exist..
PS/Leetcode 2022. 6. 19. [Leetcode Medium] 1268. Search Suggestions System Search Suggestions System - LeetCode Level up your coding skills and quickly land a job. This is the best place to expand your knowledge and get prepared for your next interview. leetcode.com You are given an array of strings products and a string searchWord. Design a system that suggests at most three product names from products after each character of searchWord is typed. Suggested products sh..
PS/Leetcode 2022. 6. 18. [Leetcode Hard] 745. Prefix and Suffix Search Design a special dictionary with some words that searchs the words in it by a prefix and a suffix. Implement the WordFilter class: WordFilter(string[] words) Initializes the object with the words in the dictionary. f(string prefix, string suffix) Returns the index of the word in the dictionary, which has the prefix prefix and the suffix suffix. If there is more than one valid index, return the l..
PS/Leetcode 2022. 5. 23. [Leetcode Medium] 934. Shortest Bridge You are given an n x n binary matrix grid where 1 represents land and 0 represents water. An island is a 4-directionally connected group of 1's not connected to any other 1's. There are exactly two islands in grid. You may change 0's to 1's to connect the two islands to form one island. Return the smallest number of 0's you must flip to connect the two islands. Example 1: Input: grid = [[0,1],[1..
[leetcode Hard] 2203. Minimum Weighted Subgraph With the Required Paths
PS/Leetcode 2022. 3. 13. [leetcode Hard] 2203. Minimum Weighted Subgraph With the Required Paths You are given an integer n denoting the number of nodes of a weighted directed graph. The nodes are numbered from 0 to n - 1. You are also given a 2D integer array edges where edges[i] = [fromi, toi, weighti] denotes that there exists a directed edge from fromi to toi with weight weighti. Lastly, you are given three distinct integers src1, src2, and dest denoting three distinct nodes of the grap..
PS/Leetcode 2022. 1. 28. [leetcode medium] 211. Design Add and Search Words Data Structure (2) Design Add and Search Words Data Structure - LeetCode Design Add and Search Words Data Structure - LeetCode Level up your coding skills and quickly land a job. This is the best place to expand your knowledge and get prepared for your next interview. leetcode.com Constraints: 1
[leetcode medium] 421. 배열 내 두 요소의 최대 XOR값 구하기
PS/Leetcode 2022. 1. 27. [leetcode medium] 421. 배열 내 두 요소의 최대 XOR값 구하기 (1) Maximum XOR of Two Numbers in an Array - LeetCode Maximum XOR of Two Numbers in an Array - LeetCode Level up your coding skills and quickly land a job. This is the best place to expand your knowledge and get prepared for your next interview. leetcode.com Constraints: 1 i) & 1 if 1-bit in cur.child: #현재 자기 bit값과 반대되는 방향으로 최대한 이동 cur = cur.child[1- bit] ans += (1
728x90

티스토리툴바