sji

https://leetcode.com/problems/longest-common-subsequence/ Longest Common Subsequence - 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 95%!!! 376ms class Solution: def longestCommonSubsequence(self, text1: str, text2: str) -> int: dp = [] for r in range(len(text1)+1): dp.append([0]..

https://leetcode.com/problems/longest-continuous-increasing-subsequence/ Longest Continuous Increasing Subsequence - 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 80ms class Solution: def findLengthOfLCIS(self, nums: List[int]) -> int: if not nums: return 0 ret = 1 cur = 1 prev =..

https://leetcode.com/problems/number-of-dice-rolls-with-target-sum/ Number of Dice Rolls With Target Sum - 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 tweaked target sum 456ms class Solution: def numRollsToTarget(self, d: int, f: int, target: int) -> int: dp = [0] * (target + 1..

https://leetcode.com/problems/longest-increasing-subsequence/ Longest Increasing Subsequence - 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 윽 어려웠다! 어레이가 주어졌을 때 증가하는 수열로만 이루어지면서 가장 긴 subseq를 찾는 문제다. 처음엔 정렬하고나서 인덱스로 뭐 어떻게 해보면 되지 않을까 생각해봤는데, 정렬하고 나서도 결국 증가하는 인덱스로만 이루어진 배열을 찾아야되서 결국..

https://leetcode.com/problems/increasing-triplet-subsequence/ Increasing Triplet Subsequence - 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 find increasing triplet sequence a < b < c a_i < b_i < c_i idea: moving minimum!!!!!! class Solution: def increasingTriplet(self, nums: Lis..

https://leetcode.com/problems/matchsticks-to-square/ Matchsticks to Square - 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 2200ms !!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!! import collections from functools import lru_cache class Solution: def makesquare(self, nums: List[int]) -> bool: i..

https://leetcode.com/problems/implement-magic-dictionary/ Implement Magic Dictionary - 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 check whether the word made by flipping one charater of given word exists in the dictionary 500ms (Terrible solution) class TreeNode: def __init__(..

NATS에 대해서... 서브 프로젝트에서 NATS(넷츠)라는 메시지 큐를 사용하게 되었다. https://docs.nats.io/nats-concepts/intro What is NATS docs.nats.io 프로젝트의 메인 언어인 Golang으로 구현이 되어있고, 다양한 언어로 작성가능한 클라이언트 라이브러리를 지원하고 있으며, 무엇보다 사용이 간편, 가볍고, 설정이 쉬운 장점이 있어 쓰기로 했다. 기본적으로 Pub/Sub 구조를 지원하며, 데이터는 인코드 되어 전송되고, 받은 메시지는 디코드되어 처리된다. NATS의 기본 코어는 'at most once' QoS를 지원한다는 것을 기억해야한다. subscriber가 특정 subject(topic)을 구독하고 있지 않다면, 메시지를 받을 수 없다. N..