레벨업 일지

https://leetcode.com/problems/longest-increasing-subsequence/ Longest Increasing Subsequence - LeetCode Longest Increasing Subsequence - Given an integer array nums, return the length of the longest strictly increasing subsequence. Example 1: Input: nums = [10,9,2,5,3,7,101,18] Output: 4 Explanation: The longest increasing subsequence is [2,3,7,101], ther leetcode.com 문제 가장 최장으로 증가하는 부분 수열의 길이를 ..

Frequency of the Most Frequent Element - LeetCode Frequency of the Most Frequent Element - LeetCode Frequency of the Most Frequent Element - The frequency of an element is the number of times it occurs in an array. You are given an integer array nums and an integer k. In one operation, you can choose an index of nums and increment the element at that ind 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..