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 leetcode.com 새 단어를 추가하고 이전에 추가한 문자열과 일치하는 문자열을 찾는 것을 지원하는 데이터 구조를 설계합니다. 단어는 점 '.'을 포함할..
https://leetcode.com/problems/implement-trie-prefix-tree/description/?envType=study-plan-v2&envId=top-interview-150 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 s..
Binary Tree Right Side View - LeetCode Can you solve this real interview question? Binary Tree Right Side View - Given the root of a binary tree, imagine yourself standing on the right side of it, return the values of the nodes you can see ordered from top to bottom. Example 1: [https://asse leetcode.com 이진 트리의 루트가 주어졌을 때, 자신이 그 오른쪽에 서 있다고 상상하고 위에서 아래로 순서대로 보이는 노드의 값을 반환합니다. Example 1: Input: ro..
Average of Levels in Binary Tree - LeetCode Can you solve this real interview question? Average of Levels in Binary Tree - Given the root of a binary tree, return the average value of the nodes on each level in the form of an array. Answers within 10-5 of the actual answer will be accepted. Examp leetcode.com 이진 트리의 루트가 주어졌을 때, 각 레벨에 있는 노드의 평균값을 배열의 형태로 반환합니다. Example 1: Input: root = [3,9,20,nu..
