Algorithms

Merge two sorted linked lists and return it as a new sorted list. The new list should be made by splicing together the nodes of the first two lists.

Did not run b/c:Didn't realize that the subtractions only happen once. Knowing this fact, new solution:Runtime: 8 ms, faster than 14.17% of Java onlin

Runtime: 1 ms, faster than 97.43% of Java online submissions for Best Time to Buy and Sell Stock.Memory Usage: 38.9 MB, less than 26.28% of Java onlin

난독이 찐으로 온 좌,,믿기지 않는 난이도의 문제로 오예하는데,,짧은 꿈이라도 행복했읍니다....너무 달콤한 꿈은 꿈이 아닌걸로^^unsigned value로 생각 안해서 실패ㅠㅠㅠㅠㅠ 이거 생각보다 빡쎄서 슬프네요Integer.toBinaryString 으로 해결.구

Initially, didn't think about the ordering.1 - 12 - (11) (2)3 - (111) (12) (21)4 - (1111) (121) (211) (112) (22)대박….!Runtime: 0 ms, faster than 100.00

Using recursion.Floyd's Cycle-Finding Algorithm사람들이 미쳤어요..^^

재귀 죽이고 싶은 나,, 정상인가요

Runtime: 0 ms, faster than 100.00% of Java online submissions for Maximum Subarray.Memory Usage: 39 MB, less than 50.44% of Java online submissions fo

Runtime: 0 ms, faster than 100.00% of Java online submissions for Plus One.Memory Usage: 37.5 MB, less than 41.91% of Java online submissions for Plus

Runtime: 0 ms, faster than 100.00% of Java online submissions for Count and Say.Memory Usage: 36.9 MB, less than 79.98% of Java online submissions for

Find recursive relationRecursive (top-down)Recursive + memo (top-down)Iterative + memo (bottom-up)Iterative + N variables (bottom-up)

Runtime: 0 ms, faster than 100.00% of Java online submissions for House Robber.Memory Usage: 36.7 MB, less than 14.11% of Java online submissions for

Runtime: 2 ms, faster than 23.32% of Java online submissions for Valid Parentheses.Memory Usage: 37.4 MB, less than 20.24% of Java online submissions

중간값 고려 xRuntime: 3 ms, faster than 24.98% of Java online submissions for Palindrome Linked List.Memory Usage: 43 MB, less than 23.25% of Java online s

Runtime: 0 ms, faster than 100.00% of Java online submissions for Factorial Trailing Zeroes.Memory Usage: 35.8 MB, less than 76.82% of Java online sub

Runtime: 0 ms, faster than 100.00% of Java online submissions for Longest Common Prefix.Memory Usage: 36.9 MB, less than 90.83% of Java online submiss

Runtime: 0 ms, faster than 100.00% of Java online submissions for Implement strStr().Memory Usage: 38.8 MB, less than 38.46% of Java online submission

Attempt 1: TIme LImit Exceeded

...^^솔루션 실화냐?뭔소린지 1도 모르겠다...^^

Runtime: 1 ms, faster than 100.00% of Java online submissions for Reverse Integer.Memory Usage: 36.1 MB, less than 68.85% of Java online submissions f

Two Sumtestcase는 통과했지만 실전은 통과 못했다는점~Best Time to Buy and Sell StockRuntime: 1 ms, faster than 97.54% of Java online submissions for Best Time to Buy a

Gotta work on backtracking!Runtime: 1 ms, faster than 82.37% of Java online submissions for Generate Parentheses.Memory Usage: 38.8 MB, less than 98.0

Inorder, Postorder, Preorder 공부하기!코드로 어떻게 짜는지! 공부하기! Runtime: 0 ms, faster than 100.00% of Java online submissions for Binary Tree Inorder Traversal.M

코드 직접 짜보려고 했는데..시간이 없네요 ㅎ그리고 해본거 개망함^^

Runtime: 0 ms, faster than 100.00% of Java online submissions for Kth Smallest Element in a BST.Memory Usage: 39.3 MB, less than 34.14% of Java online

backtrackㅇㄹ 써야하는건 알았는데 어떻게 쓰는지 모르겠어서...^^ 답안을 봤다Runtime: 1 ms, faster than 59.97% of Java online submissions for Subsets.Memory Usage: 38.9 MB, less t

