레벨업 일지

문제 Construct Binary Tree from Inorder and Postorder Traversal - LeetCode Construct Binary Tree from Inorder and Postorder Traversal - LeetCode Can you solve this real interview question? Construct Binary Tree from Inorder and Postorder Traversal - Given two integer arrays inorder and postorder where inorder is the inorder traversal of a binary tree and postorder is the postorder traversal of the..

문제 https://leetcode.com/problems/find-the-town-judge/description/ Find the Town Judge - LeetCode 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: 1. The town judge trusts nobody. 2. Everybody (except for the town judge) trusts leetcode.com 모든 사람의 신뢰를 받고, 그 자신은 아무도 믿지 않는 유..

문제 LeetCode - The World's Leading Online Programming Learning Platform Sudoku Solver - LeetCode Sudoku Solver - Write a program to solve a Sudoku puzzle by filling the empty cells. A sudoku solution must satisfy all of the following rules: 1. Each of the digits 1-9 must occur exactly once in each row. 2. Each of the digits 1-9 must occur exactly once leetcode.com 알아야 할 개념 brute force 구현 재귀 함수 풀이..

문제 https://leetcode.com/problems/binary-tree-zigzag-level-order-traversal/description/ Binary Tree Zigzag Level Order Traversal - LeetCode Binary Tree Zigzag Level Order Traversal - Given the root of a binary tree, return the zigzag level order traversal of its nodes' values. (i.e., from left to right, then right to left for the next level and alternate between). Example 1: [https://assets leetc..

문제 https://leetcode.com/problems/count-odd-numbers-in-an-interval-range/description/ Count Odd Numbers in an Interval Range - LeetCode Can you solve this real interview question? Count Odd Numbers in an Interval Range - Given two non-negative integers low and high. Return the count of odd numbers between low and high (inclusive). Example 1: Input: low = 3, high = 7 Output: 3 Explanati leetcode.c..

문제 https://leetcode.com/problems/best-team-with-no-conflicts/description/ Best Team With No Conflicts - LeetCode Can you solve this real interview question? Best Team With No Conflicts - You are the manager of a basketball team. For the upcoming tournament, you want to choose the team with the highest overall score. The score of the team is the sum of scores of all t leetcode.com 알아야 할 개념 DFS + ..

문제 https://leetcode.com/problems/best-team-with-no-conflicts/ Best Team With No Conflicts - LeetCode Best Team With No Conflicts - You are the manager of a basketball team. For the upcoming tournament, you want to choose the team with the highest overall score. The score of the team is the sum of scores of all the players in the team. However, the basketb leetcode.com Given two lists, scores and..

문제 https://leetcode.com/problems/n-th-tribonacci-number/description/ N-th Tribonacci Number - LeetCode N-th Tribonacci Number - The Tribonacci sequence Tn is defined as follows: T0 = 0, T1 = 1, T2 = 1, and Tn+3 = Tn + Tn+1 + Tn+2 for n >= 0. Given n, return the value of Tn. Example 1: Input: n = 4 Output: 4 Explanation: T_3 = 0 + 1 + 1 = 2 T_4 = 1 + 1 leetcode.com 트라이보나치 수열 값을 구해서 리턴할 것. 알아야 할 개..