[公司] Meta

[ylqi007]

• [x] 314. Binary Tree Vertical Order Traversal [BFS, ArrayDeque]
  • [x] 102. Binary Tree Level Order Traversal [BFS]
• [x] 🟩🌟 408. Valid Word Abbreviation [Two Pointers, ⚠️注意分析]
• [x] 1249. Minimum Remove to Make Valid Parenthes [Stack, ArrayDeque]
  • [x] 1963. Minimum Number of Swaps to Make the String Balanced
  • [ ] 2116. Check if a Parentheses String Can Be Valid
• [x] 339. Nested List Weight Sum [DFS]
  • [x] 364. Nested List Weight Sum II
  • [ ] 🟥 565. Array Nesting [Apple的]
  • [ ] 690. Employee Importance [DFS, BFS]
• [x] 1650. Lowest Common Ancestor of a Binary Tree III
  • [x] 235. Lowest Common Ancestor of a Binary Search Tree [Recursion递归, Iteration迭代]
  • [x] 236. Lowest Common Ancestor of a Binary Tree [前提p != q，p and q will exist in the tree.]
  • [x] 1644. Lowest Common Ancestor of a Binary Tree II
  • [x] 🟨🌟1650. Lowest Common Ancestor of a Binary Tree III [其实就是两个LinkedList的交叉点]
  • [x] 🟨🌟1676. Lowest Common Ancestor of a Binary Tree IV
• [ ] 🟩🌟680. Valid Palindrome II [注意复杂度分析O(N)]
  • [ ] 125. Valid Palindrome
• [ ] 1570. Dot Product of Two Sparse Vectors
• [ ] 1762. Buildings With an Ocean View
• [ ] 528. Random Pick with Weight
• [ ] 227. Basic Calculator II
• [ ] 215. Kth Largest Element in an Array
• [ ] 938. Range Sum of BST
• [ ] 71. Simplify Path
• [ ] 691. Stickers to Spell Word
• [ ] 236. Lowest Common Ancestor of a Binary Tree
• [ ] 346. Moving Average from Data Stream
• [ ] 791. Custom Sort String
• [ ] 1091. Shortest Path in Binary Matrix
• [ ] 426. Convert Binary Search Tree to Sorted Doubly Linked List
• [ ] 827. Making A Large Island
• [ ] 921. Minimum Add to Make Parentheses Valid
• [ ] 50. Pow(x, n)
• [ ] 973. K Closest Points to Origin
• [ ] 162. Find Peak Element
• [ ] 560. Subarray Sum Equals K
• [ ] 199. Binary Tree Right Side View
• [ ] 708. Insert into a Sorted Circular Linked List
• [x] 138. Copy List with Random Pointer
• [x] 🟨🌟 249. Group Shifted Strings
  • [ ] 49. Group Anagrams
  • [ ] 2744. Find Maximum Number of String Pairs
• [ ] 🟥🌟65. Valid Number
  • [ ] 8. String to Integer (atoi)
• [x] 129. Sum Root to Leaf Numbers
  • [ ] 112. Path Sum
  • [ ] 124. Binary Tree Maximum Path Sum
  • [ ] 988. Smallest String Starting From Leaf
• [x] 543. Diameter of Binary Tree
  • [ ] 1522. Diameter of N-Ary Tree
  • [ ] 🟥2246. Longest Path With Different Adjacent Characters
• [x] 🟨🌟986. Interval List Intersections
  • [x] 56. Merge Intervals
  • [x] 88. Merge Sorted Array
  • [x] 759. Employee Free Time
  • [x] 2410. Maximum Matching of Players With Trainers
• [x] 🟨🌟56. Merge Intervals
• [x] 146. LRU Cache
  • [ ] 460. LFU Cache
  • [ ] 588. Design In-Memory File System
  • [ ] 604. Design Compressed String Iterator
  • [ ] 1756. Design Most Recently Used Queue
• [x] 398. Random Pick Index
  • [ ] 382. Linked List Random Node
  • [ ] 710. Random Pick with Blacklist
  • [ ] 528. Random Pick with Weight
• [x] 670. Maximum Swap
• [x] 🟨🌟498. Diagonal Traverse
• [x] 88. Merge Sorted Array
• [ ] 🟨🌟31. Next Permutation
• [ ] 301. Remove Invalid Parentheses
  • [ ] 20. Valid Parentheses
  • [ ] 1963. Minimum Number of Swaps to Make the String Balanced
• [x] 🟥🌟317. Shortest Distance from All Buildings
  • [ ] 286. Walls and Gates
  • [ ] 296. Best Meeting Point
  • [ ] 1162. As Far from Land as Possible
• [ ] 🟥🌟987. Vertical Order Traversal of a Binary Tree
  • [ ] 314. Binary Tree Vertical Order Traversal
• [x] 766. Toeplitz Matrix
  • [ ] 422. Valid Word Square
• [ ] 347. Top K Frequent Elements
• [ ] 23. Merge k Sorted Lists
• [x] 125. Valid Palindrome
• [ ] 636. Exclusive Time of Functions
• [ ] 270. Closest Binary Search Tree Value
• [ ] 1868. Product of Two Run-Length Encoded Arrays

[ylqi007]

面经

• [ ] 347. Top K Frequent Elements
  • 3开头那道题目问如果 1<k <<N(nums长度), 就是需要的k比N要少很多很多该怎么办, 我最早觉得用heap 这样space会很低 所以先写了heap,沟通follow up后感觉面试官希望用bucket sort那个方法 time ON, 于是两种方法都写了, 也dry run了
• [ ] 543. Diameter of Binary Tree
  • follow up问如果要算diameter的同时还要记录valid path 怎么办, time complexity 是多少, 只需要我说time,也说了也还是ON, 还把psedo code 的if 判断也大概写了 + dryrun
• [ ] 207. Course Schedule
• [ ] 314. Binary Tree Vertical Order Traversal
• [x] 🟨🌟1249. Minimum Remove to Make Valid Parentheses
• [ ] 983. Minimum Cost For Tickets
• [ ] 236. Lowest Common Ancestor of a Binary Tree
• [ ] 121. Best Time to Buy and Sell Stock
• [ ] 1197. Minimum Knight Moves
• [ ] 1091. Shortest Path in Binary Matrix
• [x] 408. Valid Word Abbreviation
• [ ] 252. Meeting Rooms
• [ ] 253. Meeting Rooms II
• [x] 🟨🌟56. Merge Intervals
• [ ] Valid Palindrome
  • [x] 🟨🌟125. Valid Palindrome
  • [x] 🟨🌟680. Valid Palindrome II
  • [x] 1216. Valid Palindrome III