전체 글

성장일기
알고리즘/자료구조

[LeetCode] 209. Minimum Size Subarray Sum - Java

Minimum Size Subarray Sum - LeetCode Can you solve this real interview question? Minimum Size Subarray Sum - Given an array of positive integers nums and a positive integer target, return the minimal length of a subarray whose sum is greater than or equal to target. If there is no such subarr leetcode.com 문제 더보기 Given an array of positive integers nums and a positive integer target, return the m..

카테고리 없음

[LeetCode] 167. Two Sum II - Input Array Is Sorted - Java

Two Sum II - Input Array Is Sorted - LeetCode Can you solve this real interview question? Two Sum II - Input Array Is Sorted - Given a 1-indexed array of integers numbers that is already sorted in non-decreasing order, find two numbers such that they add up to a specific target number. Let these two n leetcode.com 문제 더보기 Given a 1-indexed array of integers numbers that is already sorted in non-d..

알고리즘/자료구조

[LeetCode] 125. Valid Palindrome - Java

Valid Palindrome - LeetCode Can you solve this real interview question? Valid Palindrome - A phrase is a palindrome if, after converting all uppercase letters into lowercase letters and removing all non-alphanumeric characters, it reads the same forward and backward. Alphanumeric cha leetcode.com 문제 더보기 A phrase is a palindrome if, after converting all uppercase letters into lowercase letters an..

알고리즘/자료구조

[LeetCode] 189. Rotate Array - Java

Rotate Array - LeetCode Can you solve this real interview question? Rotate Array - Given an integer array nums, rotate the array to the right by k steps, where k is non-negative. Example 1: Input: nums = [1,2,3,4,5,6,7], k = 3 Output: [5,6,7,1,2,3,4] Explanation: rotate 1 step leetcode.com 문제 더보기 Given an integer array nums, rotate the array to the right by k steps, where k is non-negative. Exam..

알고리즘/자료구조

[LeetCode] 55. Jump Game - Java

Jump Game - LeetCode Can you solve this real interview question? Jump Game - You are given an integer array nums. You are initially positioned at the array's first index, and each element in the array represents your maximum jump length at that position. Return true if you can leetcode.com 문제 더보기 You are given an integer array nums. You are initially positioned at the array's first index, and ea..

jny0
J N Y 0