레벨업 일지

문제 https://leetcode.com/problems/range-sum-query-mutable/ Range Sum Query - Mutable - LeetCode Can you solve this real interview question? Range Sum Query - Mutable - Given an integer array nums, handle multiple queries of the following types: 1. Update the value of an element in nums. 2. Calculate the sum of the elements of nums between indices lef leetcode.com 알아야 할 개념 세그먼트 트리 풀이 풀이 알고리즘은 다음과 ..

문제 https://leetcode.com/problems/3sum-smaller/description/ 3Sum Smaller - LeetCode 3Sum Smaller - 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 Given an array of n integers nums and an integer target, find the number of index triplets i, j, k with 0 int: nums.sort() ans = 0 for i in range..

문제 가장 최대가 되는 연속 부분합 구하기 https://leetcode.com/problems/maximum-subarray/description/ Maximum Subarray - LeetCode Maximum Subarray - Given an integer array nums, find the subarray with the largest sum, and return its sum. Example 1: Input: nums = [-2,1,-3,4,-1,2,1,-5,4] Output: 6 Explanation: The subarray [4,-1,2,1] has the largest sum 6. Example 2: Input: nums = [ leetcode.com 풀이 연속 부분합 이라 함은 [ 0..