꿈꾸는공학도

Python Binary Tree 문제[Final Test 기출]

문제의 요지와 Skleton code는 아래와 같다."""1. binary tree height 구하라2. binary tree balanced 맞는지 체크3. binary search tree 맞는지 체크4. 두 노드의 common ancestor 모두 구하기5. 두 노드의 lowest common ancestor 구하기"""  일단 문제에 쓰인 저 단어들이 각 무엇을 뜻하는지 부터 체크해보기1. height(T0)트리의 높이 구하기:정의: 트리의 높이는 루트 노드에서 가장 깊은 리프 노드까지의 경로 길이입니다.계산:루트 8의 왼쪽 서브트리의 높이 = 2루트 8의 오른쪽 서브트리의 높이 = 2따라서 전체 높이는 3.2. is_balanced(T0)트리가 균형 잡혔는지 여부:정의: 이진 트리가 균형 잡혔..

Remove loop in Linked List(Linked List,two-pointer,algorithm,Data Structures,Algorithms) - 플로이드의 사이클 감지 알고리즘 (Floyd's Cycle Detection Algorithm)

https://www.geeksforgeeks.org/problems/remove-loop-in-linked-list/1?page=1&category=Linked%20List&difficulty=Medium,Hard&sortBy=submissions Remove loop in Linked List | Practice | GeeksforGeeksGiven the head of a linked list that may contain a loop.  A loop means that the last node of the linked list is connected back to a node in the same list.  So if the next of the previous node is null. then..

Construct String With Repeat Limit(Hash Table,String,Greedy,Heap (Priority Queue)Counting)

https://leetcode.com/problems/construct-string-with-repeat-limit/description/?envType=daily-question&envId=2024-12-17You are given a string s and an integer repeatLimit. Construct a new string repeatLimitedString using the characters of s such that no letter appears more than repeatLimit times in a row. You do not have to use all characters from s.Return the lexicographically largest repeatLimit..

Final Array State After K Multiplication Operations I(Array,Math,Heap (Priority Queue),Simulation)

https://leetcode.com/problems/final-array-state-after-k-multiplication-operations-i/description/?envType=daily-question&envId=2024-12-16You are given an integer array nums, an integer k, and an integer multiplier.You need to perform k operations on nums. In each operation:Find the minimum value x in nums. If there are multiple occurrences of the minimum value, select the one that appears first.R..

https://leetcode.com/problems/move-pieces-to-obtain-a-string/description/?envType=daily-question&envId=2024-12-05You are given two strings start and target, both of length n. Each string consists only of the characters 'L', 'R', and '_' where:The characters 'L' and 'R' represent pieces, where a piece 'L' can move to the left only if there is a blank space directly to its left, and a piece 'R' ca..

https://leetcode.com/problems/pancake-sorting/description/Given an array of integers arr, sort the array by performing a series of pancake flips.In one pancake flip we do the following steps:Choose an integer k where 1 Reverse the sub-array arr[0...k-1] (0-indexed).For example, if arr = [3,2,1,4] and we performed a pancake flip choosing k = 3, we reverse the sub-array [3,2,1], so arr = [1,2,3,4]..

https://leetcode.com/problems/minesweeper/description/Let's play the minesweeper game (Wikipedia, online game)!You are given an m x n char matrix board representing the game board where:'M' represents an unrevealed mine,'E' represents an unrevealed empty square,'B' represents a revealed blank square that has no adjacent mines (i.e., above, below, left, right, and all 4 diagonals),digit ('1' to '..

https://leetcode.com/problems/next-greater-element-i/description/The next greater element of some element x in an array is the first greater element that is to the right of x in the same array.You are given two distinct 0-indexed integer arrays nums1 and nums2, where nums1 is a subset of nums2.For each 0  j such that nums1[i] == nums2[j] and determine the next greater element of nums2[j] in nums..

https://leetcode.com/problems/integer-to-roman/description/Seven different symbols represent Roman numerals with the following values:SymbolValueI1V5X10L50C100D500M1000Roman numerals are formed by appending the conversions of decimal place values from highest to lowest. Converting a decimal place value into a Roman numeral has the following rules:If the value does not start with 4 or 9, select t..

https://leetcode.com/problems/maximum-difference-between-node-and-ancestor/description/Given the root of a binary tree, find the maximum value v for which there exist different nodes a and b where v = |a.val - b.val| and a is an ancestor of b.A node a is an ancestor of b if either: any child of a is equal to b or any child of a is an ancestor of b. Example 1:Input: root = [8,3,10,1,6,null,14,nul..