[LeetCode/Kotlin]Easy - 938. Range Sum of BST Range Sum of BST - LeetCode Can you solve this real interview question? Range Sum of BST - Given the root node of a binary search tree and two integers low and high, return the sum of values of all nodes with a value in the inclusive range [low, high]. Example 1: [https://assets.l leetcode.com 문제 Given the root node of a binary search tree and two in..

[LeetCode/Kotlin]Easy - 70. Climbing Stairs Climbing Stairs - LeetCode Can you solve this real interview question? Climbing Stairs - You are climbing a staircase. It takes n steps to reach the top. Each time you can either climb 1 or 2 steps. In how many distinct ways can you climb to the top? Example 1: Input: n = 2 Outpu leetcode.com 문제 You are climbing a staircase. It takes n steps to reach t..

[LeetCode/Kotlin]Easy - 2016. Maximum Difference Between Increasing Elements Maximum Difference Between Increasing Elements - LeetCode Can you solve this real interview question? Maximum Difference Between Increasing Elements - Given a 0-indexed integer array nums of size n, find the maximum difference between nums[i] and nums[j] (i.e., nums[j] - nums[i]), such that 0

[LeetCode/Kotlin]Easy - 404. Sum of Left Leaves Sum of Left Leaves - LeetCode Can you solve this real interview question? Sum of Left Leaves - Given the root of a binary tree, return the sum of all left leaves. A leaf is a node with no children. A left leaf is a leaf that is the left child of another node. Example 1: [https://ass leetcode.com 문제 Given the root of a binary tree, return the sum of..

Best Time to Buy and Sell Stock - LeetCode Can you solve this real interview question? Best Time to Buy and Sell Stock - You are given an array prices where prices[i] is the price of a given stock on the ith day. You want to maximize your profit by choosing a single day to buy one stock and choosin leetcode.com 문제 You are given an array prices where prices[i] is the price of a given stock on the..

Valid Parentheses - LeetCode Can you solve this real interview question? Valid Parentheses - Given a string s containing just the characters '(', ')', '{', '}', '[' and ']', determine if the input string is valid. An input string is valid if: 1. Open brackets must be closed by the sam leetcode.com 문제 Given a string s containing just the characters '(', ')', '{', '}', '[' and ']', determine if th..