-
Notifications
You must be signed in to change notification settings - Fork 1
Meeting 20200427
HyungJune edited this page Jul 16, 2020
·
1 revision
- atoi
- Merge Two Sorted Lists
- Add Two Numbers
- 신형준
- Picnic 완성을 목표
- ZigZag Conversion
- 유하람
- Longest Substring Without Repeating Charaters
- 자료구조 중 Tree를 공부하고 예제를 하나 제공
다음주(5월 4일)는 패스 (신형준 제주감), 그 다음 스터디는 11일에 진행 => 코로나 19 사태로 잠정적으로 일정연기
- Roman to Integer
- Integer to Roman
- Two Sum
- Palindrome Number
- ComposeRanges
- Regular Expression Matching
- Vaild Parentheses
- atoi
- Merge Two Sorted Lists
- Add Two Numbers
- Picnic
- ZigZag Conversion
- Longest Substring Without Repeating Charaters
- Container-with-most-water
- Longest-Common-Prefix
- Data Structure: Binary Search Tree
- Maximum Subarray-divide and conquer로
- Climbing Stairs
- Symmetric Tree
- 3Sum
- Best Time to Buy and Sell Stock
- Maximum Depth of Binary Tree
- Binary Tree Maximum Path Sum
- Check If a String Is a Valid Sequence from Root to Leaves Path in a Binary Tree
- Remove Nth Node From End of List
- Single Number
- Number of Good Pairs
- Running Sum of 1d Array
- Number Of Islands
- Group the People Given the Group Size They Belong To
- Invert Binary Tree
- Reverse Linked List
- LRU Cache
- Merge Two Binary Trees
- Counting Bits
- Binary Search Tree to Greater Sum Tree
- 2 Keys Keyboard
- Validate IP Address
- Product of Array Except Self
- Excel Sheet Column Number
- 3Sum Closet
- Queue Reconstruction by Height
- Majority Element
- Max Increase to Keep City Skyline
- Total Hamming Distance
- Permutations
- Move Zeroes
- Print Immutable Linked List in Reverse
- Dot Product of Two Sparse Vectors
- Shuffle the Array
- Deepest Leaves Sum
- Letter Combinations of a Phone Number
- Count of Smaller Numbers After Self
- Binary Tree Inorder Traversal
- Isomorphic Strings
- Group Anagrams
- Convert Sorted Array to Binary Search Tree
- Linked List Cycle
- Generate Parentheses
- 4Sum
- Unique Paths
- Diameter of Binary Tree