# easy
[Leetcode]997. Find the Town Judge
In a town, there are n people labeled from 1 to n. There is a rumor that one of these people is secretly the town judge.If the town judge exists, then
[Leetcode] 1971. Find if Path Exists in Graph
There is a bi-directional graph with n vertices, where each vertex is labeled from 0 to n - 1 (inclusive). The edges in the graph are represented as a
[Leetcode]1791. Find Center of Star Graph
업로드중..There is an undirected star graph consisting of n nodes labeled from 1 to n. A star graph is a graph where there is one center node and exactly
[Leetcode] 290. Word Pattern
Given a pattern and a string s, find if s follows the same pattern.Here follow means a full match, such that there is a bijection between a letter in
70. Climbing Stairs
n걸음 후 도달하는 계단을 오르고 있다. 한번에 한 걸음 또는 두 걸음을 오를 수 있을 때, 계단을 오르는 방법의 가짓수를 출력하시오.
[LeetCode] #112: Path Sum
Return true if the tree has a root-to-leaf path such that adding up all the values along the path equals targetSum.
[LeetCode] #108: Convert Sorted Array to Binary Search Tree
Problem: Given an integer array nums where the elements are sorted in ascending order, convert it to a height-balanced binary search tree.
[LeetCode] #111: Minimum Depth of Binary Tree
Given a binary tree, find its minimum depth.
[LeetCode] #617: Merge Two Binary Trees
You are given two binary trees root1 and root2. Return the merged tree.
CRA 가장 쉽고 빠른 서버 세팅
들어가기 전,Rakei 폴더 생성 후 VSC로 폴더를 열어준다.(현재 위치 ~/Rakei/) 초기화 실행yarn init npm init(현재 위치 ~/Rakei/) package.json이 형성된다.server가 쓸 패키지들을 따로 관리하는 곳(현재 위치 ~/Rake
557. Reverse Words in a String III
Given a string s, reverse the order of characters in each word within a sentence while still preserving whitespace and initial word order.