넘치게 채우기

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 문제 유형 : 투 포인터, 슬라이딩 윈도우 문제 난이도 ..

https://leetcode.com/problems/number-of-subsequences-that-satisfy-the-given-sum-condition/ Number of Subsequences That Satisfy the Given Sum Condition - LeetCode Can you solve this real interview question? Number of Subsequences That Satisfy the Given Sum Condition - You are given an array of integers nums and an integer target. Return the number of non-empty subsequences of nums such that the s..

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