LeetCode 678 solution

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 '

LeetCode 1249 solution

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

LeetCode 1544 solution

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]

LeetCode 1614 solution

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

LeetCode 205 solution

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

LeetCode 58 solution

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

Python String method

가끔 알고리즘을 풀다 보면 string method를 필요로 할 경우들이 있다. 아주 쉬운 문제인 경우는 string method를 이용하면 순식간에 풀 수 있다. 하지만 기억이 가물가물할 경우에는 한참을 돌아가야 한다. 때문에 이에 대해서 document를 보면서 정리한다.

LeetCode 2958 solution

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

LeetCode 713 solution

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

LeetCode 442 solution

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

LeetCode 1609 solution

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. -

DeBERTa

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