algorithm - DevDave

[LeetCode] #105. Construct Binary Tree from Preorder and Inorder Traversal cover image

[LeetCode] #105. Construct Binary Tree from Preorder and Inorder Traversal cover image

#leet_code#algorithm#medium_level#java#array#tree#depth_first_search#dfs

[LeetCode] #105. Construct Binary Tree from Preorder and Inorder Traversal

전위 순회, 중위 순회 값을 바탕으로 이진 트리를 구해봅니다.

[LeetCode] #102. Binary Tree Level Order Traversal cover image

[LeetCode] #102. Binary Tree Level Order Traversal cover image

#leet_code#algorithm#medium_level#java#tree#breadth_first_search#bfs

[LeetCode] #102. Binary Tree Level Order Traversal

주어진 트리의 너비 우선 탐색(BFS)을 통해 레벨별로 묶은 노드의 값을 구해봅니다.

[LeetCode] #98. Validate Binary Search Tree cover image

[LeetCode] #98. Validate Binary Search Tree cover image

#leet_code#algorithm#medium_level#java#tree#depth_first_search#binary_search_tree#bst

[LeetCode] #98. Validate Binary Search Tree

주어진 트리가 올바른 이진 탐색 트리인지 확인합니다.

[LeetCode] #91. Decode Ways cover image

[LeetCode] #91. Decode Ways cover image

#leet_code#algorithm#medium_level#java#string#dynamic_programming

[LeetCode] #91. Decode Ways

디코딩 가능한 모든 경우의 수를 구해봅니다.

[LeetCode] #79. Word Search cover image

[LeetCode] #79. Word Search cover image

#leet_code#algorithm#medium_level#java#array#backtracking

[LeetCode] #79. Word Search

주어진 단어가 2차원 배열에 연속적으로 인접하여 존재하는지 확인합니다.

[LeetCode] #78. Subsets cover image

[LeetCode] #78. Subsets cover image

#leet_code#algorithm#medium_level#java#array#backtracking#bit_manipulation

[LeetCode] #78. Subsets

중복없는 집합 요소에서 가능한 모든 조합을 구해봅니다.