0 (102) 썸네일형 리스트형 Ethereum Scaling Overview The main goal of scalability is to increase transaction speed, and transaction throughput, without sacrificing decentralization or security. On-Chain Scaling It requires changes to the Ethereum protocol. Sharding is currently the main focus for it. Sharding : the process of splitting a database horizontally to spread the load. It will reduce network congestion and increase TPS by creati.. Which RENDERING strategy should we take on the Web? 🤔 Background As a part of React migration, I want to know what benefits we can take from SSR and CSR. Rendering Server rendering: generates the full HTML for a page in the server. 👍 A fast FP, FCP, and TTI 👍 Avoid waiting for CPU-bound JS processing time 👎 Generating pages on the server takes time, it results in a slower TTFB 👎 Client can't still avoid third-party JS processing time Content-heavy .. 재밌는 스마트 컨트랙트, NFT 튜토리얼 NFT와 가상 화폐 시장이 다시 핫해지면서 멀어졌던 블록체인에 대한 관심이 다시 슬금슬금 올라오고 있었던 중에 친구에게 재미난 튜토리얼을 추천받았다. buildspace라는 곳에서 만든 것들인데 가입 절차도 간단하고 기술적인 쪽에 치우쳐진 튜토리얼이라기보다는 친구랑 대화하는 느낌으로 대략적인 개념들을 설명해주는 튜토리얼들이다. 하루 4시간 정도면 완료할 수 있으니 부담도 별로 없다! https://buildspace.so/ buildspace Start building cool web3 projects, earn NFTs, access secret work opportunities in crypto. buildspace.so 53. Maximum Subarray 풀이 leetcode.com/problems/maximum-subarray/ Maximum Subarray - 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 # Greedy class Solution: def maxSubArray(self, nums: List[int]) -> int: if not nums : return 0 curr_max = output = nums[0] for i in range(1, len(nums)) : curr_max = max(curr_m.. 139. Word Break 풀이 leetcode.com/problems/word-break/ Word Break - 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 class Solution: def wordBreak(self, s: str, wordDict: List[str]) -> bool: if not s or not wordDict : return False words = set(wordDict) n = len(s) dp = [False]*(n+1) dp[0] = True for end .. 5. Longest Palindromic Substring 풀이 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 문제 : 가장 긴 palindromic 한 문자열을 리턴하는 것. 풀이 : 첫 번째는 인덱스를 하나하나 늘려가면서 왼쪽과 오른쪽으로 expanding 해 나가는 방법이 있다. 이때 주의해야 할 점은 palindrome의 길이가 홀수인지 짝수인지 알 수 없기 때문에 두.. [October LeetCoding Challenge] 29th - Maximize Distance to Closest Person leetcode.com/explore/challenge/card/october-leetcoding-challenge/563/week-5-october-29th-october-31st/3512/ 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 class Solution: def maxDistToClosest(self, seats: List[int]) ->.. 398. Random Pick Index leetcode.com/problems/random-pick-index/ Random Pick Index - 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 class Solution: def __init__(self, nums: List[int]): self.nums = nums def pick(self, target: int) -> int: output = 0 count = 0 for i, x in enumerate(self.nums) : if x != tar.. 이전 1 2 3 4 ··· 13 다음