목록PS (471)
넘치게 채우기
https://leetcode.com/problems/valid-parenthesis-string/submissions/1225282138/ Leetcode - Valid Parenthesis String 문제 유형 : 문자열 처리, 스택 문제 난이도 : Medium 문제 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 ')'. Any right parenthesis '..
https://leetcode.com/problems/minimum-remove-to-make-valid-parentheses/description/ Leetcode - Minimum Remove to Make Valid Parentheses 문제 유형 : 문자열 처리 / 스택 문제 난이도 : Medium 문제 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 return any vali..
https://leetcode.com/problems/make-the-string-great/description/ Leetcode - Make The String Great 문제 유형 : 문자열 처리 문제 난이도 : Easy 문제 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
https://leetcode.com/problems/maximum-nesting-depth-of-the-parentheses/description/ Leetcode - Maximum Nesting Depth of the Paretheses 문제 유형 : 문자열 처리, 스택 문제 난이도 : Easy 문제 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 AB (A concatenated with B), where A and B are ..
https://leetcode.com/problems/word-search/description/ Leetcode - Word Search 문제 유형 : 문자열 처리, dfs, 백트래킹 문제 난이도 : Medium 문제 Given an m x n grid of characters board and a string word, return true if word exists in the grid. The word can be constructed from letters of sequentially adjacent cells, where adjacent cells are horizontally or vertically neighboring. The same letter cell may not be used m..
https://leetcode.com/problems/isomorphic-strings/description/ Leetcode - Isomorphic Strings 문제 유형 : 해시 / 문자열 처리 문제 난이도 : Easy 문제 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 order of characters. No two char..
![](http://i1.daumcdn.net/thumb/C150x150/?fname=https://blog.kakaocdn.net/dn/bVhmFd/btsGdSuDBab/6jZwn2HRRzNaFcwKOqucr0/img.png)
https://leetcode.com/problems/count-subarrays-with-fixed-bounds/description/ LeetCode - Count Subarrays With Fixed Bounds 문제 유형 : 슬라이딩 윈도우 문제 난이도 : Hard 문제 You are given an integer array nums and two integers minK and maxK. A fixed-bound subarray of nums is a subarray that satisfies the following conditions: The minimum value in the subarray is equal to minK. The maximum value in the subarray is..
https://leetcode.com/problems/subarrays-with-k-different-integers/ Leetcode - Subarrays with K Different Integers 문제 유형 : 슬라이딩 윈도우 / 해시 문제 난이도 : Hard 문제 Given an integer array nums and an integer k, return the number of good subarrays of nums. A good array is an array where the number of different integers in that array is exactly k. For example, [1,2,3,1,2] has 3 different integers: 1, 2, and 3..
https://leetcode.com/problems/count-subarrays-where-max-element-appears-at-least-k-times/description/ Leetcode - Count Subarrays Where Max Element Apperas at Least K Times 문제 유형 : 슬라이딩 윈도우 문제 난이도 : Medium 문제 You are given an integer array nums and a positive integer k. Return the number of subarrays where the maximum element of nums appears at least k times in that subarray. A subarray is a cont..
https://school.programmers.co.kr/learn/courses/30/lessons/43163 프로그래머스 코드 중심의 개발자 채용. 스택 기반의 포지션 매칭. 프로그래머스의 개발자 맞춤형 프로필을 등록하고, 나와 기술 궁합이 잘 맞는 기업들을 매칭 받으세요. programmers.co.kr 프로그래머스 - 단어 변환 문제 유형 : DFS/BFS 문제 난이도 : Level 3 문제 두 개의 단어 begin, target과 단어의 집합 words가 있습니다. 아래와 같은 규칙을 이용하여 begin에서 target으로 변환하는 가장 짧은 변환 과정을 찾으려고 합니다. 1. 한 번에 한 개의 알파벳만 바꿀 수 있습니다. 2. words에 있는 단어로만 변환할 수 있습니다. 예를 들어 beg..