Runtime: 11 ms, faster than 41.06% of Java online submissions for Top K Frequent Elements.Memory Usage: 41.6 MB, less than 71.20% of Java online submi

Tranpose -> reverse 하면 되는 쉬운Runtime: 32 ms, faster than 81.59% of Python3 online submissions for Rotate Image.Memory Usage: 14.3 MB, less than 17.96%

for loop 3개....쓰려다가 말고 답지 봤읍니다 ㅠ숫자를 사용하는 clever방식...배우겠읍니다Runtime: 5 ms, faster than 98.83% of Java online submissions for Group Anagrams.Memory Usage

Runtime: 64 ms, faster than 69.15% of Python3 online submissions for Kth Largest Element in an Array.Memory Usage: 15.1 MB, less than 51.80% of Python

Runtime: 44 ms, faster than 56.34% of Python3 online submissions for Odd Even Linked List.Memory Usage: 16.3 MB, less than 52.52% of Python3 online su

Runtime: 2 ms, faster than 49.24% of Java online submissions for Find the Duplicate Number.Memory Usage: 40.2 MB, less than 16.10% of Java online subm

Runtime: 0 ms, faster than 100.00% of Java online submissions for Binary Tree Level Order Traversal.Memory Usage: 39.2 MB, less than 55.34% of Java on

Runtime: 0 ms, faster than 100.00% of Java online submissions for Game of Life.Memory Usage: 37.4 MB, less than 45.02% of Java online submissions for

Runtime error이거 너무 느린가봅니다 ㅠ 제일 쉬운 방법쓰...Runtime: 0 ms, faster than 100.00% of Java online submissions for Unique Paths.Memory Usage: 35.9 MB, less tha

자만하다가 큰 코 다쳤읍니다^^처음에 난독이 왔읍니다.엥? 이거 뭐야. 너무 쉬운 것 아닌가 ㅎㅎ 3초컷.Runtime: 18 ms, faster than 28.43% of Java online submissions for Kth Smallest Element in a

Time Limit Exceeded전씨 저와 같은 생각 했을거라고 믿읍니다^^혹시나 하는 마음에....해봤읍니다a + b + c + d = 0a + b = - (c + d) 를 이용하여 4중 for loop을 2중으로 바꾸기~Runtime: 59 ms, faster t

Runtime: 68 ms, faster than 59.60% of Python3 online submissions for Flatten Nested List Iterator.Memory Usage: 17.8 MB, less than 30.38% of Python3 o

Runtime: 272 ms, faster than 81.39% of Python3 online submissions for Shuffle an Array.Memory Usage: 19.5 MB, less than 18.75% of Python3 online submi

Runtime: 7 ms, faster than 77.33% of Java online submissions for Palindrome Partitioning.Memory Usage: 52.7 MB, less than 57.85% of Java online submis

Runtime: 30 ms, faster than 78.71% of Java online submissions for Implement Trie (Prefix Tree).Memory Usage: 48.9 MB, less than 63.08% of Java online

Runtime: 24 ms, faster than 93.47% of Python3 online submissions for Sum of Two Integers.Memory Usage: 14.1 MB, less than 64.14% of Python3 online sub

Runtime: 2 ms, faster than 84.31% of Java online submissions for Valid Sudoku.Memory Usage: 38.8 MB, less than 88.24% of Java online submissions for V

Runtime: 1 ms, faster than 98.01% of Java online submissions for Construct Binary Tree from Preorder and Inorder Traversal.Memory Usage: 39.1 MB, less

Runtime: 0 ms, faster than 100.00% of Java online submissions for Binary Tree Zigzag Level Order Traversal.Memory Usage: 39.8 MB, less than 6.09% of J

Runtime: 0 ms, faster than 100.00% of Java online submissions for Sort Colors. Memory Usage: 37.3 MB, less than 93.93% of Java online submissions for

Runtime: 7 ms, faster than 99.93% of Java online submissions for Insert Delete GetRandom O(1).Memory Usage: 43.8 MB, less than 73.72% of Java online s

