넘치게 채우기

https://leetcode.com/problems/minimum-swaps-to-group-all-1s-together-ii/description/?envType=daily-question&envId=2024-08-02leetcode - Minimum Swaps to Group All 1's Together II문제 유형 : 슬라이딩 윈도우문제 난이도 : Medium 문제A swap is defined as taking two distinct positions in an array and swapping the values in them.A circular array is defined as an array where we consider the first element and the last ele..

https://leetcode.com/problems/maximum-score-from-removing-substrings/leetcode - Maximum Score From Removing Substrings문제 유형 : 그리디, 스택, 슬라이딩 윈도우 문제 난이도 : Medium 문제You are given a string s and two integers x and y. You can perform two types of operations any number of times. Remove substring "ab" and gain x points. For example, when removing "ab" from "cabxbae" it becomes "cxbae". Remove substring..

https://leetcode.com/problems/find-the-minimum-and-maximum-number-of-nodes-between-critical-points/description/leetcode - Find the Minimum and Maximum Number of Nodes Between Critical Points문제 유형 : 연결리스트, 슬라이딩 윈도우문제 난이도 : Medium 문제A critical point in a linked list is defined as either a local maxima or a local minima.A node is a local maxima if the current node has a value strictly greater than ..

https://leetcode.com/problems/minimum-difference-between-largest-and-smallest-value-in-three-moves/description/leetcode - Minimum Difference Between Largest and Smallest Value in Three Moves문제 유형 : 그리디, 정렬, 슬라이딩 윈도우문제 난이도 : Medium 문제You are given an integer array nums.In one move, you can choose one element of nums and change it to any value.Return the minimum difference between the largest and ..

https://leetcode.com/problems/compare-version-numbers/description/leetcode - Compare Version Numbers문제 유형 : 문자열 처리, 투 포인터, 슬라이딩 윈도우문제 난이도 : Medium 문제Given two version numbers, version1 and version2, compare them.Version numbers consist of one or more revisions joined by a dot '.'. Each revision consists of digits and may contain leading zeros. Every revision contains at least one character. Revi..

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://leetcode.com/problems/subarray-product-less-than-k/description/ Leetcode - Subarray Product Less Than K 문제 유형 : 슬라이딩 윈도우 문제 난이도 : Medium 문제 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. 정수 배열 nums와 정수 k가 주어진다. 전체 곱이 k보다 작은 부분배열들의 개수를 구하시오. 풀이 슬라이딩 윈도우를 이용하여 풀어주면 된다..

https://leetcode.com/problems/minimum-window-substring/description/?envType=daily-question&envId=2024-02-04 LeetCode - The World's Leading Online Programming Learning Platform Level up your coding skills and quickly land a job. This is the best place to expand your knowledge and get prepared for your next interview. leetcode.com Leetcode - Minimum Window Substring 문제 유형 : 투 포인터, 슬라이딩 윈도우 문제 난이도 ..

투 포인터 말 그대로 두개의 포인터를 사용하는 알고리즘이다. (left, right), (start, end)처럼 주로 이름을 붙인다. 슬라이딩 윈도우 투 포인터와 비슷하나, 두 포인터간의 간격이 일정하다.