LeetCode

[리트코드] 809. Expressive Words / Javascript

문제주소 : https://leetcode.com/problems/expressive-words/ Expressive Words - LeetCode 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 더보기 Sometimes people repeat letters to represent extra feeling. For example: "hello" -> "heeellooo" "hi" -> "hiiii" In these strings like "heeellooo", we have g..

[리트코드] 11. Container With Most Water / Javascript

문제주소 :https://leetcode.com/problems/container-with-most-water/ Container With Most Water - LeetCode 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 n non-negative integers a1, a2, ..., an , where each represents a point at coordinate (i, ai). n vertical lines are drawn such that t..

[리트코드] 967. Numbers With Same Consecutive Differences / Javascript

문제주소 : https://leetcode.com/problems/numbers-with-same-consecutive-differences/ Numbers With Same Consecutive Differences - LeetCode 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 더보기 Return all non-negative integers of length n such that the absolute difference between every two consecuti..

[리트코드] 1306. Jump Game III / Javascript

문제주소 :https://leetcode.com/problems/jump-game-iii/ Jump Game III - LeetCode 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 더보기 1306. Jump Game III Medium 165342Add to ListShare Given an array of non-negative integers arr, you are initially positioned at start index of the array. When you a..

[리트코드] 45. Jump Game II / Javascript

문제주소 :https://leetcode.com/problems/jump-game-ii/ 더보기 45. Jump Game II Medium 5835222Add to ListShare Given an array of non-negative integers nums, you are initially positioned at the first index of the array. Each element in the array represents your maximum jump length at that position. Your goal is to reach the last index in the minimum number of jumps. You can assume that you can always reac..

[리트코드] 336. Palindrome Pairs / Javascript

문제주소 : https://leetcode.com/problems/palindrome-pairs/ Palindrome Pairs - LeetCode 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 a list of unique words, return all the pairs of the distinct indices (i, j) in the given list, so that the concatenation of the two words words[i] + w..

[리트코드] 5. Longest Palindromic Substring / Javascript

문제주소 : https://leetcode.com/problems/longest-palindromic-substring/ Longest Palindromic Substring - LeetCode 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 a string s, return the longest palindromic substring in s. Example 1: Input: s = "babad" Output: "bab" Note: "aba" is also a..

[리트코드] 2. Add Two Numbers / Javascript

문제주소 :https://leetcode.com/problems/add-two-numbers/ Add Two Numbers - LeetCode 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 더보기 You are given two non-empty linked lists representing two non-negative integers. The digits are stored in reverse order, and each of their nodes contains a sin..

[리트코드] 1130. Minimum Cost Tree From Leaf Values / Javascript

문제주소 : https://leetcode.com/problems/minimum-cost-tree-from-leaf-values/ Minimum Cost Tree From Leaf Values - LeetCode 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 arr of positive integers, consider all binary trees such that: Each node has either 0 or 2 children; The ..

[리트코드] 1647. Minimum Deletions to Make Character Frequencies Unique / Javascript

문제주소 :https://leetcode.com/problems/minimum-deletions-to-make-character-frequencies-unique/ Minimum Deletions to Make Character Frequencies Unique - LeetCode 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 더보기 A string s is called good if there are no two different characters in s that have..