Runtime: 1 ms, faster than 79.50% of Java online submissions for Letter Combinations of a Phone Number.Memory Usage: 38.4 MB, less than 65.46% of Java

Wrong Answer..117 / 588 test cases passed.Runtime: 32 ms, faster than 71.04% of Java online submissions for Perfect Squares.Memory Usage: 37.8 MB, les

Runtime: 1 ms, faster than 99.99% of Java online submissions for Number of Islands.Memory Usage: 41.7 MB, less than 40.66% of Java online submissions

Runtime: 0 ms, faster than 100.00% of Java online submissions for Populating Next Right Pointers in Each Node.Memory Usage: 38.9 MB, less than 90.44%

해보다가 현타와서.. 루션아~^^Runtime: 12 ms, faster than 8.60% of Java online submissions for Lowest Common Ancestor of a Binary Tree.Memory Usage: 45 MB, less t

난독이 왔읍니다..Runtime: 6 ms, faster than 33.00% of Java online submissions for Search a 2D Matrix II.Memory Usage: 44.1 MB, less than 97.06% of Java onlin

이렇게 이해했는데 이게 아니었던것..뭐여BacktrackingBacktracking DFSTopological Sort

Runtime: 0 ms, faster than 100.00% of Java online submissions for Find Peak Element.Memory Usage: 39.8 MB, less than 5.40% of Java online submissions

Backtracking을 쓴다고 생각했는데 아닌듯..Time limit exceededDynamic programming 을 쓴 n^2 solutionRuntime: 87 ms, faster than 12.88% of Java online submissions for

틀렸음루션이 하이루~^^Runtime: 1 ms, faster than 78.91% of Java online submissions for Longest Substring with At Least K Repeating Characters.Memory Usage: 38.

Runtime: 5 ms, faster than 69.17% of Java online submissions for Course Schedule II.Memory Usage: 39.6 MB, less than 96.70% of Java online submissions

Runtime: 0 ms, faster than 100.00% of Java online submissions for Gas Station.Memory Usage: 39 MB, less than 83.31% of Java online submissions for Gas

Runtime: 0 ms, faster than 100.00% of Java online submissions for Gas Station.Memory Usage: 39 MB, less than 83.31% of Java online submissions for Gas

Runtime: 0 ms, faster than 100.00% of Java online submissions for Increasing Triplet Subsequence.Memory Usage: 38.4 MB, less than 96.59% of Java onlin

Runtime: 80 ms, faster than 89.80% of Python3 online submissions for Merge Intervals.Memory Usage: 16.2 MB, less than 9.17% of Python3 online submissi

Runtime: 0 ms, faster than 100.00% of Java online submissions for Copy List with Random Pointer.Memory Usage: 42.9 MB, less than 6.97% of Java online

Runtime: 6 ms, faster than 23.34% of Java online submissions for Evaluate Reverse Polish Notation.Memory Usage: 41.4 MB, less than 5.88% of Java onlin

ㅈㄴ길게 썼는데...안된거 실환가요ㅠ차분하게..stack을 써봤는데 실패하고 루션이를 봣읍니다^^

Runtime: 20 ms, faster than 39.09% of Java online submissions for Coin Change.Memory Usage: 41.4 MB, less than 11.09% of Java online submissions for C

Runtime: 0 ms, faster than 100.00% of Java online submissions for Find First and Last Position of Element in Sorted Array.Memory Usage: 42.6 MB, less

아놔 빡쳐..다시 돌아왔을때 숫자가 겹칠수도 있다는 점ㅠㅠSpace를 O(n)으로 하면 쉬웠을텐데O(1)로 하려니깐 빡쎄네요 ㅠㅠ내가 생각한게 대충 이런건데 이건 겹칠때 서로 나눠줌Runtime: 0 ms, faster than 100.00% of Java online

Runtime: 6 ms, faster than 55.85% of Java online submissions for Word Search.Memory Usage: 40.2 MB, less than 85.97% of Java online submissions for Wo

Runtime: 0 ms, faster than 100.00% of Java online submissions for Remove Nth Node From End of List.Memory Usage: 36.7 MB, less than 95.29% of Java onl

Runtime: 0 ms, faster than 100.00% of Java online submissions for Search in Rotated Sorted Array.Memory Usage: 38 MB, less than 97.97% of Java online

