코딩 테스트14 231021 LeetCode 문제 풀이 (트리, 투 포인터?) 1425. Constrained Subsequence Sum https://leetcode.com/problems/constrained-subsequence-sum/?envType=daily-question&envId=2023-10-21 1) 문제 설명 Given an integer array nums and an integer k, return the maximum sum of a non-empty subsequence of that array such that for every two consecutive integers in the subsequence, nums[i] and nums[j], where i < j, the condition j - i 2023. 10. 21. 231020 LeetCode 문제 풀이 (스택) 844. Backspace String Compare https://leetcode.com/problems/backspace-string-compare/description/?envType=daily-question&envId=2023-10-19 1) 문제 설명 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 text will continue empty. 2) 제한 사항 1 2023. 10. 20. 이전 1 2 3 다음
