Algorithm (2139) 썸네일형 리스트형 (C++) - LeetCode (easy) 530. Minimum Absolute Difference in BST https://leetcode.com/problems/minimum-absolute-difference-in-bst/description/ Minimum Absolute Difference in BST - LeetCode Can you solve this real interview question? Minimum Absolute Difference in BST - Given the root of a Binary Search Tree (BST), return the minimum absolute difference between the values of any two different nodes in the tree. Example 1: [https://assets.l leetcode.com tree 순회.. (C++) - LeetCode (easy) 521. Longest Uncommon Subsequence I https://leetcode.com/problems/longest-uncommon-subsequence-i/description/ Longest Uncommon Subsequence I - LeetCode Can you solve this real interview question? Longest Uncommon Subsequence I - Given two strings a and b, return the length of the longest uncommon subsequence between a and b. If the longest uncommon subsequence does not exist, return -1. An uncommon subseq leetcode.com 문자열 문제였습니다. .. (C++) - LeetCode (easy) 520. Detect Capital https://leetcode.com/problems/detect-capital/ Detect Capital - LeetCode Can you solve this real interview question? Detect Capital - We define the usage of capitals in a word to be right when one of the following cases holds: * All letters in this word are capitals, like "USA". * All letters in this word are not capitals, like leetcode.com 전수조사 문제였습니다. 📕 풀이방법 📔 풀이과정 모두 대문자거나, 모두 소문자거나, 처음만 대문자인 .. (C++) - LeetCode (easy) 509. Fibonacci Number https://leetcode.com/problems/fibonacci-number/description/ Fibonacci Number - LeetCode Can you solve this real interview question? Fibonacci Number - The Fibonacci numbers, commonly denoted F(n) form a sequence, called the Fibonacci sequence, such that each number is the sum of the two preceding ones, starting from 0 and 1. That is, F(0) = 0 leetcode.com top down dp로 해결한 문제였습니다. 📕 풀이방법 📔 입력 및 초.. (C++) - LeetCode (easy) 507. Perfect Number https://leetcode.com/problems/perfect-number/description/ Perfect Number - LeetCode Can you solve this real interview question? Perfect Number - A perfect number [https://en.wikipedia.org/wiki/Perfect_number] is a positive integer that is equal to the sum of its positive divisors, excluding the number itself. A divisor of an integer x is leetcode.com 전수조사 문제였습니다. 📕 풀이방법 📔 입력 및 초기화 제한이 1천만이므로 O(n.. (C++) - LeetCode (easy) 506. Relative Ranks https://leetcode.com/problems/relative-ranks/description/ Relative Ranks - LeetCode Can you solve this real interview question? Relative Ranks - You are given an integer array score of size n, where score[i] is the score of the ith athlete in a competition. All the scores are guaranteed to be unique. The athletes are placed based on their leetcode.com 자료구조 문제였습니다. 📕 풀이방법 📔 입력 및 초기화 1. 정답 vector .. (C++) - LeetCode (easy) 504. Base 7 https://leetcode.com/problems/base-7/description/ Base 7 - LeetCode Can you solve this real interview question? Base 7 - Given an integer num, return a string of its base 7 representation. Example 1: Input: num = 100 Output: "202" Example 2: Input: num = -7 Output: "-10" Constraints: * -107 (C++) - LeetCode (easy) 500. Keyboard Row https://leetcode.com/problems/find-mode-in-binary-search-tree/description/ Find Mode in Binary Search Tree - LeetCode Can you solve this real interview question? Find Mode in Binary Search Tree - Given the root of a binary search tree (BST) with duplicates, return all the mode(s) [https://en.wikipedia.org/wiki/Mode_(statistics)] (i.e., the most frequently occurred element leetcode.com tree 순회 문제.. 이전 1 ··· 71 72 73 74 75 76 77 ··· 268 다음