아놔.. 어제 ㅈㄴ길게 풀어놨느데 velog에 저장이 안되어있네요 진짜 눈물만 나네요..처음에는 그냥 끝에 합만 보고 그 이후로 모든 index일 때 합이 더 큰걸로만 봤다가submit한게 남아있네요...틀렸읍니다그렇게 뇌리에 스친 이름... backtrakcing..

이거 시간 있으면 풀 수 있을거 같으데 진짜 도의적으로 전씨 더 기다리게 하면 안될거 같아서 루션이 베껴왔읍니다...Runtime: 0 ms, faster than 100.00% of Java online submissions for Spiral Matrix.Memor

Time limit exceeded299 / 304 test cases passed.반띵하는 방식을 생각해냄 (logn)진심 개 거지같은 케이스 하나 통과 안됨..303 / 304 test cases passed.Status: Wrong Answer2.00000\-21

Runtime: 6 ms, faster than 68.32% of Java online submissions for Longest Substring Without Repeating Characters.Memory Usage: 39.2 MB, less than 56.34

오랫동안 한 삽질...그리고 포기Runtime: 2 ms, faster than 76.98% of Java online submissions for Add Two Numbers.Memory Usage: 39 MB, less than 90.09% of Java onlin

Runtime: 98 ms, faster than 5.03% of Java online submissions for Maximum Product Subarray.Memory Usage: 39.2 MB, less than 20.99% of Java online submi

Runtime: 13 ms, faster than 77.11% of Java online submissions for LRU Cache.Memory Usage: 47.1 MB, less than 63.00% of Java online submissions for LRU

힝구..나중에 나올수도 있다는 점 간과Runtime: 23 ms, faster than 90.60% of Java online submissions for Longest Palindromic Substring.Memory Usage: 39.1 MB, less than

Runtime: 4 ms, faster than 98.02% of Java online submissions for Largest Number.Memory Usage: 38.9 MB, less than 28.23% of Java online submissions for

Runtime: 3 ms, faster than 83.19% of Java online submissions for Wiggle Sort II.Memory Usage: 41.8 MB, less than 66.38% of Java online submissions for

41 / 77 test cases passed.Runtime: 0 ms, faster than 100.00% of Java online submissions for Validate Binary Search Tree.Memory Usage: 40.8 MB, less th

Runtime: 4 ms, faster than 21.57% of Java online submissions for Surrounded Regions.Memory Usage: 49 MB, less than 5.85% of Java online submissions fo

62 / 318 test cases passed.Runtime: 339 ms, faster than 21.68% of Java online submissions for 3Sum.Memory Usage: 118.4 MB, less than 5.00% of Java onl

Runtime: 3 ms, faster than 17.53% of Java online submissions for Decode Ways.Memory Usage: 39.8 MB, less than 6.36% of Java online submissions for Dec

15 / 989 test cases passed.overflow error..이거만 추가ㅏ하면 overflow는 고쳐지는데time limit이 걸리네요^^...Runtime: 1 ms, faster than 99.98% of Java online submissions

Runtime: 3 ms, faster than 32.20% of Java online submissions for Fraction to Recurring Decimal.Memory Usage: 38.5 MB, less than 13.76% of Java online

3 / 1082 test cases passed.ATOI의 뜻을 잘 이해 못했었음...^^Runtime: 1 ms, faster than 100.00% of Java online submissions for String to Integer (atoi).Memory Us

index out of bounds??Runtime: 484 ms, faster than 5.22% of Java online submissions for Serialize and Deserialize Binary Tree.Memory Usage: 219.2 MB, l

작년에 baby좌가 풀어놨던것\~\~~WRONG ANSWER ^^과연 new 좌는 얼마나 성장했을지?Runtime: 1 ms, faster than 85.26% of Java online submissions for Trapping Rain Water.Memory Us

Time Limit Exceeded17 / 18 test cases passed.흑흑Runtime: 114 ms, faster than 13.76% of Java online submissions for Find Median from Data Stream.Memory

Runtime: 2 ms, faster than 99.51% of Java online submissions for Longest Consecutive Sequence.Memory Usage: 39.1 MB, less than 73.81% of Java online s

