Coding Test/LeetCode15 [LeetCode] Two Sum https://leetcode.com/problems/two-sum/ class Solution {public: vector twoSum(vector& nums, int target) { unordered_map m; for (int i = 0; i GitHub : https://github.com/developeSHG/Algorithm-LeetCode/commit/0cfd8d69436f395f4246fdac3f9c019f161802fc Time: 4 ms (66.69%), Space: 14.4 MB (20.56%) - LeetHub · developeSHG/Algorithm-LeetCode@0cfd8d6developeSHG committed Oct 29, 2.. 2024. 10. 29. [LeetCode] (Strings) Lv Easy. First Unique Character in a String https://leetcode.com/explore/interview/card/top-interview-questions-easy/127/strings/881/ Explore - LeetCode LeetCode Explore is the best place for everyone to start practicing and learning on LeetCode. No matter if you are a beginner or a master, there are always new topics waiting for you to explore. leetcode.com /** * @param {string} s * @return {number} */ var firstUniqChar = function (s) { .. 2023. 2. 6. [LeetCode] (Array) Lv Easy. Contains Duplicate https://leetcode.com/explore/interview/card/top-interview-questions-easy/92/array/578/ Explore - LeetCode LeetCode Explore is the best place for everyone to start practicing and learning on LeetCode. No matter if you are a beginner or a master, there are always new topics waiting for you to explore. leetcode.com /** * @param {number[]} nums * @return {boolean} */ var containsDuplicate = function.. 2023. 2. 6. [LeetCode] (Array) Lv Easy. Rotate Array https://leetcode.com/explore/interview/card/top-interview-questions-easy/92/array/646/ Explore - LeetCode LeetCode Explore is the best place for everyone to start practicing and learning on LeetCode. No matter if you are a beginner or a master, there are always new topics waiting for you to explore. leetcode.com /** * @param {number[]} nums * @param {number} k * @return {void} Do not return anyt.. 2023. 1. 31. [LeetCode] (Design) Lv Easy. Shuffle an Array https://leetcode.com/explore/interview/card/top-interview-questions-easy/98/design/670/ Explore - LeetCode LeetCode Explore is the best place for everyone to start practicing and learning on LeetCode. No matter if you are a beginner or a master, there are always new topics waiting for you to explore. leetcode.com /** * @param {number[]} nums */ var Solution = function(nums) { this.original = [.... 2023. 1. 25. [LeetCode] (Math) Lv Easy. Fizz Buzz https://leetcode.com/explore/interview/card/top-interview-questions-easy/102/math/743/ Explore - LeetCode LeetCode Explore is the best place for everyone to start practicing and learning on LeetCode. No matter if you are a beginner or a master, there are always new topics waiting for you to explore. leetcode.com /** * @param {number} n * @return {string[]} */ function fizzBuzz(n) { let answer = .. 2023. 1. 22. [LeetCode] (Dynamic Programming) Lv Easy. Climbing Stairs https://leetcode.com/explore/interview/card/top-interview-questions-easy/97/dynamic-programming/569/ Explore - LeetCode LeetCode Explore is the best place for everyone to start practicing and learning on LeetCode. No matter if you are a beginner or a master, there are always new topics waiting for you to explore. leetcode.com /** * @param {number} n * @return {number} */ var climbStairs = functi.. 2023. 1. 22. [LeetCode] (Sorting and Searching) Lv Easy. First Bad Version https://leetcode.com/explore/interview/card/top-interview-questions-easy/96/sorting-and-searching/774/ Explore - LeetCode LeetCode Explore is the best place for everyone to start practicing and learning on LeetCode. No matter if you are a beginner or a master, there are always new topics waiting for you to explore. leetcode.com /** * Definition for isBadVersion() * * @param {integer} version num.. 2023. 1. 22. [LeetCode] (Sorting and Searching) Lv Easy. Merge Sorted Array https://leetcode.com/explore/interview/card/top-interview-questions-easy/96/sorting-and-searching/587/ Explore - LeetCode LeetCode Explore is the best place for everyone to start practicing and learning on LeetCode. No matter if you are a beginner or a master, there are always new topics waiting for you to explore. leetcode.com /** * @param {number[]} nums1 * @param {number} m * @param {number[].. 2023. 1. 22. [LeetCode] (Trees) Lv Easy. Maximum Depth of Binary Tree https://leetcode.com/explore/interview/card/top-interview-questions-easy/94/trees/555/ Explore - LeetCode LeetCode Explore is the best place for everyone to start practicing and learning on LeetCode. No matter if you are a beginner or a master, there are always new topics waiting for you to explore. leetcode.com /** * Definition for a binary tree node. * function TreeNode(val, left, right) { * t.. 2023. 1. 21. 이전 1 2 다음