2196. Create Binary Tree From Descriptions #Hash #Binary tree problem You are given a 2D integer array descriptions where descriptions[i] = [parenti, childi, isLefti] indicates that parenti is the parent of childi in a binary tree of unique values. Furthermore, If isLefti == 1, then childi is the left child of
1823. Find the Winner of the Circular Game #Array #Math #Recursion #Queue #Simulation problem There are n friends that are playing a game. The friends are sitting in a circle and are numbered from 1 to n in clockwise order. More formally, moving clockwise from the ith friend brings you
맥에서 했으면 훨씬 구성이 쉬웠겠지만, 그리고 poetry로 했으면 훨씬 쉬웠겠지만 워낙 규모가 있는 라이브러리이다 보니 과정이 어려워 다른 참조들을 보면서 따라했다. 기본적으로 poetry랑 쓰기 어려운 이유는 airflow 내부의 라이브러리에 따라 poetry가 버전을 참조하지 못해서 에러가 나는 경우가 존재한다고 한다. 또한 하나의 문제는 mac에서는 그냥 리눅스가 존재하지만 윈도우에서 하려면 윈도우용 linux인
json은 javascript object notation의 줄임말로 웹 어플리케이션에서 구조화된 데이터를 표현하기 위한 string 기반의 포맷이다. 서버에서 클라인트로 데이터를 전송하여 표현하거나, 그 반대로 클라이언트에서 서버로 보내는 경우들에 사용된다. javascript 객체 문법과 굉장히 유사하지만 워낙에 범용성이 넓게 설계되어 있어서 다른 언어들에도 많이 사용된다. 기본적으로 python 에는 json 이 내장 모듈이다. 바로 import json해주면
2285. Maximum Total Importance of Roads #Greedy #Graph #Sorting #Heap(Priority Queue) problem You are given an integer n denoting the number of cities in a country. The cities are numbered from 0 to n - 1. You are also given a 2D integer array roads where roads[i] = [ai,
![[Blind75] Best time to buy and sell stock](/content/images/size/w600/2024/05/1_3N6z7wCvSkDRv_Kr1ZIk4A@2x-1-.jpeg)
121. Best Time to Buy and Sell Stock #Array #Dynamic Programming #blind75/2 problem You are given an array prices where prices[i] is the price of a given stock on the ith day. You want to maximize your profit by choosing a single day to buy one stock and
1. Two Sum #Array #Hash_table #blind75/1 problem Given an array of integers nums and an integer target, return indices of the two numbers such that they add up to target. You may assume that each input would have exactly one solution, and you may not use the same
2073. Time Needed to Buy Tickets #Easy #Queue problem There are n people in a line queuing to buy tickets, where the 0th person is at the front of the line and the (n - 1)th person is at the back of the line. You are given a 0-indexed
1700. Number of Students Unable to Eat Lunch #Easy #Queue problem The school cafeteria offers circular and square sandwiches at lunch break, referred to by numbers 0 and 1 respectively. All students stand in a queue. Each student either prefers square or circular sandwiches. The number of sandwiches in the
678. Valid Parenthesis String #Medium #stack #dp problem Given a string s containing only three types of characters: '(', ')' and '*', return true if s is valid. The following rules define a valid string: * Any left parenthesis '(' must have a corresponding right parenthesis '
1249. Minimum Remove to Make Valid Parentheses #Medium #stack problem Given a string s of '(' , ')' and lowercase English characters. Your task is to remove the minimum number of parentheses ('(' or ')', in any positions) so that the resulting parentheses string is valid and
1544. Make The String Great #Easy #Stack problem Given a string s of lower and upper case English letters. A good string is a string which doesn't have two adjacent characters s[i] and s[i + 1] where: * 0 <= i <= s.length - 2 * s[i]
Algorithm
1614. Maximum Nesting Depth of the Parentheses #Easy #Stack problem A string is a valid parentheses string (denoted VPS) if it meets one of the following: * It is an empty string "", or a single character not equal to "(" or ")", * It can be written as
Algorithm
205. Isomorphic Strings #Hash_table #String problem Given two strings s and t, determine if they are isomorphic. Two strings s and t are isomorphic if the characters in s can be replaced to get t. All occurrences of a character must be replaced with another character while preserving the
Algorithm
58. Length of Last WordSolved #Easy #String problem Given a string s consisting of words and spaces, return the length of the last word in the string. A word is a maximal substring consisting of non-space characters only. Example 1: * Input: s = "Hello World" * Output: 5 * Explanation: The
가끔 알고리즘을 풀다 보면 string method를 필요로 할 경우들이 있다. 아주 쉬운 문제인 경우는 string method를 이용하면 순식간에 풀 수 있다. 하지만 기억이 가물가물할 경우에는 한참을 돌아가야 한다. 때문에 이에 대해서 document를 보면서 정리한다.
Algorithm
2958. Length of Longest Subarray With at Most K Frequency #Medium #Array #Hash_table #Sliding_window problem You are given an integer array nums and an integer k. The frequency of an element x is the number of times it occurs in an array. An array is called good if
Algorithm
713. Subarray Product Less Than K #Medium #Array #SlidingWindow problem Given an array of integers nums and an integer k, return the number of contiguous subarrays where the product of all the elements in the subarray is strictly less than k. Example 1: * Input: nums = [10,5,2,6], k
Algorithm
442. Find All Duplicates in an Array #Array #HashTable problem Given an integer array nums of length n where all the integers of nums are in the range [1, n] and each integer appears once or twice, return an array of all the integers that appears twice. You must write
Algorithm
1609. Even Odd Tree #Tree #Breadth-First Search #Binary Tree problem A binary tree is named Even-Odd if it meets the following conditions: - The root of the binary tree is at level index 0, its children are at level index 1, their children are at level index 2, etc. -
MLDL
DECODING-ENHANCED BERT WITH DIS-ENTANGLED ATTENTION Arxiv Abstract Recent progress in pre-trained neural language models has significantly improved the performance of many natural language processing (NLP) tasks. In this paper we propose a new model architecture DeBERTa (Decoding-enhanced BERT with disentangled attention) that improves the BERT and RoBERTa models using two
session이란 client로부터 오는 일련의 Request를 하나의 status로 보고, 그 status를 일정하게 유지하는 기술을 말한다. 다시 말하면 client가 web server에 접속해있는 상태 를 하나의 세션으로 보는 것이다. 브라우저를 닫거나, 서버에서 세션을 삭제하면 세션이 끊기고 없어진다. 세션은 각 클라이언트의 고유 세션id를 부여하는데, 이것으로 각 클라이언트를 구분하여 각 클라이언트의 요구에 맞는 응답을 반환한다.
Algorithm
513. Find Bottom Left Tree Value #Medium #Binary_tree problem Given the root of a binary tree, return the leftmost value in the last row of the tree. python # Definition for a binary tree node. # class TreeNode: # def __init__(self, val=0, left=None, right=None): # self.val = val # self.
MLDL
Hypothesis function 가설 함수 Hypothesis Definition To Describe the supervised learning problem slightly more formally, our goal is, given a training set, to learn a function $h : X \mapsto Y$ that $h(x)$ is a "good" predictor for the corresponding value of $y$. For historical reasons, this function