전체 글103 [leetcode]1381. Design a Stack With Increment Operation LeetCode - The World's Leading Online Programming Learning Platform Design a Stack With Increment Operation - LeetCode Can you solve this real interview question? Design a Stack With Increment Operation - Design a stack that supports increment operations on its elements. Implement the CustomStack class: * CustomStack(int maxSize) Initializes the object with maxSize which i leetcode.com 문제 이해 ■ C.. 2023. 9. 1. [leetcode]1544.Make The String Great https://leetcode.com/problems/make-the-string-great/ Make The String Great - LeetCode Can you solve this real interview question? Make The String Great - 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 0) { char top = st.peek(); boolean flag = compareChar(top, c); if(flag == true){ st.pop(.. 2023. 8. 31. [leetcode]1074.Remove All Adjacent Duplicates In String LeetCode - The World's Leading Online Programming Learning Platform Remove All Adjacent Duplicates In String - LeetCode Can you solve this real interview question? Remove All Adjacent Duplicates In String - You are given a string s consisting of lowercase English letters. A duplicate removal consists of choosing two adjacent and equal letters and removing them. We repeatedl leetcode.com 문제 이해 영어.. 2023. 8. 30. [leetcode] 1614. Maximum Nesting Depth of the Parentheses LeetCode - The World's Leading Online Programming Learning Platform Maximum Nesting Depth of the Parentheses - LeetCode Can you solve this real interview question? Maximum Nesting Depth of the Parentheses - 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 ca leetcode.com 문제 이해 가장.. 2023. 8. 29. [leetcode] 1021.Remove Outermost Parentheses https://leetcode.com/problems/remove-outermost-parentheses/description/ Remove Outermost Parentheses - LeetCode Can you solve this real interview question? Remove Outermost Parentheses - A valid parentheses string is either empty "", "(" + A + ")", or A + B, where A and B are valid parentheses strings, and + represents string concatenation. * For example, "", "()", leetcode.com 문제 이해 '()'한쌍의 완전한.. 2023. 8. 28. [leetcode] 844.Backspace String compare https://leetcode.com/problems/backspace-string-compare/description/ Backspace String Compare - LeetCode Can you solve this real interview question? Backspace String Compare - Given two strings s and t, return true if they are equal when both are typed into empty text editors. '#' means a backspace character. Note that after backspacing an empty text, the tex leetcode.com 🧐 문제 이해 두 개의 문자열 s와 t가 주.. 2023. 8. 27. 이전 1 2 3 4 ··· 18 다음