2021/03/22 ~ 2021/03/29 풀 문제
Easy
125번(String : Valid Palindrome)
136번(Hash Table, Two Pointers, Bit Manipulation : Single Number)
141번(Linked List : Linked List Cycle)
메모 : 204번, DP 적용되는지 확인 필요. 102,103, 107번은 더 효율적인 풀이 필요.
메모2 : 당분간 easy 위주로 풀이. Medium에 들어가는 시간이 너무 많다ㅠ
메모3 : 아 당분간 3문제. 할 게 더 늘어났다.
일지
2021/04/01 (일) : 118번(Array : Pascal's Trangle)
2021/04/02 (토) : 119번(Array : Pascal's Trangle II)
2021/04/03 (금) : 121번(Array, Dynamic Programming : Best Time to Buy and Sell Stock)
2021/04/04 (목) : 112번(Tree : Path Sum)
2021/03/27 (토) : 69번(Math, Binary Search : Sqrt(x)), 88번(Array, Two Pointers : Merge Sorted Array)
2021/03/25 (목) : 83번(Linked List : Remove Duplicates from Sorted List)
2021/03/23 (화) : 70번(Dynamic Programming : Climbing Stairs)
2021/03/21 (일) : 58번(String : Length of Last Word)
2021/03/20 (토) : 53번(Array, Divide and conquer, Dynamic Programming : Maximum Subarray)
2021/03/18 (목) : 66번(Array : Plus One)
2021/03/17 (수)) : 67번(Math, Two Pointers, String : Add Binary)
2021/03/14 (일) : 28번(String, Two Pointers : Implement strStr()), 35번(Array, Binary Search : Search Insert Position)
2021/03/13 (토) : 20번(String, Stack : Valid Parentheses), 27번(Array, Two Pointers : Remove Element)
2021/03/11 (목) : 14번(String, Longest Common Prefix)
2021/03/07 (일) : 1번(Array : Two Sum), 9번(Math : Two Sum), 13번(Math : numTwo Sum)
2021/03/06 (토) : 111번(Tree : Minimum Depth of Binary Treesss)
2021/03/04 (목) : 21번(LinkedList : Merge Two Sorted Lists)
2021/02/26 (금) : 237번(LinkedList : Delete Node in a Linked List)
2021/02/21 (일) : 105번(Tree : Construct Binary Tree from Preorder and Inorder Traversal) map으로는 어떻게 푸는 건지 따라가보자.
2021/02/20 (토) : 107번(Tree : Binary Tree Level Order Traversal II), 110번(Tree : Balanced Binary Tree) 참고 : 102, 103, 107은 유사한 문제. 그리고 성능 개선 필요
2021/02/19 (금) : 103번(Tree : Binary Tree Zigzag Level Order Traversal)
2021/02/18 (목) : 100번(Tree : Same Tree)
2021/02/14 (일) : 108번(Tree : Convert Sorted Array to Binary Search Tree), 326번(Math : Power of Three);
2021/02/13 (토) : 204번(Math : Count Primes) - DP로 풀 수 있는지 확인해볼 것, 412번(Math : Fizz Buzz), 102번(Tree : Binary Tree Level Order Traversal);
2021/02/07 (일) : 98번(Tree : Validate Binary Search Tree), 101번(Tree : Symmetric Tree), 104번(Tree : Maximum Depth of Binary Tree);
2021/01/31 (일) : 189번(Array : Rotate Array);
2021/01/23 (토) : 7번(String : Reverse Integer), 122번(Array : Best Time to Buy and Sell Stock II);