TypeScript

8/29 (화) Tree의 깊이 탐색하기 TIL

공부한 것LeetCode #110. Balanced Binary TreeLeetCode - The World's Leading Online Programming Learning PlatformLevel 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.https://leetcode.com/problems/balanced-binary-tree/description/아직 타파중. 재귀 호출을 이용한 해답을 공부하고 추가하였다. 배운 것Tree 자료구조에서 한 노드를 타겟으로 그 ‘깊이’를 구하고자 할 때 공식처럼 사용할..

8/28 (월) 너비 우선 탐색(BFS)과 새로운 메소드 TIL

공부한 것LeetCode #100. Same TreeLeetCode - The World's Leading Online Programming Learning PlatformLevel 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.https://leetcode.com/problems/same-tree/Tree 카테고리로 넘어왔다. 기본적으로 재귀 호출이 필요한 구조인 듯 하다. LeetCode #110. Balanced Binary TreeLeetCode - The World's Leading Online Prog..

8/25 (금) TypeScript 테스트 코드, 성공적 TIL

공부한 것LeetCode #142. Linked List Cycle IILeetCode - The World's Leading Online Programming Learning PlatformLevel 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.https://leetcode.com/problems/linked-list-cycle-ii/description/?envType=list&envId=rus4c4ciFloyd’s Tortoise & Hare Algorithm을 이용한 간단한 문제였다. 우연히 접해서 알차..