[Kaggle] Argania Tree Deforestation Detection (2)
ยท
๐Ÿƒ Routine
https://bnmy6581.tistory.com/118 [Kaggle] Argania Tree Deforestation Detection (1) - EDA https://en.wikipedia.org/wiki/Argania Argania - Wikipedia From Wikipedia, the free encyclopedia Genus of trees Argania (Tashelhit: โดฐโต”โดณโดฐโต Argan) is a genus of flowering plants containing the sole species Argania spinosa, known as argan, a tree end bnmy6581.tistory.com Feature Importance (remove B12, B9, B1, B..
[leetcode-121] Best Time to Buy and Sell Stock
ยท
๐Ÿข One step
LeetCode-121 Best Time to Buy and Sell Stock : ์‹ธ๊ฒŒ ์‚ฌ์„œ ๋น„์‹ธ๊ฒŒ ํŒ”์•„๋ผ! note : max(profit)myAnswer :::python class Solution: def maxProfit(self, prices: List[int]) -> int: len_prices = len(prices) if len_prices
[leetcode-238] Product of Array Except Self
ยท
๐Ÿข One step
LeetCode-238 Product of Array Except Self : Given an integer array nums, return an array answer such that answer[i] is equal to the product of all the elements of nums except nums[i]. note : Follow up: Can you solve the problem in O(1) extra space complexity? (The output array does not count as extra space for space complexity analysis.)Answer :::python class Solution: def productExceptSelf(self..
[leetcode-561] Array Partition
ยท
๐Ÿข One step
LeetCode-561 Array Partition : find maximum (minimum list) note : len(list) = 2nmyAnswer :::python class Solution: def arrayPairSum(self, nums: List[int]) -> int: nums.sort() return sum(nums[::2]) Result : 267ms Memory: 16.7mb
[Whisper] (1) - Abstract & Introduction
ยท
๐Ÿ‘พ Deep Learning
https://github.com/openai/whisper GitHub - openai/whisper: Robust Speech Recognition via Large-Scale Weak Supervision Robust Speech Recognition via Large-Scale Weak Supervision - GitHub - openai/whisper: Robust Speech Recognition via Large-Scale Weak Supervision github.com Paper Review Abstract & Introduction 680,000 ์‹œ๊ฐ„์˜ ๋‹ค๊ตญ์–ด ํ•™์Šต์„ ์ง„ํ–‰ ์‹œ fine-tuning ์—†์ด zero-shot transfer benchmark ์ˆ˜์ค€์˜ ๊ฒฐ๊ณผ๋ฅผ ์–ป์„ ์ˆ˜ ์žˆ๋‹ค. ..
[leetcode-15] Three Sum
ยท
๐Ÿข One step
LeetCode-15 Match Three sum : Notice that the solution set must not contain duplicate triplets. note : myAnswerMyAnswer(Time Limit Exceeded) O(n^2) :::python class Solution: def threeSum(self, nums: List[int]) -> List[List[int]]: a = [] nums.sort() for i, n in enumerate(nums): d = {} for j in range(i+1,len(nums)): complete = - (n + nums[j]) if complete in d: if sorted([n, nums[j], complete]) not..
๋‹คํ–ˆ๋‹ค
B's