题号 | ByteDance Top 100 问题列表 | 难度 |
726 | Number of Atoms (/problems/number-of-atoms) | Hard |
679 | Game (/problems/ -game) | Hard |
1849 | Splitting a String Into Descending Consecutive Values (/problems/splitting-a-string-into-descending-consecutive- values) | Medium |
864 | Shortest Path to Get All Keys (/problems/shortest-path-to-get- all-keys) | Hard |
616 | Add Bold Tag in String (/problems/add-bold-tag-in-string) | Medium |
1454 | Active Users (/problems/active-users) | Medium |
630 | Course Schedule III (/problems/course-schedule-iii) | Hard |
298 | Binary Tree Longest Consecutive Sequence (/problems/binary- tree-longest-consecutive-sequence) | Medium |
354 | Russian Doll Envelopes (/problems/russian-doll-envelopes) | Hard |
470 | Implement Rand () Using Rand () (/problems/implement- rand -using-rand ) | Medium |
333 | Largest BST Subtree (/problems/largest-bst-subtree) | Medium |
1352 | Product of the Last K Numbers (/problems/product-of-the-last- k-numbers) | Medium |
199 | Binary Tree Right Side View (/problems/binary-tree-right-side- view) | Medium |
295 | Find Median from Data Stream (/problems/find-median-from- data-stream) | Hard |
628 | Maximum Product of Three Numbers (/problems/maximum-product-of-three-numbers) | Easy |
78 | Subsets (/problems/subsets) | Medium |
935 | Knight Dialer (/problems/knight-dialer) | Medium |
694 | Number of Distinct Islands (/problems/number-of-distinct- islands) | Medium |
236 | Lowest Common Ancestor of a Binary Tree (/problems/lowest- common-ancestor-of-a-binary-tree) | Medium |
489 | Robot Room Cleaner (/problems/robot-room-cleaner) | Hard |
56 | Merge Intervals (/problems/merge-intervals) | Medium |
210 | Course Schedule II (/problems/course-schedule-ii) | Medium |
560 | Subarray Sum Equals K (/problems/subarray-sum-equals-k) | Medium |
398 | Random Pick Index (/problems/random-pick-index) | Medium |
240 | Search a D Matrix II (/problems/search-a- d-matrix-ii) | Medium |
767 | Reorganize String (/problems/reorganize-string) | Medium |
300 | Longest Increasing Subsequence (/problems/longest-increasing- subsequence) | Medium |
1110 | Delete Nodes And Return Forest (/problems/delete-nodes-and- return-forest) | Medium |
51 | N-Queens (/problems/n-queens) | Hard |
23 | Merge k Sorted Lists (/problems/merge-k-sorted-lists) | Hard |
146 | LRU Cache (/problems/lru-cache) | Medium |
224 | Basic Calculator (/problems/basic-calculator) | Hard |
131 | Palindrome Partitioning (/problems/palindrome-partitioning) | Medium |
105 | Construct Binary Tree from Preorder and Inorder Traversal (/problems/construct-binary-tree-from-preorder-and-inorder- traversal) | Medium |
253 | Meeting Rooms II (/problems/meeting-rooms-ii) | Medium |
1048 | Longest String Chain (/problems/longest-string-chain) | Medium |
518 | Coin Change (/problems/coin-change- ) | Medium |
494 | Target Sum (/problems/target-sum) | Medium |
380 | Insert Delete GetRandom O( ) (/problems/insert-delete- getrandom-o ) | Medium |
426 | Convert Binary Search Tree to Sorted Doubly Linked List | Medium |
79 | Word Search (/problems/word-search) | Medium |
207 | Course Schedule (/problems/course-schedule) | Medium |
151 | Reverse Words in a String (/problems/reverse-words-in-a-string) | Medium |
127 | Word Ladder (/problems/word-ladder) | Hard |
209 | Minimum Size Subarray Sum (/problems/minimum-size- subarray-sum) | Medium |
5 | Longest Palindromic Substring (/problems/longest-palindromic- substring) | Medium |
297 | Serialize and Deserialize Binary Tree (/problems/serialize-and- deserialize-binary-tree) | Hard |
202 | Happy Number (/problems/happy-number) | Easy |
34 | Find First and Last Position of Element in Sorted Array (/problems/find-first-and-last-position-of-element-in-sorted- array) | Medium |
21 | Merge Two Sorted Lists (/problems/merge-two-sorted-lists) | Easy |
239 | Sliding Window Maximum (/problems/sliding-window-maximum) | Hard |
76 | Minimum Window Substring (/problems/minimum-window- substring) | Hard |
67 | Add Binary (/problems/add-binary) | Easy |
33 | Search in Rotated Sorted Array (/problems/search-in-rotated- sorted-array) | Medium |
283 | Move Zeroes (/problems/move-zeroes) | Easy |
124 | Binary Tree Maximum Path Sum (/problems/binary-tree- maximum-path-sum) | Hard |
74 | Search a D Matrix (/problems/search-a- d-matrix) | Medium |
347 | Top K Frequent Elements (/problems/top-k-frequent-elements) | Medium |
22 | Generate Parentheses (/problems/generate-parentheses) | Medium |
139 | Word Break (/problems/word-break) | Medium |
31 | Next Permutation (/problems/next-permutation) | Medium |
46 | Permutations (/problems/permutations) | Medium |
66 | Plus One (/problems/plus-one) | Easy |
98 | Validate Binary Search Tree (/problems/validate-binary-search-tree) | Medium |
121 | Best Time to Buy and Sell Stock (/problems/best-time-to-buy- and-sell-stock) | Easy |