Skip to content

Meeting 20201110

Jump to bottom
HyungJune edited this page Nov 10, 2020 · 2 revisions

참가자: 신형준, 유하람, 조동규

1. 알고리즘 공유
  • Shuffle the Array
  • Deepest Leaves Sum
2. 다음 주 공유 내용
  • 신형준
  • 유하람
  • 조동규

Meet Up

Shared

  1. Roman to Integer
  2. Integer to Roman
  3. Two Sum
  4. Palindrome Number
  5. ComposeRanges
  6. Regular Expression Matching
  7. Vaild Parentheses
  8. atoi
  9. Merge Two Sorted Lists
  10. Add Two Numbers
  11. Picnic
  12. ZigZag Conversion
  13. Longest Substring Without Repeating Charaters
  14. Container-with-most-water
  15. Longest-Common-Prefix
  16. Data Structure: Binary Search Tree
  17. Maximum Subarray-divide and conquer로
  18. Climbing Stairs
  19. Symmetric Tree
  20. 3Sum
  21. Best Time to Buy and Sell Stock
  22. Maximum Depth of Binary Tree
  23. Binary Tree Maximum Path Sum
  24. Check If a String Is a Valid Sequence from Root to Leaves Path in a Binary Tree
  25. Remove Nth Node From End of List
  26. Single Number
  27. Number of Good Pairs
  28. Running Sum of 1d Array
  29. Number Of Islands
  30. Group the People Given the Group Size They Belong To
  31. Invert Binary Tree
  32. Reverse Linked List
  33. LRU Cache
  34. Merge Two Binary Trees
  35. Counting Bits
  36. Binary Search Tree to Greater Sum Tree
  37. 2 Keys Keyboard
  38. Validate IP Address
  39. Product of Array Except Self
  40. Excel Sheet Column Number
  41. 3Sum Closet
  42. Queue Reconstruction by Height
  43. Majority Element
  44. Max Increase to Keep City Skyline
  45. Total Hamming Distance
  46. Permutations
  47. Move Zeroes
  48. Print Immutable Linked List in Reverse
  49. Dot Product of Two Sparse Vectors
  50. Shuffle the Array
  51. Deepest Leaves Sum
  52. Letter Combinations of a Phone Number
  53. Count of Smaller Numbers After Self
  54. Binary Tree Inorder Traversal
  55. Isomorphic Strings
  56. Group Anagrams
  57. Convert Sorted Array to Binary Search Tree
  58. Linked List Cycle
  59. Generate Parentheses
  60. 4Sum
  61. Unique Paths
  62. Diameter of Binary Tree

Clone this wiki locally