Time Limit ExceededDFS를 생각했지만 탐리밋이 걸려버림 ㅠㅠRuntime: 8 ms, faster than 75.16% of Java online submissions for Longest Increasing Path in a Matrix.Memory

원래 하던것....2가지 포지션을 정해놓고 1빠 2빠를 정해놓고 2빠는 무조건 1빠 뒤에.. 1빠가 지나면 2빠가 1빠가 되는 형식가장 기본적인 방식... 귀찮아서 이거로 했는데 타임리밋 ㅠ이걸 쓰다가 뭔가를 생각해낸 좌씨ㅎㅏRuntime: 28 ms, faster t

2중 for 문이와 함께 TIME LIMIT으로 힘차게 시작했읍니다^^Runtime: 4 ms, faster than 80.34% of Java online submissions for Merge k Sorted Lists.Memory Usage: 40.7 MB, le

오늘 4문제 다 타임리밋 걸린거 같은데^^...https://leetcode.com/problems/count-of-smaller-numbers-after-self/discuss/445769/merge-sort-CLEAR-simple-EXPLANATION-wi

93 / 96 test cases passed.Time limit exceeded.91 / 96 test cases passed.Time Limit Exceeded이게 조금 더 빠를줄 알았는데 아니네요..Divide & Conquer 방식...근데 이것도 타임리밋이네요

보자마자 trie생각했지만,,,어떻게 만드는지 몰라 루션이 봤읍니다^^...Runtime: 1 ms, faster than 93.96% of Java online submissions for Word Search II.Memory Usage: 37.6 MB, less

Critical point를 보면 되는 솔루션Runtime: 10 ms, faster than 92.07% of Java online submissions for The Skyline Problem.Memory Usage: 44.2 MB, less than 18.17%

Runtime: 17 ms, faster than 25.92% of Java online submissions for Minimum Window Substring.Memory Usage: 44.5 MB, less than 7.10% of Java online submi

Runtime: 0 ms, faster than 100.00% of Java online submissions for First Missing Positive.Memory Usage: 37 MB, less than 27.09% of Java online submissi

Runtime: 78 ms, faster than 54.04% of Java online submissions for Word Ladder.Memory Usage: 40.4 MB, less than 80.89% of Java online submissions for W

Runtime: 10 ms, faster than 38.07% of Java online submissions for Word Break II.Memory Usage: 39.4 MB, less than 65.61% of Java online submissions for

Runtime: 84 ms, faster than 81.53% of Python3 online submissions for Binary Tree Maximum Path Sum.Memory Usage: 21.4 MB, less than 70.28% of Python3 o

Runtime: 38 ms, faster than 28.71% of Java online submissions for Regular Expression Matching.Memory Usage: 39.7 MB, less than 8.76% of Java online su

흑흑Runtime: 3 ms, faster than 45.74% of Java online submissions for Median of Two Sorted Arrays.Memory Usage: 46.9 MB, less than 6.20% of Java online s

Runtime: 15 ms, faster than 78.27% of Java online submissions for Max Points on a Line.Memory Usage: 38.7 MB, less than 80.97% of Java online submissi

Runtime: 2 ms, faster than 100.00% of Java online submissions for Wildcard Matching.Memory Usage: 38.6 MB, less than 99.84% of Java online submissions

BST니 왼쪽 < 중간 < 오른쪽인 법칙을 이용해서왼 -> 중 -> 오 로 가주는 inorder을 사용해서 list를 만들어줌그 후 kth element를 return전문제랑 비슷한거 같아서 이번엔 파이선으로 풀어봤읍니다아일랜드\~~

Runtime: 10 ms, faster than 13.10% of Java online submissions for Simplify Path.Memory Usage: 39.2 MB, less than 41.99% of Java online submissions for

Runtime: 0 ms, faster than 100.00% of Java online submissions for Missing Number.Memory Usage: 39.7 MB, less than 21.37% of Java online submissions fo

와 이렇게 좋은 점수 처음 받아봐요이렇게만 하자 마존아..^^Runtime: 88 ms, faster than 48.04% of Python3 online submissions for Moving Average from Data Stream.Memory Usage: 1